/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION --traceabstraction.abstraction.used.for.commutativity.in.por VARIABLES_GLOBAL -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-57af04c-m [2024-01-26 08:27:42,664 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-26 08:27:42,726 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-01-26 08:27:42,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-26 08:27:42,730 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-26 08:27:42,756 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-26 08:27:42,756 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-26 08:27:42,756 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-26 08:27:42,757 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-26 08:27:42,760 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-26 08:27:42,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-26 08:27:42,761 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-26 08:27:42,761 INFO L153 SettingsManager]: * Use SBE=true [2024-01-26 08:27:42,762 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-26 08:27:42,762 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-26 08:27:42,762 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-26 08:27:42,762 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-26 08:27:42,763 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-26 08:27:42,763 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-26 08:27:42,763 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-26 08:27:42,763 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-26 08:27:42,763 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-26 08:27:42,764 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-26 08:27:42,765 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-26 08:27:42,765 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-26 08:27:42,765 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-26 08:27:42,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-26 08:27:42,765 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-01-26 08:27:42,766 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-26 08:27:42,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 08:27:42,767 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-26 08:27:42,767 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-26 08:27:42,767 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-26 08:27:42,767 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-26 08:27:42,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-26 08:27:42,767 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-26 08:27:42,767 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-01-26 08:27:42,767 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-26 08:27:42,767 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-01-26 08:27:42,768 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/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstraction used for commutativity in POR -> VARIABLES_GLOBAL [2024-01-26 08:27:42,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-26 08:27:42,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-26 08:27:43,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-26 08:27:43,001 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-26 08:27:43,001 INFO L274 PluginConnector]: CDTParser initialized [2024-01-26 08:27:43,002 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c [2024-01-26 08:27:44,134 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-26 08:27:44,296 INFO L384 CDTParser]: Found 1 translation units. [2024-01-26 08:27:44,297 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c [2024-01-26 08:27:44,305 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d95865e88/3ddee61b53704052b81d3f3bbe4af815/FLAG2e73e1256 [2024-01-26 08:27:44,319 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d95865e88/3ddee61b53704052b81d3f3bbe4af815 [2024-01-26 08:27:44,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-26 08:27:44,322 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-26 08:27:44,325 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-26 08:27:44,325 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-26 08:27:44,328 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-26 08:27:44,329 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 08:27:44" (1/1) ... [2024-01-26 08:27:44,330 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@248d126e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 08:27:44, skipping insertion in model container [2024-01-26 08:27:44,330 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 08:27:44" (1/1) ... [2024-01-26 08:27:44,360 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-26 08:27:44,535 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c[2644,2657] [2024-01-26 08:27:44,548 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 08:27:44,558 INFO L202 MainTranslator]: Completed pre-run [2024-01-26 08:27:44,590 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c[2644,2657] [2024-01-26 08:27:44,592 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 08:27:44,603 INFO L206 MainTranslator]: Completed translation [2024-01-26 08:27:44,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 08:27:44 WrapperNode [2024-01-26 08:27:44,604 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-26 08:27:44,605 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-26 08:27:44,605 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-26 08:27:44,605 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-26 08:27:44,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 08:27:44" (1/1) ... [2024-01-26 08:27:44,642 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 08:27:44" (1/1) ... [2024-01-26 08:27:44,673 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 196 [2024-01-26 08:27:44,673 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-26 08:27:44,674 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-26 08:27:44,674 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-26 08:27:44,674 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-26 08:27:44,680 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 08:27:44" (1/1) ... [2024-01-26 08:27:44,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 08:27:44" (1/1) ... [2024-01-26 08:27:44,692 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 08:27:44" (1/1) ... [2024-01-26 08:27:44,693 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 08:27:44" (1/1) ... [2024-01-26 08:27:44,704 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 08:27:44" (1/1) ... [2024-01-26 08:27:44,707 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 08:27:44" (1/1) ... [2024-01-26 08:27:44,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 08:27:44" (1/1) ... [2024-01-26 08:27:44,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 08:27:44" (1/1) ... [2024-01-26 08:27:44,711 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-26 08:27:44,721 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-26 08:27:44,722 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-26 08:27:44,722 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-26 08:27:44,723 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 08:27:44" (1/1) ... [2024-01-26 08:27:44,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 08:27:44,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 08:27:44,745 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-01-26 08:27:44,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-01-26 08:27:44,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-26 08:27:44,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-01-26 08:27:44,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-26 08:27:44,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-01-26 08:27:44,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-01-26 08:27:44,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-01-26 08:27:44,767 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-26 08:27:44,768 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-26 08:27:44,768 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-26 08:27:44,768 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-26 08:27:44,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-01-26 08:27:44,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-26 08:27:44,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-26 08:27:44,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-26 08:27:44,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-26 08:27:44,771 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-26 08:27:44,868 INFO L241 CfgBuilder]: Building ICFG [2024-01-26 08:27:44,870 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-26 08:27:45,196 INFO L282 CfgBuilder]: Performing block encoding [2024-01-26 08:27:45,207 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-26 08:27:45,207 INFO L309 CfgBuilder]: Removed 7 assume(true) statements. [2024-01-26 08:27:45,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 08:27:45 BoogieIcfgContainer [2024-01-26 08:27:45,207 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-26 08:27:45,209 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-26 08:27:45,209 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-26 08:27:45,211 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-26 08:27:45,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.01 08:27:44" (1/3) ... [2024-01-26 08:27:45,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e726edf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 08:27:45, skipping insertion in model container [2024-01-26 08:27:45,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 08:27:44" (2/3) ... [2024-01-26 08:27:45,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e726edf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 08:27:45, skipping insertion in model container [2024-01-26 08:27:45,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 08:27:45" (3/3) ... [2024-01-26 08:27:45,214 INFO L112 eAbstractionObserver]: Analyzing ICFG loop-tiling-eq.wvr.c [2024-01-26 08:27:45,221 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-26 08:27:45,228 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-26 08:27:45,228 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-26 08:27:45,228 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-26 08:27:45,291 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-26 08:27:45,331 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 08:27:45,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-26 08:27:45,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 08:27:45,333 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-01-26 08:27:45,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-01-26 08:27:45,360 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-01-26 08:27:45,365 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-01-26 08:27:45,370 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@8852c46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 08:27:45,370 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-01-26 08:27:45,576 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 08:27:45,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 08:27:45,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1017928091, now seen corresponding path program 1 times [2024-01-26 08:27:45,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 08:27:45,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067226240] [2024-01-26 08:27:45,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 08:27:45,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 08:27:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 08:27:45,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 08:27:45,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067226240] [2024-01-26 08:27:45,768 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2024-01-26 08:27:45,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361882984] [2024-01-26 08:27:45,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 08:27:45,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 08:27:45,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 08:27:45,803 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 08:27:45,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-01-26 08:27:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 08:27:45,960 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 1 conjunts are in the unsatisfiable core [2024-01-26 08:27:45,968 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 08:27:46,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 08:27:46,000 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-26 08:27:46,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361882984] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 08:27:46,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 08:27:46,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-26 08:27:46,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457332980] [2024-01-26 08:27:46,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 08:27:46,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-26 08:27:46,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 08:27:46,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-26 08:27:46,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-26 08:27:46,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:27:46,029 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 08:27:46,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 90.0) internal successors, (180), 2 states have internal predecessors, (180), 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) [2024-01-26 08:27:46,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:27:46,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:27:46,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-01-26 08:27:46,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-01-26 08:27:46,285 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 08:27:46,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 08:27:46,286 INFO L85 PathProgramCache]: Analyzing trace with hash 429941276, now seen corresponding path program 1 times [2024-01-26 08:27:46,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 08:27:46,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641201541] [2024-01-26 08:27:46,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 08:27:46,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 08:27:46,323 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-01-26 08:27:46,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [899941589] [2024-01-26 08:27:46,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 08:27:46,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 08:27:46,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 08:27:46,328 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 08:27:46,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-01-26 08:27:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 08:27:46,439 INFO L262 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 7 conjunts are in the unsatisfiable core [2024-01-26 08:27:46,451 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 08:27:46,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 08:27:46,669 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-26 08:27:46,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 08:27:46,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641201541] [2024-01-26 08:27:46,670 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-01-26 08:27:46,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899941589] [2024-01-26 08:27:46,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899941589] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 08:27:46,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 08:27:46,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-26 08:27:46,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570777266] [2024-01-26 08:27:46,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 08:27:46,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-26 08:27:46,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 08:27:46,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-26 08:27:46,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-26 08:27:46,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:27:46,673 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 08:27:46,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 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) [2024-01-26 08:27:46,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:27:46,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:27:46,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:27:46,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:27:46,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-01-26 08:27:47,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 08:27:47,034 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 08:27:47,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 08:27:47,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1576378400, now seen corresponding path program 1 times [2024-01-26 08:27:47,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 08:27:47,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119322349] [2024-01-26 08:27:47,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 08:27:47,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 08:27:47,062 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-01-26 08:27:47,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [127703447] [2024-01-26 08:27:47,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 08:27:47,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 08:27:47,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 08:27:47,064 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 08:27:47,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-01-26 08:27:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 08:27:47,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 4 conjunts are in the unsatisfiable core [2024-01-26 08:27:47,192 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 08:27:47,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 08:27:47,272 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 08:27:47,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 08:27:47,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 08:27:47,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119322349] [2024-01-26 08:27:47,341 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-01-26 08:27:47,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127703447] [2024-01-26 08:27:47,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127703447] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 08:27:47,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-26 08:27:47,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2024-01-26 08:27:47,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040646453] [2024-01-26 08:27:47,342 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-26 08:27:47,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-26 08:27:47,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 08:27:47,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-26 08:27:47,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-01-26 08:27:47,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:27:47,344 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 08:27:47,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 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) [2024-01-26 08:27:47,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:27:47,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:27:47,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:27:47,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:27:47,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:27:47,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:27:47,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-01-26 08:27:47,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 08:27:47,629 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 08:27:47,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 08:27:47,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1956671754, now seen corresponding path program 1 times [2024-01-26 08:27:47,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 08:27:47,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949718023] [2024-01-26 08:27:47,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 08:27:47,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 08:27:47,647 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-01-26 08:27:47,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [889807468] [2024-01-26 08:27:47,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 08:27:47,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 08:27:47,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 08:27:47,649 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 08:27:47,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-01-26 08:27:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 08:27:47,772 INFO L262 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-26 08:27:47,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 08:27:47,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 08:27:47,933 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-26 08:27:47,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 08:27:47,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949718023] [2024-01-26 08:27:47,933 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-01-26 08:27:47,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889807468] [2024-01-26 08:27:47,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889807468] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 08:27:47,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 08:27:47,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-26 08:27:47,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141912607] [2024-01-26 08:27:47,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 08:27:47,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-26 08:27:47,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 08:27:47,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-26 08:27:47,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-01-26 08:27:47,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:27:47,937 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 08:27:47,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.125) internal successors, (209), 8 states have internal predecessors, (209), 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) [2024-01-26 08:27:47,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:27:47,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:27:47,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:27:47,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:27:48,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:27:48,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:27:48,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:27:48,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-01-26 08:27:48,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-01-26 08:27:48,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 08:27:48,458 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 08:27:48,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 08:27:48,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1557554953, now seen corresponding path program 1 times [2024-01-26 08:27:48,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 08:27:48,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823793402] [2024-01-26 08:27:48,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 08:27:48,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 08:27:48,479 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-01-26 08:27:48,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [944001808] [2024-01-26 08:27:48,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 08:27:48,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 08:27:48,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 08:27:48,484 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 08:27:48,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-01-26 08:27:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 08:27:48,605 INFO L262 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-26 08:27:48,608 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 08:27:48,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 08:27:48,692 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 08:27:48,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 08:27:48,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 08:27:48,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823793402] [2024-01-26 08:27:48,823 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-01-26 08:27:48,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944001808] [2024-01-26 08:27:48,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944001808] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-26 08:27:48,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-26 08:27:48,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2024-01-26 08:27:48,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939242600] [2024-01-26 08:27:48,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 08:27:48,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-26 08:27:48,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 08:27:48,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-26 08:27:48,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-01-26 08:27:48,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:27:48,825 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 08:27:48,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 31.0) internal successors, (217), 7 states have internal predecessors, (217), 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) [2024-01-26 08:27:48,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:27:48,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:27:48,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:27:48,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-01-26 08:27:48,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:27:49,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:27:49,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:27:49,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:27:49,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-01-26 08:27:49,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:27:49,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-01-26 08:27:49,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 08:27:49,228 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 08:27:49,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 08:27:49,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1192514433, now seen corresponding path program 1 times [2024-01-26 08:27:49,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 08:27:49,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643951876] [2024-01-26 08:27:49,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 08:27:49,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 08:27:49,247 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-01-26 08:27:49,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1501582647] [2024-01-26 08:27:49,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 08:27:49,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 08:27:49,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 08:27:49,249 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 08:27:49,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-01-26 08:27:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 08:27:49,401 INFO L262 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 11 conjunts are in the unsatisfiable core [2024-01-26 08:27:49,406 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 08:27:49,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-26 08:27:49,792 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-26 08:27:49,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 08:27:49,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643951876] [2024-01-26 08:27:49,793 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-01-26 08:27:49,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501582647] [2024-01-26 08:27:49,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501582647] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 08:27:49,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 08:27:49,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-01-26 08:27:49,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315551693] [2024-01-26 08:27:49,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 08:27:49,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-01-26 08:27:49,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 08:27:49,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-01-26 08:27:49,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-01-26 08:27:49,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:27:49,796 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 08:27:49,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 18.833333333333332) internal successors, (226), 12 states have internal predecessors, (226), 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) [2024-01-26 08:27:49,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:27:49,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:27:49,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:27:49,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-01-26 08:27:49,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:27:49,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:27:50,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:27:50,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:27:50,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:27:50,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-01-26 08:27:50,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:27:50,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 08:27:50,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-01-26 08:27:50,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-01-26 08:27:50,413 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 08:27:50,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 08:27:50,414 INFO L85 PathProgramCache]: Analyzing trace with hash -971213643, now seen corresponding path program 1 times [2024-01-26 08:27:50,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 08:27:50,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966039485] [2024-01-26 08:27:50,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 08:27:50,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 08:27:50,434 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-01-26 08:27:50,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [423161911] [2024-01-26 08:27:50,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 08:27:50,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 08:27:50,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 08:27:50,449 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 08:27:50,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-01-26 08:27:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 08:27:50,634 INFO L262 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-26 08:27:50,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 08:27:50,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-26 08:27:50,755 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 08:27:50,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-26 08:27:50,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 08:27:50,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966039485] [2024-01-26 08:27:50,911 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-01-26 08:27:50,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423161911] [2024-01-26 08:27:50,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423161911] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-26 08:27:50,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-26 08:27:50,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2024-01-26 08:27:50,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890191265] [2024-01-26 08:27:50,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 08:27:50,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-26 08:27:50,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 08:27:50,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-26 08:27:50,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-01-26 08:27:50,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:27:50,913 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 08:27:50,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.57142857142857) internal successors, (242), 7 states have internal predecessors, (242), 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) [2024-01-26 08:27:50,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:27:50,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:27:50,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:27:50,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-01-26 08:27:50,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:27:50,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 08:27:50,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:27:51,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:27:51,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:27:51,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:27:51,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-01-26 08:27:51,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:27:51,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 08:27:51,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:27:51,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-01-26 08:27:51,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 08:27:51,249 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 08:27:51,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 08:27:51,249 INFO L85 PathProgramCache]: Analyzing trace with hash -2066446566, now seen corresponding path program 1 times [2024-01-26 08:27:51,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 08:27:51,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404998370] [2024-01-26 08:27:51,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 08:27:51,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 08:27:51,282 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-01-26 08:27:51,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [605355069] [2024-01-26 08:27:51,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 08:27:51,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 08:27:51,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 08:27:51,295 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 08:27:51,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-01-26 08:27:51,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 08:27:51,531 INFO L262 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 134 conjunts are in the unsatisfiable core [2024-01-26 08:27:51,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 08:27:51,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-01-26 08:27:52,275 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-01-26 08:27:52,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-01-26 08:27:52,694 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-01-26 08:27:52,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-01-26 08:27:53,329 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-01-26 08:27:53,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-01-26 08:27:54,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-01-26 08:27:54,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-26 08:27:54,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-01-26 08:27:54,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-26 08:27:54,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-01-26 08:27:54,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2024-01-26 08:27:54,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-01-26 08:27:55,721 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-01-26 08:27:55,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 67 [2024-01-26 08:27:55,737 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-01-26 08:27:55,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 33 [2024-01-26 08:27:55,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 40 [2024-01-26 08:27:56,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 42 [2024-01-26 08:27:56,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2024-01-26 08:27:56,958 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 08:27:56,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2024-01-26 08:27:57,071 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 08:27:57,071 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 08:27:58,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 08:27:58,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 322 treesize of output 290 [2024-01-26 08:27:58,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 137 [2024-01-26 08:28:29,929 INFO L349 Elim1Store]: treesize reduction 4, result has 97.6 percent of original size [2024-01-26 08:28:29,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3372 treesize of output 2806 [2024-01-26 08:28:32,948 INFO L349 Elim1Store]: treesize reduction 4, result has 97.6 percent of original size [2024-01-26 08:28:32,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2320 treesize of output 1754 [2024-01-26 08:28:35,355 INFO L349 Elim1Store]: treesize reduction 8, result has 97.2 percent of original size [2024-01-26 08:28:35,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 9411 treesize of output 7835 [2024-01-26 08:29:00,246 INFO L349 Elim1Store]: treesize reduction 4, result has 97.6 percent of original size [2024-01-26 08:29:00,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4602 treesize of output 3836 [2024-01-26 08:29:05,478 INFO L349 Elim1Store]: treesize reduction 4, result has 97.6 percent of original size [2024-01-26 08:29:05,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3308 treesize of output 2542 [2024-01-26 08:29:09,042 INFO L349 Elim1Store]: treesize reduction 8, result has 97.2 percent of original size [2024-01-26 08:29:09,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 5727 treesize of output 4615 [2024-01-26 08:29:33,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 08:29:33,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 66 [2024-01-26 08:29:33,549 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-01-26 08:29:33,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18732 treesize of output 18020 [2024-01-26 08:29:33,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 316 treesize of output 268 [2024-01-26 08:29:33,624 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-01-26 08:29:33,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 384 treesize of output 364 [2024-01-26 08:29:33,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-26 08:29:33,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 229 [2024-01-26 08:29:33,654 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-01-26 08:29:33,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 348 treesize of output 304 [2024-01-26 08:29:33,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 08:29:33,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 98 [2024-01-26 08:29:33,804 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-01-26 08:29:33,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26779 treesize of output 25739 [2024-01-26 08:29:33,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 651 treesize of output 555 [2024-01-26 08:29:33,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-26 08:29:33,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 263 treesize of output 207 [2024-01-26 08:29:33,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-26 08:29:33,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 171 [2024-01-26 08:29:33,955 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-01-26 08:29:33,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 293 treesize of output 201 [2024-01-26 08:29:34,201 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 08:29:34,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 1 [2024-01-26 08:29:34,207 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 08:29:34,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 1 [2024-01-26 08:29:34,218 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 08:29:34,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 1 [2024-01-26 08:29:43,503 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-01-26 08:29:43,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2024-01-26 08:29:43,510 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-01-26 08:29:43,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2024-01-26 08:29:44,561 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 08:29:44,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 08:29:44,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404998370] [2024-01-26 08:29:44,561 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-01-26 08:29:44,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605355069] [2024-01-26 08:29:44,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605355069] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 08:29:44,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-26 08:29:44,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 52] total 106 [2024-01-26 08:29:44,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925484122] [2024-01-26 08:29:44,562 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-26 08:29:44,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2024-01-26 08:29:44,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 08:29:44,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2024-01-26 08:29:44,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=578, Invalid=10461, Unknown=91, NotChecked=0, Total=11130 [2024-01-26 08:29:44,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:29:44,570 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 08:29:44,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 106 states, 106 states have (on average 4.452830188679245) internal successors, (472), 106 states have internal predecessors, (472), 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) [2024-01-26 08:29:44,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:29:44,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:29:44,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:29:44,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-01-26 08:29:44,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:29:44,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 08:29:44,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:29:44,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:29:47,314 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse13 (* c_thread1Thread1of1ForFork0_~i~0 4)) (.cse79 (select |c_#memory_$Pointer$.base| c_~B~0.base))) (let ((.cse40 (select .cse79 (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset))) (.cse77 (select |c_#memory_int| c_~A~0.base)) (.cse162 (+ c_~A~0.offset .cse13)) (.cse24 (select .cse79 c_~B~0.offset))) (let ((.cse103 (= c_~B~0.base .cse24)) (.cse163 (select |c_#memory_int| c_~F~0.base)) (.cse164 (* (* c_thread2Thread1of1ForFork1_~i~1 c_~M~0) 4)) (.cse95 (* c_thread2Thread1of1ForFork1_~j~0 4)) (.cse18 (store |c_#memory_int| c_~A~0.base (store .cse77 .cse162 |c_thread1Thread1of1ForFork0_#t~mem2|))) (.cse55 (= .cse40 c_~B~0.base))) (let ((.cse48 (not .cse55)) (.cse19 (select (select .cse18 c_~F~0.base) c_~F~0.offset)) (.cse107 (select |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base|)) (.cse108 (+ .cse95 |c_thread2Thread1of1ForFork1_#t~mem5.offset|)) (.cse96 (select .cse163 (+ .cse95 .cse164 c_~F~0.offset))) (.cse41 (select |c_#memory_int| .cse40)) (.cse42 (select .cse163 (+ .cse164 c_~F~0.offset))) (.cse45 (not .cse103)) (.cse7 (+ c_~F~0.offset .cse13)) (.cse30 (< c_~N~0 1)) (.cse25 (select |c_#memory_int| .cse24)) (.cse26 (select .cse163 c_~F~0.offset)) (.cse74 (= .cse162 c_~F~0.offset)) (.cse0 (forall ((v_ArrVal_601 (Array Int Int))) (= c_~B~0.base (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset)))) (.cse73 (= c_thread1Thread1of1ForFork0_~i~0 0)) (.cse2 (* 4 c_~M~0)) (.cse3 (+ 5 c_~F~0.offset)) (.cse5 (< c_~M~0 1))) (and (or .cse0 (let ((.cse4 (+ 2 c_thread1Thread1of1ForFork0_~i~0)) (.cse10 (* c_~A~0.offset (- 1)))) (and (or (forall ((~a~0 Int)) (let ((.cse1 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse1 4) .cse2) .cse3) (< (+ .cse1 c_~M~0) .cse4) (< c_~N~0 (+ ~a~0 1))))) .cse5) (or .cse5 (forall ((~a~0 Int)) (let ((.cse6 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< c_~F~0.offset (+ c_~A~0.offset (* .cse6 4) 1)) (< c_~N~0 (+ ~a~0 1)) (< c_thread1Thread1of1ForFork0_~i~0 (+ .cse6 1)))))) (or (forall ((~a~0 Int)) (let ((.cse8 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< .cse7 (+ c_~A~0.offset (* .cse8 4) 1)) (< (+ .cse8 c_~M~0) .cse4) (< c_~N~0 (+ ~a~0 1))))) .cse5) (or .cse5 (forall ((~a~0 Int)) (let ((.cse9 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse9 4) .cse2) .cse3) (< (+ (div (+ (- 1) .cse10 c_~F~0.offset) 4) c_thread1Thread1of1ForFork0_~i~0) .cse9) (< c_~N~0 (+ ~a~0 1)))))) (or (forall ((~a~0 Int)) (let ((.cse11 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ .cse11 c_~M~0) (+ 2 (div (+ .cse10 c_~F~0.offset) 4) c_thread1Thread1of1ForFork0_~i~0)) (< c_~F~0.offset (+ c_~A~0.offset (* .cse11 4) 1)) (< c_~N~0 (+ ~a~0 1))))) .cse5) (or (forall ((~a~0 Int)) (let ((.cse12 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse12 4) .cse2) (+ 5 c_~F~0.offset .cse13)) (< c_~N~0 (+ ~a~0 1)) (< c_thread1Thread1of1ForFork0_~i~0 (+ .cse12 1))))) .cse5)))) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse17 (select (select .cse16 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse14 (store .cse18 .cse17 (store (select .cse18 .cse17) v_arrayElimCell_22 .cse19))) (.cse15 (* ~b~0 4))) (= (select (select .cse14 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse15)) (select (select .cse14 (select (select (store .cse16 .cse17 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse15 v_arrayElimCell_23)))) (< c_~N~0 (+ ~a~0 1)))) (not (= c_~B~0.base .cse17)))))) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse23 (store |c_#memory_int| .cse24 (store .cse25 v_arrayElimCell_21 .cse26))) (.cse21 (* ~b~0 4))) (let ((.cse22 (select (select .cse23 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse21))) (.cse20 (select .cse23 (select (select (store |c_#memory_$Pointer$.base| .cse24 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= (select .cse20 (+ .cse21 v_arrayElimCell_23)) .cse22) (= .cse22 (select .cse20 (+ .cse21 v_arrayElimCell_22))))))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) (or (< c_~N~0 2) .cse5) (or .cse5 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse29 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse28 (select (select .cse29 c_~B~0.base) c_~B~0.offset))) (let ((.cse27 (select (select (store .cse29 .cse28 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse27 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)) (= .cse27 .cse28))))))) (or (forall ((v_ArrVal_601 (Array Int Int))) (not (= c_~B~0.base (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset)))) .cse5 .cse30) (or .cse5 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse33 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse32 (select (select .cse33 c_~B~0.base) c_~B~0.offset))) (let ((.cse31 (select (select (store .cse33 .cse32 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= c_~F~0.base .cse31) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse31 .cse32))))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (let ((.cse35 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse34 (select (select .cse35 c_~B~0.base) c_~B~0.offset))) (= .cse34 (select (select (store .cse35 .cse34 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))))) .cse5) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse39 (store |c_#memory_int| .cse40 (store .cse41 v_arrayElimCell_21 .cse42))) (.cse37 (* ~b~0 4))) (let ((.cse38 (select (select .cse39 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse37))) (.cse36 (select .cse39 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= (select .cse36 (+ .cse37 v_arrayElimCell_23)) .cse38) (= .cse38 (select .cse36 (+ .cse37 v_arrayElimCell_22))))))) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) (< c_~M~0 (+ ~b~0 1)))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse43 (store |c_#memory_int| .cse24 (store .cse25 v_arrayElimCell_21 .cse26))) (.cse44 (* ~b~0 4))) (= (select (select .cse43 (select (select (store |c_#memory_$Pointer$.base| .cse24 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse44 v_arrayElimCell_23)) (select (select .cse43 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse44)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))) .cse45) (or .cse30 (< c_~M~0 2)) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse46 (store |c_#memory_int| .cse40 (store .cse41 v_arrayElimCell_21 .cse42))) (.cse47 (* ~b~0 4))) (= (select (select .cse46 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse47 v_arrayElimCell_23)) (select (select .cse46 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse47)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse48) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (let ((.cse49 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse50 (select (select .cse49 c_~B~0.base) c_~B~0.offset))) (= (select (select (store .cse49 .cse50 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse50))))) .cse5) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (let ((.cse52 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse51 (select (select .cse52 c_~B~0.base) c_~B~0.offset))) (= .cse51 (select (select (store .cse52 .cse51 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))))) .cse5) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)) (let ((.cse53 (store |c_#memory_int| .cse40 (store .cse41 v_arrayElimCell_22 .cse42))) (.cse54 (* ~b~0 4))) (= (select (select .cse53 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse54 v_arrayElimCell_22)) (select (select .cse53 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse54)))))) .cse55) (or .cse48 (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse56 (store |c_#memory_int| .cse40 (store .cse41 v_arrayElimCell_22 .cse42))) (.cse57 (* ~b~0 4))) (= (select (select .cse56 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse57 v_arrayElimCell_23)) (select (select .cse56 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse57)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse60 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse59 (select (select .cse60 c_~B~0.base) c_~B~0.offset))) (let ((.cse58 (select (select (store .cse60 .cse59 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= c_~A~0.base .cse58) (< c_~N~0 (+ ~a~0 1)) (= .cse59 .cse58)))))) .cse5) (forall ((v_ArrVal_601 (Array Int Int)) (~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse65 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse66 (select (select .cse65 c_~B~0.base) c_~B~0.offset))) (let ((.cse64 (store .cse18 .cse66 (store (select .cse18 .cse66) v_arrayElimCell_21 .cse19))) (.cse63 (* ~b~0 4))) (let ((.cse61 (select (select .cse64 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse63))) (.cse62 (select .cse64 (select (select (store .cse65 .cse66 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse61 (select .cse62 (+ .cse63 v_arrayElimCell_22))) (= .cse61 (select .cse62 (+ .cse63 v_arrayElimCell_23))))))))) (< ~a~0 0) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) (or (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (not (= c_~B~0.base (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset)))) .cse5 .cse30) (forall ((v_ArrVal_601 (Array Int Int)) (~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse71 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse72 (select (select .cse71 c_~B~0.base) c_~B~0.offset))) (let ((.cse70 (store .cse18 .cse72 (store (select .cse18 .cse72) v_arrayElimCell_22 .cse19))) (.cse69 (* ~b~0 4))) (let ((.cse67 (select (select .cse70 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse69))) (.cse68 (select .cse70 (select (select (store .cse71 .cse72 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse67 (select .cse68 (+ .cse69 v_arrayElimCell_22))) (= .cse67 (select .cse68 (+ .cse69 v_arrayElimCell_23))))))))) (< c_~N~0 (+ ~a~0 1)))))) (or .cse5 .cse73 (and (or .cse30 (= c_~F~0.base c_~A~0.base)) (or .cse74 (forall ((~a~0 Int)) (or (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1))))))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)) (let ((.cse75 (store |c_#memory_int| .cse40 (store .cse41 v_arrayElimCell_21 .cse42))) (.cse76 (* ~b~0 4))) (= (select (select .cse75 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse76)) (select (select .cse75 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse76 v_arrayElimCell_22)))) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse55) (forall ((~a~0 Int) (~b~0 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse78 (* ~b~0 4))) (= (select .cse77 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse78)) (let ((.cse80 (+ (* ~a~0 4) c_~B~0.offset))) (select (select |c_#memory_int| (select .cse79 .cse80)) (+ (select (select |c_#memory_$Pointer$.offset| c_~B~0.base) .cse80) .cse78))))) (< c_~N~0 (+ ~a~0 1)))) (or (and (or .cse74 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse82 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse81 (select (select .cse82 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~A~0.base .cse81)) (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (= (select (select (store .cse82 .cse81 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base) (< c_~N~0 (+ ~a~0 1))))))) (or .cse74 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse85 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse84 (select (select .cse85 c_~B~0.base) c_~B~0.offset))) (let ((.cse83 (select (select (store .cse85 .cse84 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (not (= .cse83 .cse84)) (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (= .cse83 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)))))))) (or .cse74 (forall ((~a~0 Int)) (let ((.cse86 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4)))) (or (< ~a~0 0) (= .cse86 .cse7) (= c_~F~0.offset .cse86) (< c_~N~0 (+ ~a~0 1)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_603 (Array Int Int))) (let ((.cse88 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse87 (select (select .cse88 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~A~0.base .cse87)) (= (select (select (store .cse88 .cse87 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base))))))))) (or .cse74 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (or (not (let ((.cse89 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse90 (select (select .cse89 c_~B~0.base) c_~B~0.offset))) (= (select (select (store .cse89 .cse90 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse90)))) (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1)))))) .cse5 .cse73) (forall ((~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse93 (* ~b~0 4)) (.cse94 (store |c_#memory_int| .cse40 (store .cse41 (+ .cse95 v_arrayElimCell_21) .cse96)))) (let ((.cse92 (select .cse94 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse91 (select (select .cse94 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse93)))) (or (= .cse91 (select .cse92 (+ .cse93 v_arrayElimCell_23))) (= (select .cse92 (+ .cse93 v_arrayElimCell_22)) .cse91))))) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))))) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse100 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse97 (select (select .cse100 c_~B~0.base) c_~B~0.offset))) (or (= c_~B~0.base .cse97) (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse98 (store .cse18 .cse97 (store (select .cse18 .cse97) v_arrayElimCell_21 .cse19))) (.cse99 (* ~b~0 4))) (= (select (select .cse98 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse99)) (select (select .cse98 (select (select (store .cse100 .cse97 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse99 v_arrayElimCell_22)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))))))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse101 (store |c_#memory_int| .cse24 (store .cse25 v_arrayElimCell_22 .cse26))) (.cse102 (* ~b~0 4))) (= (select (select .cse101 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse102)) (select (select .cse101 (select (select (store |c_#memory_$Pointer$.base| .cse24 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse102 v_arrayElimCell_22)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) .cse103) (forall ((~a~0 Int) (v_ArrVal_603 (Array Int Int)) (~b~0 Int) (v_ArrVal_604 (Array Int Int))) (or (< ~b~0 0) (let ((.cse104 (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base| (store .cse107 .cse108 .cse96))) (.cse106 (* ~b~0 4))) (= (let ((.cse105 (+ (* ~a~0 4) c_~B~0.offset))) (select (select .cse104 (select (select (store |c_#memory_$Pointer$.base| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_603) c_~B~0.base) .cse105)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_604) c_~B~0.base) .cse105) .cse106))) (select (select .cse104 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse106)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse112 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse109 (select (select .cse112 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~B~0.base .cse109)) (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse110 (store .cse18 .cse109 (store (select .cse18 .cse109) v_arrayElimCell_21 .cse19))) (.cse111 (* ~b~0 4))) (= (select (select .cse110 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse111)) (select (select .cse110 (select (select (store .cse112 .cse109 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse111 v_arrayElimCell_23)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse115 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse114 (select (select .cse115 c_~B~0.base) c_~B~0.offset))) (let ((.cse113 (select (select (store .cse115 .cse114 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= c_~F~0.base .cse113) (< c_~N~0 (+ ~a~0 1)) (= .cse114 .cse113)))))) .cse5) (forall ((~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse119 (store |c_#memory_int| .cse40 (store .cse41 (+ .cse95 v_arrayElimCell_22) .cse96))) (.cse118 (* ~b~0 4))) (let ((.cse116 (select (select .cse119 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse118))) (.cse117 (select .cse119 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse116 (select .cse117 (+ .cse118 v_arrayElimCell_23))) (= .cse116 (select .cse117 (+ .cse118 v_arrayElimCell_22))))))))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (let ((.cse120 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse121 (select (select .cse120 c_~B~0.base) c_~B~0.offset))) (or (= c_~A~0.base (select (select (store .cse120 .cse121 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (< ~a~0 0) (not (= .cse121 c_~A~0.base)) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1)))))) .cse5) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (let ((.cse122 (store |c_#memory_int| .cse40 (store .cse41 (+ .cse95 v_arrayElimCell_22) .cse96))) (.cse123 (* ~b~0 4))) (= (select (select .cse122 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse123)) (select (select .cse122 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse123 v_arrayElimCell_23)))) (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) .cse48) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse124 (store |c_#memory_int| .cse40 (store .cse41 (+ .cse95 v_arrayElimCell_21) .cse96))) (.cse125 (* ~b~0 4))) (= (select (select .cse124 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse125 v_arrayElimCell_22)) (select (select .cse124 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse125)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse55) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse126 (store |c_#memory_int| .cse40 (store .cse41 (+ .cse95 v_arrayElimCell_21) .cse96))) (.cse127 (* ~b~0 4))) (= (select (select .cse126 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse127)) (select (select .cse126 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse127 v_arrayElimCell_23)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse48) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse130 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse131 (select (select .cse130 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse128 (store .cse18 .cse131 (store (select .cse18 .cse131) v_arrayElimCell_22 .cse19))) (.cse129 (* ~b~0 4))) (= (select (select .cse128 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse129)) (select (select .cse128 (select (select (store .cse130 .cse131 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse129 v_arrayElimCell_22)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) (= c_~B~0.base .cse131))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (let ((.cse134 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse133 (select (select .cse134 c_~B~0.base) c_~B~0.offset))) (let ((.cse132 (select (select (store .cse134 .cse133 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= c_~A~0.base .cse132) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse133 .cse132)))))) .cse5) (forall ((~a~0 Int) (v_ArrVal_603 (Array Int Int)) (~b~0 Int) (v_ArrVal_604 (Array Int Int))) (or (< ~b~0 0) (let ((.cse135 (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base| (store .cse107 .cse108 |c_thread2Thread1of1ForFork1_#t~mem6|))) (.cse136 (* ~b~0 4))) (= (select (select .cse135 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse136)) (let ((.cse137 (+ (* ~a~0 4) c_~B~0.offset))) (select (select .cse135 (select (select (store |c_#memory_$Pointer$.base| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_603) c_~B~0.base) .cse137)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_604) c_~B~0.base) .cse137) .cse136))))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)) (let ((.cse138 (store |c_#memory_int| .cse40 (store .cse41 (+ .cse95 v_arrayElimCell_22) .cse96))) (.cse139 (* ~b~0 4))) (= (select (select .cse138 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse139)) (select (select .cse138 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse139 v_arrayElimCell_22)))))) .cse55) (or .cse103 (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse140 (store |c_#memory_int| .cse24 (store .cse25 v_arrayElimCell_21 .cse26))) (.cse141 (* ~b~0 4))) (= (select (select .cse140 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse141)) (select (select .cse140 (select (select (store |c_#memory_$Pointer$.base| .cse24 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse141 v_arrayElimCell_22)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1))))) (or (forall ((~a~0 Int)) (let ((.cse142 (* ~a~0 c_~M~0))) (let ((.cse143 (+ c_~A~0.offset (* .cse142 4)))) (or (= .cse142 c_thread1Thread1of1ForFork0_~i~0) (< ~a~0 0) (= .cse143 .cse7) (= c_~F~0.offset .cse143) (< c_~N~0 (+ ~a~0 1)))))) .cse5) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse145 (* ~b~0 4)) (.cse147 (store |c_#memory_int| .cse40 (store .cse41 v_arrayElimCell_22 .cse42)))) (let ((.cse144 (select .cse147 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse146 (select (select .cse147 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse145)))) (or (= (select .cse144 (+ .cse145 v_arrayElimCell_23)) .cse146) (= (select .cse144 (+ .cse145 v_arrayElimCell_22)) .cse146))))) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse148 (store |c_#memory_int| .cse24 (store .cse25 v_arrayElimCell_22 .cse26))) (.cse149 (* ~b~0 4))) (= (select (select .cse148 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse149)) (select (select .cse148 (select (select (store |c_#memory_$Pointer$.base| .cse24 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse149 v_arrayElimCell_23)))) (< c_~N~0 (+ ~a~0 1)))) .cse45) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse152 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse151 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (.cse150 (select (select .cse152 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~A~0.base .cse150)) (< ~a~0 0) (= .cse151 .cse7) (= c_~F~0.offset .cse151) (= (select (select (store .cse152 .cse150 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base) (< c_~N~0 (+ ~a~0 1)))))) .cse5) (or .cse5 .cse30 (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset) c_~B~0.base)))) (or .cse5 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (let ((.cse155 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse154 (select (select .cse155 c_~B~0.base) c_~B~0.offset))) (let ((.cse153 (select (select (store .cse155 .cse154 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= c_~F~0.base .cse153) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse154 .cse153))))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse156 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse157 (select (select .cse156 c_~B~0.base) c_~B~0.offset))) (or (< ~a~0 0) (= c_~A~0.base (select (select (store .cse156 .cse157 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (not (= c_~A~0.base .cse157)) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1)))))) .cse5) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse161 (store |c_#memory_int| .cse24 (store .cse25 v_arrayElimCell_22 .cse26))) (.cse160 (* ~b~0 4))) (let ((.cse158 (select (select .cse161 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse160))) (.cse159 (select .cse161 (select (select (store |c_#memory_$Pointer$.base| .cse24 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse158 (select .cse159 (+ .cse160 v_arrayElimCell_22))) (= .cse158 (select .cse159 (+ .cse160 v_arrayElimCell_23))))))) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) (or .cse74 .cse0 .cse73 (and (or (forall ((~a~0 Int)) (or (< ~a~0 0) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse2) .cse3) (< c_~N~0 (+ ~a~0 1)))) .cse5) (or (forall ((~a~0 Int)) (or (< ~a~0 0) (< c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< c_~N~0 (+ ~a~0 1)))) .cse5)))))))) is different from true [2024-01-26 08:29:50,236 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse13 (* c_thread1Thread1of1ForFork0_~i~0 4)) (.cse101 (select |c_#memory_$Pointer$.base| c_~B~0.base))) (let ((.cse51 (select .cse101 (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset))) (.cse99 (select |c_#memory_int| c_~A~0.base)) (.cse204 (+ c_~A~0.offset .cse13)) (.cse29 (select .cse101 c_~B~0.offset)) (.cse39 (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~B~0.base))) (.cse41 (not (= c_~B~0.base c_~A~0.base))) (.cse40 (not (= c_~B~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|))) (.cse123 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))))) (let ((.cse46 (and (or .cse39 .cse123) (or .cse123 .cse41) (not (= (select |c_#valid| c_~B~0.base) 0)) (or .cse40 .cse123))) (.cse129 (= c_~B~0.base .cse29)) (.cse42 (< |c_ULTIMATE.start_main_~i~2#1| 0)) (.cse59 (< c_~M~0 2)) (.cse205 (select |c_#memory_int| c_~F~0.base)) (.cse206 (* (* c_thread2Thread1of1ForFork1_~i~1 c_~M~0) 4)) (.cse117 (* c_thread2Thread1of1ForFork1_~j~0 4)) (.cse23 (store |c_#memory_int| c_~A~0.base (store .cse99 .cse204 |c_thread1Thread1of1ForFork0_#t~mem2|))) (.cse71 (= .cse51 c_~B~0.base)) (.cse5 (< c_~M~0 1)) (.cse124 (< |c_ULTIMATE.start_main_~i~2#1| 1))) (let ((.cse45 (or .cse5 .cse124)) (.cse62 (not .cse71)) (.cse24 (select (select .cse23 c_~F~0.base) c_~F~0.offset)) (.cse133 (select |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base|)) (.cse134 (+ .cse117 |c_thread2Thread1of1ForFork1_#t~mem5.offset|)) (.cse159 (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (.cse118 (select .cse205 (+ .cse117 .cse206 c_~F~0.offset))) (.cse74 (+ |c_#StackHeapBarrier| 1)) (.cse85 (< |c_ULTIMATE.start_main_#t~post12#1| 0)) (.cse84 (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (not (= c_~B~0.base (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset))))) (.cse52 (select |c_#memory_int| .cse51)) (.cse53 (select .cse205 (+ .cse206 c_~F~0.offset))) (.cse126 (or .cse42 .cse59)) (.cse58 (not .cse129)) (.cse125 (not (= |c_ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (.cse161 (and (or .cse123 .cse42 .cse59) (or .cse46 .cse5 .cse42) (or .cse123 .cse5 .cse124))) (.cse7 (+ c_~F~0.offset .cse13)) (.cse35 (< c_~N~0 1)) (.cse16 (or (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t2~0#1.base| 1)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0)))) (.cse17 (or (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t1~0#1.base|) 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_main_~#t1~0#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t1~0#1.base| 1)))) (.cse30 (select |c_#memory_int| .cse29)) (.cse31 (select .cse205 c_~F~0.offset)) (.cse96 (= .cse204 c_~F~0.offset)) (.cse0 (forall ((v_ArrVal_601 (Array Int Int))) (= c_~B~0.base (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset)))) (.cse95 (= c_thread1Thread1of1ForFork0_~i~0 0)) (.cse2 (* 4 c_~M~0)) (.cse3 (+ 5 c_~F~0.offset)) (.cse158 (<= (+ c_~M~0 1) 0)) (.cse146 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (.cse160 (<= 0 c_~M~0)) (.cse18 (not (= c_~M~0 1)))) (and (or .cse0 (let ((.cse4 (+ 2 c_thread1Thread1of1ForFork0_~i~0)) (.cse10 (* c_~A~0.offset (- 1)))) (and (or (forall ((~a~0 Int)) (let ((.cse1 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse1 4) .cse2) .cse3) (< (+ .cse1 c_~M~0) .cse4) (< c_~N~0 (+ ~a~0 1))))) .cse5) (or .cse5 (forall ((~a~0 Int)) (let ((.cse6 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< c_~F~0.offset (+ c_~A~0.offset (* .cse6 4) 1)) (< c_~N~0 (+ ~a~0 1)) (< c_thread1Thread1of1ForFork0_~i~0 (+ .cse6 1)))))) (or (forall ((~a~0 Int)) (let ((.cse8 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< .cse7 (+ c_~A~0.offset (* .cse8 4) 1)) (< (+ .cse8 c_~M~0) .cse4) (< c_~N~0 (+ ~a~0 1))))) .cse5) (or .cse5 (forall ((~a~0 Int)) (let ((.cse9 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse9 4) .cse2) .cse3) (< (+ (div (+ (- 1) .cse10 c_~F~0.offset) 4) c_thread1Thread1of1ForFork0_~i~0) .cse9) (< c_~N~0 (+ ~a~0 1)))))) (or (forall ((~a~0 Int)) (let ((.cse11 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ .cse11 c_~M~0) (+ 2 (div (+ .cse10 c_~F~0.offset) 4) c_thread1Thread1of1ForFork0_~i~0)) (< c_~F~0.offset (+ c_~A~0.offset (* .cse11 4) 1)) (< c_~N~0 (+ ~a~0 1))))) .cse5) (or (forall ((~a~0 Int)) (let ((.cse12 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse12 4) .cse2) (+ 5 c_~F~0.offset .cse13)) (< c_~N~0 (+ ~a~0 1)) (< c_thread1Thread1of1ForFork0_~i~0 (+ .cse12 1))))) .cse5)))) (or .cse5 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~i~2#1| ~a~0) (< ~a~0 0) (let ((.cse15 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse14 (select (select .cse15 c_~B~0.base) c_~B~0.offset))) (= .cse14 (select (select (store .cse15 .cse14 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))))))) (or (and .cse16 .cse17 (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| c_~A~0.base 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (< |c_#StackHeapBarrier| (+ c_~A~0.base 1)) (not (= (select |c_#valid| c_~A~0.base) 0)))) .cse18) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse22 (select (select .cse21 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse19 (store .cse23 .cse22 (store (select .cse23 .cse22) v_arrayElimCell_22 .cse24))) (.cse20 (* ~b~0 4))) (= (select (select .cse19 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse20)) (select (select .cse19 (select (select (store .cse21 .cse22 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse20 v_arrayElimCell_23)))) (< c_~N~0 (+ ~a~0 1)))) (not (= c_~B~0.base .cse22)))))) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse28 (store |c_#memory_int| .cse29 (store .cse30 v_arrayElimCell_21 .cse31))) (.cse26 (* ~b~0 4))) (let ((.cse27 (select (select .cse28 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse26))) (.cse25 (select .cse28 (select (select (store |c_#memory_$Pointer$.base| .cse29 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= (select .cse25 (+ .cse26 v_arrayElimCell_23)) .cse27) (= .cse27 (select .cse25 (+ .cse26 v_arrayElimCell_22))))))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) (or (< c_~N~0 2) .cse5) (or .cse5 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse34 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse33 (select (select .cse34 c_~B~0.base) c_~B~0.offset))) (let ((.cse32 (select (select (store .cse34 .cse33 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse32 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)) (= .cse32 .cse33))))))) (or (forall ((v_ArrVal_601 (Array Int Int))) (not (= c_~B~0.base (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset)))) .cse5 .cse35) (or .cse5 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse38 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse37 (select (select .cse38 c_~B~0.base) c_~B~0.offset))) (let ((.cse36 (select (select (store .cse38 .cse37 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= c_~F~0.base .cse36) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse36 .cse37))))))) (or (and .cse39 (not (= |c_ULTIMATE.start_main_#t~ret13#1.base| c_~B~0.base)) .cse40 .cse41) .cse5 .cse42) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (let ((.cse44 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse43 (select (select .cse44 c_~B~0.base) c_~B~0.offset))) (= .cse43 (select (select (store .cse44 .cse43 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))))) .cse5) (or (and .cse16 .cse17 (or (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_#t~ret9#1.base| 1)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_main_#t~ret9#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (not (= 0 (select |c_#valid| |c_ULTIMATE.start_main_#t~ret9#1.base|))))) .cse18) .cse45 (or .cse46 .cse18) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse50 (store |c_#memory_int| .cse51 (store .cse52 v_arrayElimCell_21 .cse53))) (.cse48 (* ~b~0 4))) (let ((.cse49 (select (select .cse50 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse48))) (.cse47 (select .cse50 (select (select (store |c_#memory_$Pointer$.base| .cse51 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= (select .cse47 (+ .cse48 v_arrayElimCell_23)) .cse49) (= .cse49 (select .cse47 (+ .cse48 v_arrayElimCell_22))))))) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) (< c_~M~0 (+ ~b~0 1)))) (or .cse5 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse54 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse55 (select (select .cse54 c_~B~0.base) c_~B~0.offset))) (or (< |c_ULTIMATE.start_main_~i~2#1| ~a~0) (< ~a~0 0) (= c_~A~0.base (select (select (store .cse54 .cse55 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (not (= c_~A~0.base .cse55)) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4)))))))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse56 (store |c_#memory_int| .cse29 (store .cse30 v_arrayElimCell_21 .cse31))) (.cse57 (* ~b~0 4))) (= (select (select .cse56 (select (select (store |c_#memory_$Pointer$.base| .cse29 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse57 v_arrayElimCell_23)) (select (select .cse56 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse57)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))) .cse58) (or .cse35 .cse59) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse60 (store |c_#memory_int| .cse51 (store .cse52 v_arrayElimCell_21 .cse53))) (.cse61 (* ~b~0 4))) (= (select (select .cse60 (select (select (store |c_#memory_$Pointer$.base| .cse51 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse61 v_arrayElimCell_23)) (select (select .cse60 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse61)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse62) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (let ((.cse63 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse64 (select (select .cse63 c_~B~0.base) c_~B~0.offset))) (= (select (select (store .cse63 .cse64 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse64))))) .cse5) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse65 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse66 (select (select .cse65 c_~B~0.base) c_~B~0.offset))) (or (< ~a~0 0) (= c_~A~0.base (select (select (store .cse65 .cse66 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (not (= c_~A~0.base .cse66)) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< |c_ULTIMATE.start_main_#t~post12#1| ~a~0))))) .cse5) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (let ((.cse68 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse67 (select (select .cse68 c_~B~0.base) c_~B~0.offset))) (= .cse67 (select (select (store .cse68 .cse67 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))))) .cse5) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)) (let ((.cse69 (store |c_#memory_int| .cse51 (store .cse52 v_arrayElimCell_22 .cse53))) (.cse70 (* ~b~0 4))) (= (select (select .cse69 (select (select (store |c_#memory_$Pointer$.base| .cse51 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse70 v_arrayElimCell_22)) (select (select .cse69 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse70)))))) .cse71) (or .cse62 (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse72 (store |c_#memory_int| .cse51 (store .cse52 v_arrayElimCell_22 .cse53))) (.cse73 (* ~b~0 4))) (= (select (select .cse72 (select (select (store |c_#memory_$Pointer$.base| .cse51 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse73 v_arrayElimCell_23)) (select (select .cse72 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse73)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1))))) (<= .cse74 |c_ULTIMATE.start_main_~#t1~0#1.base|) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse77 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse76 (select (select .cse77 c_~B~0.base) c_~B~0.offset))) (let ((.cse75 (select (select (store .cse77 .cse76 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= c_~A~0.base .cse75) (< c_~N~0 (+ ~a~0 1)) (= .cse76 .cse75)))))) .cse5) (forall ((v_ArrVal_601 (Array Int Int)) (~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse82 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse83 (select (select .cse82 c_~B~0.base) c_~B~0.offset))) (let ((.cse81 (store .cse23 .cse83 (store (select .cse23 .cse83) v_arrayElimCell_21 .cse24))) (.cse80 (* ~b~0 4))) (let ((.cse78 (select (select .cse81 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse80))) (.cse79 (select .cse81 (select (select (store .cse82 .cse83 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse78 (select .cse79 (+ .cse80 v_arrayElimCell_22))) (= .cse78 (select .cse79 (+ .cse80 v_arrayElimCell_23))))))))) (< ~a~0 0) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) (or .cse84 .cse5 .cse35) (or .cse85 .cse59) (or .cse5 (and .cse39 (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse40 .cse41) .cse42) (forall ((v_ArrVal_601 (Array Int Int)) (~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse90 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse91 (select (select .cse90 c_~B~0.base) c_~B~0.offset))) (let ((.cse89 (store .cse23 .cse91 (store (select .cse23 .cse91) v_arrayElimCell_22 .cse24))) (.cse88 (* ~b~0 4))) (let ((.cse86 (select (select .cse89 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse88))) (.cse87 (select .cse89 (select (select (store .cse90 .cse91 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse86 (select .cse87 (+ .cse88 v_arrayElimCell_22))) (= .cse86 (select .cse87 (+ .cse88 v_arrayElimCell_23))))))))) (< c_~N~0 (+ ~a~0 1)))))) (or .cse5 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse94 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse93 (select (select .cse94 c_~B~0.base) c_~B~0.offset))) (let ((.cse92 (select (select (store .cse94 .cse93 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< |c_ULTIMATE.start_main_~i~2#1| ~a~0) (< ~a~0 0) (= c_~A~0.base .cse92) (= .cse93 .cse92))))))) (or .cse5 .cse95 (and (or .cse35 (= c_~F~0.base c_~A~0.base)) (or .cse96 (forall ((~a~0 Int)) (or (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1))))))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)) (let ((.cse97 (store |c_#memory_int| .cse51 (store .cse52 v_arrayElimCell_21 .cse53))) (.cse98 (* ~b~0 4))) (= (select (select .cse97 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse98)) (select (select .cse97 (select (select (store |c_#memory_$Pointer$.base| .cse51 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse98 v_arrayElimCell_22)))) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse71) (forall ((~a~0 Int) (~b~0 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse100 (* ~b~0 4))) (= (select .cse99 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse100)) (let ((.cse102 (+ (* ~a~0 4) c_~B~0.offset))) (select (select |c_#memory_int| (select .cse101 .cse102)) (+ (select (select |c_#memory_$Pointer$.offset| c_~B~0.base) .cse102) .cse100))))) (< c_~N~0 (+ ~a~0 1)))) (or (and (or .cse96 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse104 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse103 (select (select .cse104 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~A~0.base .cse103)) (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (= (select (select (store .cse104 .cse103 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base) (< c_~N~0 (+ ~a~0 1))))))) (or .cse96 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse107 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse106 (select (select .cse107 c_~B~0.base) c_~B~0.offset))) (let ((.cse105 (select (select (store .cse107 .cse106 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (not (= .cse105 .cse106)) (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (= .cse105 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)))))))) (or .cse96 (forall ((~a~0 Int)) (let ((.cse108 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4)))) (or (< ~a~0 0) (= .cse108 .cse7) (= c_~F~0.offset .cse108) (< c_~N~0 (+ ~a~0 1)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_603 (Array Int Int))) (let ((.cse110 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse109 (select (select .cse110 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~A~0.base .cse109)) (= (select (select (store .cse110 .cse109 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base))))))))) (or .cse96 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (or (not (let ((.cse111 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse112 (select (select .cse111 c_~B~0.base) c_~B~0.offset))) (= (select (select (store .cse111 .cse112 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse112)))) (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1)))))) .cse5 .cse95) (forall ((~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse115 (* ~b~0 4)) (.cse116 (store |c_#memory_int| .cse51 (store .cse52 (+ .cse117 v_arrayElimCell_21) .cse118)))) (let ((.cse114 (select .cse116 (select (select (store |c_#memory_$Pointer$.base| .cse51 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse113 (select (select .cse116 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse115)))) (or (= .cse113 (select .cse114 (+ .cse115 v_arrayElimCell_23))) (= (select .cse114 (+ .cse115 v_arrayElimCell_22)) .cse113))))) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))))) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse122 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse119 (select (select .cse122 c_~B~0.base) c_~B~0.offset))) (or (= c_~B~0.base .cse119) (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse120 (store .cse23 .cse119 (store (select .cse23 .cse119) v_arrayElimCell_21 .cse24))) (.cse121 (* ~b~0 4))) (= (select (select .cse120 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse121)) (select (select .cse120 (select (select (store .cse122 .cse119 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse121 v_arrayElimCell_22)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))))))) (or (and (or .cse123 .cse124) (or .cse46 .cse42)) .cse18) (or .cse125 (and .cse45 .cse126 (or .cse5 .cse42 (and .cse39 (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base|)) .cse40 .cse41)))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse127 (store |c_#memory_int| .cse29 (store .cse30 v_arrayElimCell_22 .cse31))) (.cse128 (* ~b~0 4))) (= (select (select .cse127 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse128)) (select (select .cse127 (select (select (store |c_#memory_$Pointer$.base| .cse29 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse128 v_arrayElimCell_22)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) .cse129) (forall ((~a~0 Int) (v_ArrVal_603 (Array Int Int)) (~b~0 Int) (v_ArrVal_604 (Array Int Int))) (or (< ~b~0 0) (let ((.cse130 (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base| (store .cse133 .cse134 .cse118))) (.cse132 (* ~b~0 4))) (= (let ((.cse131 (+ (* ~a~0 4) c_~B~0.offset))) (select (select .cse130 (select (select (store |c_#memory_$Pointer$.base| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_603) c_~B~0.base) .cse131)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_604) c_~B~0.base) .cse131) .cse132))) (select (select .cse130 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse132)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse138 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse135 (select (select .cse138 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~B~0.base .cse135)) (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse136 (store .cse23 .cse135 (store (select .cse23 .cse135) v_arrayElimCell_21 .cse24))) (.cse137 (* ~b~0 4))) (= (select (select .cse136 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse137)) (select (select .cse136 (select (select (store .cse138 .cse135 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse137 v_arrayElimCell_23)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse141 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse140 (select (select .cse141 c_~B~0.base) c_~B~0.offset))) (let ((.cse139 (select (select (store .cse141 .cse140 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= c_~F~0.base .cse139) (< c_~N~0 (+ ~a~0 1)) (= .cse140 .cse139)))))) .cse5) (or (< |c_ULTIMATE.start_main_#t~post12#1| 1) .cse5) (forall ((~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse145 (store |c_#memory_int| .cse51 (store .cse52 (+ .cse117 v_arrayElimCell_22) .cse118))) (.cse144 (* ~b~0 4))) (let ((.cse142 (select (select .cse145 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse144))) (.cse143 (select .cse145 (select (select (store |c_#memory_$Pointer$.base| .cse51 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse142 (select .cse143 (+ .cse144 v_arrayElimCell_23))) (= .cse142 (select .cse143 (+ .cse144 v_arrayElimCell_22))))))))))) (or (and .cse16 .cse17 (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1)) (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)))) .cse18) .cse146 (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (let ((.cse147 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse148 (select (select .cse147 c_~B~0.base) c_~B~0.offset))) (or (= c_~A~0.base (select (select (store .cse147 .cse148 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (< ~a~0 0) (not (= .cse148 c_~A~0.base)) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1)))))) .cse5) (or .cse5 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse151 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse150 (select (select .cse151 c_~B~0.base) c_~B~0.offset))) (let ((.cse149 (select (select (store .cse151 .cse150 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= c_~A~0.base .cse149) (< |c_ULTIMATE.start_main_#t~post12#1| ~a~0) (= .cse150 .cse149))))))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (let ((.cse152 (store |c_#memory_int| .cse51 (store .cse52 (+ .cse117 v_arrayElimCell_22) .cse118))) (.cse153 (* ~b~0 4))) (= (select (select .cse152 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse153)) (select (select .cse152 (select (select (store |c_#memory_$Pointer$.base| .cse51 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse153 v_arrayElimCell_23)))) (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) .cse62) (or (and .cse39 .cse40 (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse41) .cse5 .cse42) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse154 (store |c_#memory_int| .cse51 (store .cse52 (+ .cse117 v_arrayElimCell_21) .cse118))) (.cse155 (* ~b~0 4))) (= (select (select .cse154 (select (select (store |c_#memory_$Pointer$.base| .cse51 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse155 v_arrayElimCell_22)) (select (select .cse154 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse155)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse71) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse156 (store |c_#memory_int| .cse51 (store .cse52 (+ .cse117 v_arrayElimCell_21) .cse118))) (.cse157 (* ~b~0 4))) (= (select (select .cse156 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse157)) (select (select .cse156 (select (select (store |c_#memory_$Pointer$.base| .cse51 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse157 v_arrayElimCell_23)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse62) (or (and .cse158 .cse159) (and (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) .cse160)) (or (not (= |c_ULTIMATE.start_create_fresh_int_array_#in~size#1| 1)) .cse161) (or .cse84 .cse5 .cse42) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse164 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse165 (select (select .cse164 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse162 (store .cse23 .cse165 (store (select .cse23 .cse165) v_arrayElimCell_22 .cse24))) (.cse163 (* ~b~0 4))) (= (select (select .cse162 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse163)) (select (select .cse162 (select (select (store .cse164 .cse165 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse163 v_arrayElimCell_22)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) (= c_~B~0.base .cse165))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (let ((.cse168 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse167 (select (select .cse168 c_~B~0.base) c_~B~0.offset))) (let ((.cse166 (select (select (store .cse168 .cse167 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= c_~A~0.base .cse166) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse167 .cse166)))))) .cse5) (forall ((~a~0 Int) (v_ArrVal_603 (Array Int Int)) (~b~0 Int) (v_ArrVal_604 (Array Int Int))) (or (< ~b~0 0) (let ((.cse169 (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base| (store .cse133 .cse134 |c_thread2Thread1of1ForFork1_#t~mem6|))) (.cse170 (* ~b~0 4))) (= (select (select .cse169 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse170)) (let ((.cse171 (+ (* ~a~0 4) c_~B~0.offset))) (select (select .cse169 (select (select (store |c_#memory_$Pointer$.base| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_603) c_~B~0.base) .cse171)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_604) c_~B~0.base) .cse171) .cse170))))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) .cse159 (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)) (let ((.cse172 (store |c_#memory_int| .cse51 (store .cse52 (+ .cse117 v_arrayElimCell_22) .cse118))) (.cse173 (* ~b~0 4))) (= (select (select .cse172 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse173)) (select (select .cse172 (select (select (store |c_#memory_$Pointer$.base| .cse51 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse173 v_arrayElimCell_22)))))) .cse71) (<= .cse74 |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (and .cse16 .cse17 (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1)) (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0)))) .cse18) (or .cse129 (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse174 (store |c_#memory_int| .cse29 (store .cse30 v_arrayElimCell_21 .cse31))) (.cse175 (* ~b~0 4))) (= (select (select .cse174 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse175)) (select (select .cse174 (select (select (store |c_#memory_$Pointer$.base| .cse29 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse175 v_arrayElimCell_22)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1))))) (or .cse85 .cse84 .cse5) (or (forall ((~a~0 Int)) (let ((.cse176 (* ~a~0 c_~M~0))) (let ((.cse177 (+ c_~A~0.offset (* .cse176 4)))) (or (= .cse176 c_thread1Thread1of1ForFork0_~i~0) (< ~a~0 0) (= .cse177 .cse7) (= c_~F~0.offset .cse177) (< c_~N~0 (+ ~a~0 1)))))) .cse5) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse179 (* ~b~0 4)) (.cse181 (store |c_#memory_int| .cse51 (store .cse52 v_arrayElimCell_22 .cse53)))) (let ((.cse178 (select .cse181 (select (select (store |c_#memory_$Pointer$.base| .cse51 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse180 (select (select .cse181 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse179)))) (or (= (select .cse178 (+ .cse179 v_arrayElimCell_23)) .cse180) (= (select .cse178 (+ .cse179 v_arrayElimCell_22)) .cse180))))) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) .cse126 (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (or (< ~a~0 0) (< |c_ULTIMATE.start_main_#t~post12#1| ~a~0) (let ((.cse183 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse182 (select (select .cse183 c_~B~0.base) c_~B~0.offset))) (= .cse182 (select (select (store .cse183 .cse182 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))))) .cse5) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse184 (store |c_#memory_int| .cse29 (store .cse30 v_arrayElimCell_22 .cse31))) (.cse185 (* ~b~0 4))) (= (select (select .cse184 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse185)) (select (select .cse184 (select (select (store |c_#memory_$Pointer$.base| .cse29 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse185 v_arrayElimCell_23)))) (< c_~N~0 (+ ~a~0 1)))) .cse58) (or .cse125 .cse161) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse188 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse187 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (.cse186 (select (select .cse188 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~A~0.base .cse186)) (< ~a~0 0) (= .cse187 .cse7) (= c_~F~0.offset .cse187) (= (select (select (store .cse188 .cse186 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base) (< c_~N~0 (+ ~a~0 1)))))) .cse5) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse191 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse190 (select (select .cse191 c_~B~0.base) c_~B~0.offset))) (let ((.cse189 (select (select (store .cse191 .cse190 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< |c_ULTIMATE.start_main_~i~2#1| ~a~0) (< ~a~0 0) (= c_~F~0.base .cse189) (= .cse190 .cse189)))))) .cse5) (or .cse5 .cse35 (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset) c_~B~0.base)))) (or .cse5 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (let ((.cse194 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse193 (select (select .cse194 c_~B~0.base) c_~B~0.offset))) (let ((.cse192 (select (select (store .cse194 .cse193 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= c_~F~0.base .cse192) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse193 .cse192))))))) (or (and .cse16 (or (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base| 1)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base|) 0))) .cse17) .cse18 (< |c_ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse195 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse196 (select (select .cse195 c_~B~0.base) c_~B~0.offset))) (or (< ~a~0 0) (= c_~A~0.base (select (select (store .cse195 .cse196 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (not (= c_~A~0.base .cse196)) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1)))))) .cse5) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse200 (store |c_#memory_int| .cse29 (store .cse30 v_arrayElimCell_22 .cse31))) (.cse199 (* ~b~0 4))) (let ((.cse197 (select (select .cse200 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse199))) (.cse198 (select .cse200 (select (select (store |c_#memory_$Pointer$.base| .cse29 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse197 (select .cse198 (+ .cse199 v_arrayElimCell_22))) (= .cse197 (select .cse198 (+ .cse199 v_arrayElimCell_23))))))) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) (or .cse5 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse203 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse202 (select (select .cse203 c_~B~0.base) c_~B~0.offset))) (let ((.cse201 (select (select (store .cse203 .cse202 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= c_~F~0.base .cse201) (< |c_ULTIMATE.start_main_#t~post12#1| ~a~0) (= .cse202 .cse201))))))) (or .cse96 .cse0 .cse95 (and (or (forall ((~a~0 Int)) (or (< ~a~0 0) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse2) .cse3) (< c_~N~0 (+ ~a~0 1)))) .cse5) (or (forall ((~a~0 Int)) (or (< ~a~0 0) (< c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< c_~N~0 (+ ~a~0 1)))) .cse5))) (or (and .cse158 .cse146) (and (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse160)) (or (and (or .cse123 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_main_#t~malloc11#1.base|))) (or .cse123 (not (= c_~A~0.base |c_ULTIMATE.start_main_#t~malloc11#1.base|))) (or (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_#t~malloc11#1.base|)) .cse123) (not (= (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc11#1.base|) 0))) .cse18)))))) is different from true [2024-01-26 08:30:04,671 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse14 (* c_thread1Thread1of1ForFork0_~i~0 4)) (.cse82 (select |c_#memory_$Pointer$.base| c_~B~0.base))) (let ((.cse42 (select .cse82 (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset))) (.cse80 (select |c_#memory_int| c_~A~0.base)) (.cse165 (+ c_~A~0.offset .cse14)) (.cse26 (select .cse82 c_~B~0.offset))) (let ((.cse106 (= c_~B~0.base .cse26)) (.cse166 (select |c_#memory_int| c_~F~0.base)) (.cse167 (* (* c_thread2Thread1of1ForFork1_~i~1 c_~M~0) 4)) (.cse98 (* c_thread2Thread1of1ForFork1_~j~0 4)) (.cse20 (store |c_#memory_int| c_~A~0.base (store .cse80 .cse165 |c_thread1Thread1of1ForFork0_#t~mem2|))) (.cse57 (= .cse42 c_~B~0.base))) (let ((.cse15 (+ 2 c_~B~0.base)) (.cse0 (= c_~F~0.base c_~A~0.base)) (.cse50 (not .cse57)) (.cse21 (select (select .cse20 c_~F~0.base) c_~F~0.offset)) (.cse110 (select |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base|)) (.cse111 (+ .cse98 |c_thread2Thread1of1ForFork1_#t~mem5.offset|)) (.cse99 (select .cse166 (+ .cse98 .cse167 c_~F~0.offset))) (.cse60 (+ |c_#StackHeapBarrier| 1)) (.cse43 (select |c_#memory_int| .cse42)) (.cse44 (select .cse166 (+ .cse167 c_~F~0.offset))) (.cse47 (not .cse106)) (.cse8 (+ c_~F~0.offset .cse14)) (.cse32 (< c_~N~0 1)) (.cse27 (select |c_#memory_int| .cse26)) (.cse28 (select .cse166 c_~F~0.offset)) (.cse77 (= .cse165 c_~F~0.offset)) (.cse1 (forall ((v_ArrVal_601 (Array Int Int))) (= c_~B~0.base (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset)))) (.cse76 (= c_thread1Thread1of1ForFork0_~i~0 0)) (.cse3 (* 4 c_~M~0)) (.cse4 (+ 5 c_~F~0.offset)) (.cse6 (< c_~M~0 1))) (and (= c_~F~0.offset 0) (not .cse0) (or .cse1 (let ((.cse5 (+ 2 c_thread1Thread1of1ForFork0_~i~0)) (.cse11 (* c_~A~0.offset (- 1)))) (and (or (forall ((~a~0 Int)) (let ((.cse2 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse2 4) .cse3) .cse4) (< (+ .cse2 c_~M~0) .cse5) (< c_~N~0 (+ ~a~0 1))))) .cse6) (or .cse6 (forall ((~a~0 Int)) (let ((.cse7 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< c_~F~0.offset (+ c_~A~0.offset (* .cse7 4) 1)) (< c_~N~0 (+ ~a~0 1)) (< c_thread1Thread1of1ForFork0_~i~0 (+ .cse7 1)))))) (or (forall ((~a~0 Int)) (let ((.cse9 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< .cse8 (+ c_~A~0.offset (* .cse9 4) 1)) (< (+ .cse9 c_~M~0) .cse5) (< c_~N~0 (+ ~a~0 1))))) .cse6) (or .cse6 (forall ((~a~0 Int)) (let ((.cse10 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse10 4) .cse3) .cse4) (< (+ (div (+ (- 1) .cse11 c_~F~0.offset) 4) c_thread1Thread1of1ForFork0_~i~0) .cse10) (< c_~N~0 (+ ~a~0 1)))))) (or (forall ((~a~0 Int)) (let ((.cse12 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ .cse12 c_~M~0) (+ 2 (div (+ .cse11 c_~F~0.offset) 4) c_thread1Thread1of1ForFork0_~i~0)) (< c_~F~0.offset (+ c_~A~0.offset (* .cse12 4) 1)) (< c_~N~0 (+ ~a~0 1))))) .cse6) (or (forall ((~a~0 Int)) (let ((.cse13 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse13 4) .cse3) (+ 5 c_~F~0.offset .cse14)) (< c_~N~0 (+ ~a~0 1)) (< c_thread1Thread1of1ForFork0_~i~0 (+ .cse13 1))))) .cse6)))) (<= .cse15 |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse19 (select (select .cse18 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse16 (store .cse20 .cse19 (store (select .cse20 .cse19) v_arrayElimCell_22 .cse21))) (.cse17 (* ~b~0 4))) (= (select (select .cse16 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse17)) (select (select .cse16 (select (select (store .cse18 .cse19 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse17 v_arrayElimCell_23)))) (< c_~N~0 (+ ~a~0 1)))) (not (= c_~B~0.base .cse19)))))) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse25 (store |c_#memory_int| .cse26 (store .cse27 v_arrayElimCell_21 .cse28))) (.cse23 (* ~b~0 4))) (let ((.cse24 (select (select .cse25 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse23))) (.cse22 (select .cse25 (select (select (store |c_#memory_$Pointer$.base| .cse26 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= (select .cse22 (+ .cse23 v_arrayElimCell_23)) .cse24) (= .cse24 (select .cse22 (+ .cse23 v_arrayElimCell_22))))))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) (or (< c_~N~0 2) .cse6) (or .cse6 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse31 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse30 (select (select .cse31 c_~B~0.base) c_~B~0.offset))) (let ((.cse29 (select (select (store .cse31 .cse30 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse29 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)) (= .cse29 .cse30))))))) (or (forall ((v_ArrVal_601 (Array Int Int))) (not (= c_~B~0.base (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset)))) .cse6 .cse32) (or .cse6 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse35 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse34 (select (select .cse35 c_~B~0.base) c_~B~0.offset))) (let ((.cse33 (select (select (store .cse35 .cse34 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= c_~F~0.base .cse33) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse33 .cse34))))))) (= |c_ULTIMATE.start_main_~i~2#1| 0) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (let ((.cse37 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse36 (select (select .cse37 c_~B~0.base) c_~B~0.offset))) (= .cse36 (select (select (store .cse37 .cse36 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))))) .cse6) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse41 (store |c_#memory_int| .cse42 (store .cse43 v_arrayElimCell_21 .cse44))) (.cse39 (* ~b~0 4))) (let ((.cse40 (select (select .cse41 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse39))) (.cse38 (select .cse41 (select (select (store |c_#memory_$Pointer$.base| .cse42 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= (select .cse38 (+ .cse39 v_arrayElimCell_23)) .cse40) (= .cse40 (select .cse38 (+ .cse39 v_arrayElimCell_22))))))) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) (< c_~M~0 (+ ~b~0 1)))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse45 (store |c_#memory_int| .cse26 (store .cse27 v_arrayElimCell_21 .cse28))) (.cse46 (* ~b~0 4))) (= (select (select .cse45 (select (select (store |c_#memory_$Pointer$.base| .cse26 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse46 v_arrayElimCell_23)) (select (select .cse45 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse46)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))) .cse47) (or .cse32 (< c_~M~0 2)) (<= .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse48 (store |c_#memory_int| .cse42 (store .cse43 v_arrayElimCell_21 .cse44))) (.cse49 (* ~b~0 4))) (= (select (select .cse48 (select (select (store |c_#memory_$Pointer$.base| .cse42 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse49 v_arrayElimCell_23)) (select (select .cse48 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse49)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse50) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (let ((.cse51 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse52 (select (select .cse51 c_~B~0.base) c_~B~0.offset))) (= (select (select (store .cse51 .cse52 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse52))))) .cse6) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (let ((.cse54 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse53 (select (select .cse54 c_~B~0.base) c_~B~0.offset))) (= .cse53 (select (select (store .cse54 .cse53 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))))) .cse6) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)) (let ((.cse55 (store |c_#memory_int| .cse42 (store .cse43 v_arrayElimCell_22 .cse44))) (.cse56 (* ~b~0 4))) (= (select (select .cse55 (select (select (store |c_#memory_$Pointer$.base| .cse42 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse56 v_arrayElimCell_22)) (select (select .cse55 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse56)))))) .cse57) (not (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| c_~A~0.base)) (or .cse50 (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse58 (store |c_#memory_int| .cse42 (store .cse43 v_arrayElimCell_22 .cse44))) (.cse59 (* ~b~0 4))) (= (select (select .cse58 (select (select (store |c_#memory_$Pointer$.base| .cse42 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse59 v_arrayElimCell_23)) (select (select .cse58 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse59)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1))))) (<= .cse60 |c_ULTIMATE.start_main_~#t1~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse63 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse62 (select (select .cse63 c_~B~0.base) c_~B~0.offset))) (let ((.cse61 (select (select (store .cse63 .cse62 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= c_~A~0.base .cse61) (< c_~N~0 (+ ~a~0 1)) (= .cse62 .cse61)))))) .cse6) (forall ((v_ArrVal_601 (Array Int Int)) (~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse68 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse69 (select (select .cse68 c_~B~0.base) c_~B~0.offset))) (let ((.cse67 (store .cse20 .cse69 (store (select .cse20 .cse69) v_arrayElimCell_21 .cse21))) (.cse66 (* ~b~0 4))) (let ((.cse64 (select (select .cse67 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse66))) (.cse65 (select .cse67 (select (select (store .cse68 .cse69 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse64 (select .cse65 (+ .cse66 v_arrayElimCell_22))) (= .cse64 (select .cse65 (+ .cse66 v_arrayElimCell_23))))))))) (< ~a~0 0) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) (or (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (not (= c_~B~0.base (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset)))) .cse6 .cse32) (= (select |c_#valid| c_~B~0.base) 1) (forall ((v_ArrVal_601 (Array Int Int)) (~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse74 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse75 (select (select .cse74 c_~B~0.base) c_~B~0.offset))) (let ((.cse73 (store .cse20 .cse75 (store (select .cse20 .cse75) v_arrayElimCell_22 .cse21))) (.cse72 (* ~b~0 4))) (let ((.cse70 (select (select .cse73 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse72))) (.cse71 (select .cse73 (select (select (store .cse74 .cse75 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse70 (select .cse71 (+ .cse72 v_arrayElimCell_22))) (= .cse70 (select .cse71 (+ .cse72 v_arrayElimCell_23))))))))) (< c_~N~0 (+ ~a~0 1)))))) (or .cse6 .cse76 (and (or .cse32 .cse0) (or .cse77 (forall ((~a~0 Int)) (or (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1))))))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)) (let ((.cse78 (store |c_#memory_int| .cse42 (store .cse43 v_arrayElimCell_21 .cse44))) (.cse79 (* ~b~0 4))) (= (select (select .cse78 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse79)) (select (select .cse78 (select (select (store |c_#memory_$Pointer$.base| .cse42 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse79 v_arrayElimCell_22)))) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse57) (<= 1 c_~L~0) (<= 0 c_~M~0) (forall ((~a~0 Int) (~b~0 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse81 (* ~b~0 4))) (= (select .cse80 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse81)) (let ((.cse83 (+ (* ~a~0 4) c_~B~0.offset))) (select (select |c_#memory_int| (select .cse82 .cse83)) (+ (select (select |c_#memory_$Pointer$.offset| c_~B~0.base) .cse83) .cse81))))) (< c_~N~0 (+ ~a~0 1)))) (or (and (or .cse77 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse85 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse84 (select (select .cse85 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~A~0.base .cse84)) (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (= (select (select (store .cse85 .cse84 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base) (< c_~N~0 (+ ~a~0 1))))))) (or .cse77 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse88 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse87 (select (select .cse88 c_~B~0.base) c_~B~0.offset))) (let ((.cse86 (select (select (store .cse88 .cse87 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (not (= .cse86 .cse87)) (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (= .cse86 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)))))))) (or .cse77 (forall ((~a~0 Int)) (let ((.cse89 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4)))) (or (< ~a~0 0) (= .cse89 .cse8) (= c_~F~0.offset .cse89) (< c_~N~0 (+ ~a~0 1)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_603 (Array Int Int))) (let ((.cse91 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse90 (select (select .cse91 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~A~0.base .cse90)) (= (select (select (store .cse91 .cse90 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base))))))))) (or .cse77 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (or (not (let ((.cse92 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse93 (select (select .cse92 c_~B~0.base) c_~B~0.offset))) (= (select (select (store .cse92 .cse93 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse93)))) (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1)))))) .cse6 .cse76) (= c_~B~0.offset 0) (forall ((~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse96 (* ~b~0 4)) (.cse97 (store |c_#memory_int| .cse42 (store .cse43 (+ .cse98 v_arrayElimCell_21) .cse99)))) (let ((.cse95 (select .cse97 (select (select (store |c_#memory_$Pointer$.base| .cse42 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse94 (select (select .cse97 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse96)))) (or (= .cse94 (select .cse95 (+ .cse96 v_arrayElimCell_23))) (= (select .cse95 (+ .cse96 v_arrayElimCell_22)) .cse94))))) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))))) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse103 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse100 (select (select .cse103 c_~B~0.base) c_~B~0.offset))) (or (= c_~B~0.base .cse100) (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse101 (store .cse20 .cse100 (store (select .cse20 .cse100) v_arrayElimCell_21 .cse21))) (.cse102 (* ~b~0 4))) (= (select (select .cse101 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse102)) (select (select .cse101 (select (select (store .cse103 .cse100 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse102 v_arrayElimCell_22)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))))))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse104 (store |c_#memory_int| .cse26 (store .cse27 v_arrayElimCell_22 .cse28))) (.cse105 (* ~b~0 4))) (= (select (select .cse104 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse105)) (select (select .cse104 (select (select (store |c_#memory_$Pointer$.base| .cse26 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse105 v_arrayElimCell_22)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) .cse106) (forall ((~a~0 Int) (v_ArrVal_603 (Array Int Int)) (~b~0 Int) (v_ArrVal_604 (Array Int Int))) (or (< ~b~0 0) (let ((.cse107 (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base| (store .cse110 .cse111 .cse99))) (.cse109 (* ~b~0 4))) (= (let ((.cse108 (+ (* ~a~0 4) c_~B~0.offset))) (select (select .cse107 (select (select (store |c_#memory_$Pointer$.base| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_603) c_~B~0.base) .cse108)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_604) c_~B~0.base) .cse108) .cse109))) (select (select .cse107 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse109)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse115 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse112 (select (select .cse115 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~B~0.base .cse112)) (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse113 (store .cse20 .cse112 (store (select .cse20 .cse112) v_arrayElimCell_21 .cse21))) (.cse114 (* ~b~0 4))) (= (select (select .cse113 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse114)) (select (select .cse113 (select (select (store .cse115 .cse112 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse114 v_arrayElimCell_23)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse118 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse117 (select (select .cse118 c_~B~0.base) c_~B~0.offset))) (let ((.cse116 (select (select (store .cse118 .cse117 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= c_~F~0.base .cse116) (< c_~N~0 (+ ~a~0 1)) (= .cse117 .cse116)))))) .cse6) (forall ((~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse122 (store |c_#memory_int| .cse42 (store .cse43 (+ .cse98 v_arrayElimCell_22) .cse99))) (.cse121 (* ~b~0 4))) (let ((.cse119 (select (select .cse122 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse121))) (.cse120 (select .cse122 (select (select (store |c_#memory_$Pointer$.base| .cse42 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse119 (select .cse120 (+ .cse121 v_arrayElimCell_23))) (= .cse119 (select .cse120 (+ .cse121 v_arrayElimCell_22))))))))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (let ((.cse123 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse124 (select (select .cse123 c_~B~0.base) c_~B~0.offset))) (or (= c_~A~0.base (select (select (store .cse123 .cse124 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (< ~a~0 0) (not (= .cse124 c_~A~0.base)) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1)))))) .cse6) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (let ((.cse125 (store |c_#memory_int| .cse42 (store .cse43 (+ .cse98 v_arrayElimCell_22) .cse99))) (.cse126 (* ~b~0 4))) (= (select (select .cse125 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse126)) (select (select .cse125 (select (select (store |c_#memory_$Pointer$.base| .cse42 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse126 v_arrayElimCell_23)))) (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) .cse50) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse127 (store |c_#memory_int| .cse42 (store .cse43 (+ .cse98 v_arrayElimCell_21) .cse99))) (.cse128 (* ~b~0 4))) (= (select (select .cse127 (select (select (store |c_#memory_$Pointer$.base| .cse42 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse128 v_arrayElimCell_22)) (select (select .cse127 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse128)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse57) (not (= c_~B~0.base c_~A~0.base)) (= (select |c_#valid| c_~A~0.base) 1) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse129 (store |c_#memory_int| .cse42 (store .cse43 (+ .cse98 v_arrayElimCell_21) .cse99))) (.cse130 (* ~b~0 4))) (= (select (select .cse129 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse130)) (select (select .cse129 (select (select (store |c_#memory_$Pointer$.base| .cse42 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse130 v_arrayElimCell_23)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse50) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse133 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse134 (select (select .cse133 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse131 (store .cse20 .cse134 (store (select .cse20 .cse134) v_arrayElimCell_22 .cse21))) (.cse132 (* ~b~0 4))) (= (select (select .cse131 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse132)) (select (select .cse131 (select (select (store .cse133 .cse134 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse132 v_arrayElimCell_22)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) (= c_~B~0.base .cse134))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (let ((.cse137 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse136 (select (select .cse137 c_~B~0.base) c_~B~0.offset))) (let ((.cse135 (select (select (store .cse137 .cse136 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= c_~A~0.base .cse135) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse136 .cse135)))))) .cse6) (forall ((~a~0 Int) (v_ArrVal_603 (Array Int Int)) (~b~0 Int) (v_ArrVal_604 (Array Int Int))) (or (< ~b~0 0) (let ((.cse138 (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base| (store .cse110 .cse111 |c_thread2Thread1of1ForFork1_#t~mem6|))) (.cse139 (* ~b~0 4))) (= (select (select .cse138 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse139)) (let ((.cse140 (+ (* ~a~0 4) c_~B~0.offset))) (select (select .cse138 (select (select (store |c_#memory_$Pointer$.base| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_603) c_~B~0.base) .cse140)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_604) c_~B~0.base) .cse140) .cse139))))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)) (let ((.cse141 (store |c_#memory_int| .cse42 (store .cse43 (+ .cse98 v_arrayElimCell_22) .cse99))) (.cse142 (* ~b~0 4))) (= (select (select .cse141 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse142)) (select (select .cse141 (select (select (store |c_#memory_$Pointer$.base| .cse42 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse142 v_arrayElimCell_22)))))) .cse57) (<= .cse60 |c_ULTIMATE.start_main_~#t2~0#1.base|) (or .cse106 (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse143 (store |c_#memory_int| .cse26 (store .cse27 v_arrayElimCell_21 .cse28))) (.cse144 (* ~b~0 4))) (= (select (select .cse143 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse144)) (select (select .cse143 (select (select (store |c_#memory_$Pointer$.base| .cse26 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse144 v_arrayElimCell_22)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1))))) (or (forall ((~a~0 Int)) (let ((.cse145 (* ~a~0 c_~M~0))) (let ((.cse146 (+ c_~A~0.offset (* .cse145 4)))) (or (= .cse145 c_thread1Thread1of1ForFork0_~i~0) (< ~a~0 0) (= .cse146 .cse8) (= c_~F~0.offset .cse146) (< c_~N~0 (+ ~a~0 1)))))) .cse6) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse148 (* ~b~0 4)) (.cse150 (store |c_#memory_int| .cse42 (store .cse43 v_arrayElimCell_22 .cse44)))) (let ((.cse147 (select .cse150 (select (select (store |c_#memory_$Pointer$.base| .cse42 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse149 (select (select .cse150 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse148)))) (or (= (select .cse147 (+ .cse148 v_arrayElimCell_23)) .cse149) (= (select .cse147 (+ .cse148 v_arrayElimCell_22)) .cse149))))) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse151 (store |c_#memory_int| .cse26 (store .cse27 v_arrayElimCell_22 .cse28))) (.cse152 (* ~b~0 4))) (= (select (select .cse151 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse152)) (select (select .cse151 (select (select (store |c_#memory_$Pointer$.base| .cse26 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse152 v_arrayElimCell_23)))) (< c_~N~0 (+ ~a~0 1)))) .cse47) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse155 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse154 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (.cse153 (select (select .cse155 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~A~0.base .cse153)) (< ~a~0 0) (= .cse154 .cse8) (= c_~F~0.offset .cse154) (= (select (select (store .cse155 .cse153 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base) (< c_~N~0 (+ ~a~0 1)))))) .cse6) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (or .cse6 .cse32 (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset) c_~B~0.base)))) (or .cse6 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (let ((.cse158 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse157 (select (select .cse158 c_~B~0.base) c_~B~0.offset))) (let ((.cse156 (select (select (store .cse158 .cse157 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= c_~F~0.base .cse156) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse157 .cse156))))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse159 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse160 (select (select .cse159 c_~B~0.base) c_~B~0.offset))) (or (< ~a~0 0) (= c_~A~0.base (select (select (store .cse159 .cse160 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (not (= c_~A~0.base .cse160)) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1)))))) .cse6) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse164 (store |c_#memory_int| .cse26 (store .cse27 v_arrayElimCell_22 .cse28))) (.cse163 (* ~b~0 4))) (let ((.cse161 (select (select .cse164 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse163))) (.cse162 (select .cse164 (select (select (store |c_#memory_$Pointer$.base| .cse26 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse161 (select .cse162 (+ .cse163 v_arrayElimCell_22))) (= .cse161 (select .cse162 (+ .cse163 v_arrayElimCell_23))))))) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) (or .cse77 .cse1 .cse76 (and (or (forall ((~a~0 Int)) (or (< ~a~0 0) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse3) .cse4) (< c_~N~0 (+ ~a~0 1)))) .cse6) (or (forall ((~a~0 Int)) (or (< ~a~0 0) (< c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< c_~N~0 (+ ~a~0 1)))) .cse6)))))))) is different from true [2024-01-26 08:30:11,790 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse14 (* c_thread1Thread1of1ForFork0_~i~0 4)) (.cse103 (select |c_#memory_$Pointer$.base| c_~B~0.base))) (let ((.cse52 (select .cse103 (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset))) (.cse101 (select |c_#memory_int| c_~A~0.base)) (.cse199 (+ c_~A~0.offset .cse14)) (.cse28 (select .cse103 c_~B~0.offset))) (let ((.cse128 (= c_~B~0.base .cse28)) (.cse41 (< |c_ULTIMATE.start_main_~i~2#1| 0)) (.cse61 (< c_~M~0 2)) (.cse200 (select |c_#memory_int| c_~F~0.base)) (.cse201 (* (* c_thread2Thread1of1ForFork1_~i~1 c_~M~0) 4)) (.cse119 (* c_thread2Thread1of1ForFork1_~j~0 4)) (.cse22 (store |c_#memory_int| c_~A~0.base (store .cse101 .cse199 |c_thread1Thread1of1ForFork0_#t~mem2|))) (.cse73 (= .cse52 c_~B~0.base)) (.cse6 (< c_~M~0 1))) (let ((.cse17 (+ 2 c_~B~0.base)) (.cse60 (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (.cse0 (= c_~F~0.base c_~A~0.base)) (.cse47 (or .cse6 (< |c_ULTIMATE.start_main_~i~2#1| 1))) (.cse38 (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~B~0.base))) (.cse39 (not (= c_~B~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|))) (.cse40 (not (= c_~B~0.base c_~A~0.base))) (.cse64 (not .cse73)) (.cse23 (select (select .cse22 c_~F~0.base) c_~F~0.offset)) (.cse132 (select |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base|)) (.cse133 (+ .cse119 |c_thread2Thread1of1ForFork1_#t~mem5.offset|)) (.cse120 (select .cse200 (+ .cse119 .cse201 c_~F~0.offset))) (.cse76 (+ |c_#StackHeapBarrier| 1)) (.cse87 (< |c_ULTIMATE.start_main_#t~post12#1| 0)) (.cse86 (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (not (= c_~B~0.base (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset))))) (.cse53 (select |c_#memory_int| .cse52)) (.cse54 (select .cse200 (+ .cse201 c_~F~0.offset))) (.cse125 (or .cse41 .cse61)) (.cse59 (not .cse128)) (.cse8 (+ c_~F~0.offset .cse14)) (.cse34 (< c_~N~0 1)) (.cse44 (or (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t2~0#1.base| 1)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0)))) (.cse45 (or (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t1~0#1.base|) 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_main_~#t1~0#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t1~0#1.base| 1)))) (.cse29 (select |c_#memory_int| .cse28)) (.cse30 (select .cse200 c_~F~0.offset)) (.cse98 (= .cse199 c_~F~0.offset)) (.cse1 (forall ((v_ArrVal_601 (Array Int Int))) (= c_~B~0.base (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset)))) (.cse97 (= c_thread1Thread1of1ForFork0_~i~0 0)) (.cse3 (* 4 c_~M~0)) (.cse4 (+ 5 c_~F~0.offset)) (.cse46 (not (= c_~M~0 1)))) (and (= c_~F~0.offset 0) (not .cse0) (or .cse1 (let ((.cse5 (+ 2 c_thread1Thread1of1ForFork0_~i~0)) (.cse11 (* c_~A~0.offset (- 1)))) (and (or (forall ((~a~0 Int)) (let ((.cse2 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse2 4) .cse3) .cse4) (< (+ .cse2 c_~M~0) .cse5) (< c_~N~0 (+ ~a~0 1))))) .cse6) (or .cse6 (forall ((~a~0 Int)) (let ((.cse7 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< c_~F~0.offset (+ c_~A~0.offset (* .cse7 4) 1)) (< c_~N~0 (+ ~a~0 1)) (< c_thread1Thread1of1ForFork0_~i~0 (+ .cse7 1)))))) (or (forall ((~a~0 Int)) (let ((.cse9 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< .cse8 (+ c_~A~0.offset (* .cse9 4) 1)) (< (+ .cse9 c_~M~0) .cse5) (< c_~N~0 (+ ~a~0 1))))) .cse6) (or .cse6 (forall ((~a~0 Int)) (let ((.cse10 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse10 4) .cse3) .cse4) (< (+ (div (+ (- 1) .cse11 c_~F~0.offset) 4) c_thread1Thread1of1ForFork0_~i~0) .cse10) (< c_~N~0 (+ ~a~0 1)))))) (or (forall ((~a~0 Int)) (let ((.cse12 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ .cse12 c_~M~0) (+ 2 (div (+ .cse11 c_~F~0.offset) 4) c_thread1Thread1of1ForFork0_~i~0)) (< c_~F~0.offset (+ c_~A~0.offset (* .cse12 4) 1)) (< c_~N~0 (+ ~a~0 1))))) .cse6) (or (forall ((~a~0 Int)) (let ((.cse13 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse13 4) .cse3) (+ 5 c_~F~0.offset .cse14)) (< c_~N~0 (+ ~a~0 1)) (< c_thread1Thread1of1ForFork0_~i~0 (+ .cse13 1))))) .cse6)))) (or .cse6 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~i~2#1| ~a~0) (< ~a~0 0) (let ((.cse16 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse15 (select (select .cse16 c_~B~0.base) c_~B~0.offset))) (= .cse15 (select (select (store .cse16 .cse15 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))))))) (<= .cse17 |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse21 (select (select .cse20 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse18 (store .cse22 .cse21 (store (select .cse22 .cse21) v_arrayElimCell_22 .cse23))) (.cse19 (* ~b~0 4))) (= (select (select .cse18 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse19)) (select (select .cse18 (select (select (store .cse20 .cse21 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse19 v_arrayElimCell_23)))) (< c_~N~0 (+ ~a~0 1)))) (not (= c_~B~0.base .cse21)))))) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse27 (store |c_#memory_int| .cse28 (store .cse29 v_arrayElimCell_21 .cse30))) (.cse25 (* ~b~0 4))) (let ((.cse26 (select (select .cse27 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse25))) (.cse24 (select .cse27 (select (select (store |c_#memory_$Pointer$.base| .cse28 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= (select .cse24 (+ .cse25 v_arrayElimCell_23)) .cse26) (= .cse26 (select .cse24 (+ .cse25 v_arrayElimCell_22))))))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) (or (< c_~N~0 2) .cse6) (or .cse6 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse33 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse32 (select (select .cse33 c_~B~0.base) c_~B~0.offset))) (let ((.cse31 (select (select (store .cse33 .cse32 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse31 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)) (= .cse31 .cse32))))))) (or (forall ((v_ArrVal_601 (Array Int Int))) (not (= c_~B~0.base (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset)))) .cse6 .cse34) (or .cse6 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse37 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse36 (select (select .cse37 c_~B~0.base) c_~B~0.offset))) (let ((.cse35 (select (select (store .cse37 .cse36 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= c_~F~0.base .cse35) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse35 .cse36))))))) (<= |c_ULTIMATE.start_create_fresh_int_array_#in~size#1| c_~L~0) (= |c_ULTIMATE.start_create_fresh_int_array_~size#1| c_~M~0) (or (and .cse38 (not (= |c_ULTIMATE.start_main_#t~ret13#1.base| c_~B~0.base)) .cse39 .cse40) .cse6 .cse41) (= |c_ULTIMATE.start_main_~i~2#1| 0) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (let ((.cse43 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse42 (select (select .cse43 c_~B~0.base) c_~B~0.offset))) (= .cse42 (select (select (store .cse43 .cse42 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))))) .cse6) (or (and .cse44 .cse45 (or (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_#t~ret9#1.base| 1)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_main_#t~ret9#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (not (= 0 (select |c_#valid| |c_ULTIMATE.start_main_#t~ret9#1.base|))))) .cse46) .cse47 (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse51 (store |c_#memory_int| .cse52 (store .cse53 v_arrayElimCell_21 .cse54))) (.cse49 (* ~b~0 4))) (let ((.cse50 (select (select .cse51 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse49))) (.cse48 (select .cse51 (select (select (store |c_#memory_$Pointer$.base| .cse52 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= (select .cse48 (+ .cse49 v_arrayElimCell_23)) .cse50) (= .cse50 (select .cse48 (+ .cse49 v_arrayElimCell_22))))))) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) (< c_~M~0 (+ ~b~0 1)))) (or .cse6 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse55 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse56 (select (select .cse55 c_~B~0.base) c_~B~0.offset))) (or (< |c_ULTIMATE.start_main_~i~2#1| ~a~0) (< ~a~0 0) (= c_~A~0.base (select (select (store .cse55 .cse56 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (not (= c_~A~0.base .cse56)) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4)))))))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse57 (store |c_#memory_int| .cse28 (store .cse29 v_arrayElimCell_21 .cse30))) (.cse58 (* ~b~0 4))) (= (select (select .cse57 (select (select (store |c_#memory_$Pointer$.base| .cse28 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse58 v_arrayElimCell_23)) (select (select .cse57 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse58)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))) .cse59) .cse60 (or .cse34 .cse61) (<= .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse62 (store |c_#memory_int| .cse52 (store .cse53 v_arrayElimCell_21 .cse54))) (.cse63 (* ~b~0 4))) (= (select (select .cse62 (select (select (store |c_#memory_$Pointer$.base| .cse52 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse63 v_arrayElimCell_23)) (select (select .cse62 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse63)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse64) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (let ((.cse65 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse66 (select (select .cse65 c_~B~0.base) c_~B~0.offset))) (= (select (select (store .cse65 .cse66 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse66))))) .cse6) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse67 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse68 (select (select .cse67 c_~B~0.base) c_~B~0.offset))) (or (< ~a~0 0) (= c_~A~0.base (select (select (store .cse67 .cse68 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (not (= c_~A~0.base .cse68)) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< |c_ULTIMATE.start_main_#t~post12#1| ~a~0))))) .cse6) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (let ((.cse70 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse69 (select (select .cse70 c_~B~0.base) c_~B~0.offset))) (= .cse69 (select (select (store .cse70 .cse69 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))))) .cse6) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)) (let ((.cse71 (store |c_#memory_int| .cse52 (store .cse53 v_arrayElimCell_22 .cse54))) (.cse72 (* ~b~0 4))) (= (select (select .cse71 (select (select (store |c_#memory_$Pointer$.base| .cse52 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse72 v_arrayElimCell_22)) (select (select .cse71 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse72)))))) .cse73) (or .cse64 (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse74 (store |c_#memory_int| .cse52 (store .cse53 v_arrayElimCell_22 .cse54))) (.cse75 (* ~b~0 4))) (= (select (select .cse74 (select (select (store |c_#memory_$Pointer$.base| .cse52 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse75 v_arrayElimCell_23)) (select (select .cse74 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse75)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1))))) (<= .cse76 |c_ULTIMATE.start_main_~#t1~0#1.base|) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse79 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse78 (select (select .cse79 c_~B~0.base) c_~B~0.offset))) (let ((.cse77 (select (select (store .cse79 .cse78 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= c_~A~0.base .cse77) (< c_~N~0 (+ ~a~0 1)) (= .cse78 .cse77)))))) .cse6) (forall ((v_ArrVal_601 (Array Int Int)) (~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse84 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse85 (select (select .cse84 c_~B~0.base) c_~B~0.offset))) (let ((.cse83 (store .cse22 .cse85 (store (select .cse22 .cse85) v_arrayElimCell_21 .cse23))) (.cse82 (* ~b~0 4))) (let ((.cse80 (select (select .cse83 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse82))) (.cse81 (select .cse83 (select (select (store .cse84 .cse85 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse80 (select .cse81 (+ .cse82 v_arrayElimCell_22))) (= .cse80 (select .cse81 (+ .cse82 v_arrayElimCell_23))))))))) (< ~a~0 0) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) (= |c_ULTIMATE.start_create_fresh_int_array_#in~size#1| c_~M~0) (or .cse86 .cse6 .cse34) (= (select |c_#valid| c_~B~0.base) 1) (or .cse87 .cse61) (or .cse6 (and .cse38 .cse60 .cse39 .cse40) .cse41) (forall ((v_ArrVal_601 (Array Int Int)) (~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse92 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse93 (select (select .cse92 c_~B~0.base) c_~B~0.offset))) (let ((.cse91 (store .cse22 .cse93 (store (select .cse22 .cse93) v_arrayElimCell_22 .cse23))) (.cse90 (* ~b~0 4))) (let ((.cse88 (select (select .cse91 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse90))) (.cse89 (select .cse91 (select (select (store .cse92 .cse93 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse88 (select .cse89 (+ .cse90 v_arrayElimCell_22))) (= .cse88 (select .cse89 (+ .cse90 v_arrayElimCell_23))))))))) (< c_~N~0 (+ ~a~0 1)))))) (or .cse6 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse96 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse95 (select (select .cse96 c_~B~0.base) c_~B~0.offset))) (let ((.cse94 (select (select (store .cse96 .cse95 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< |c_ULTIMATE.start_main_~i~2#1| ~a~0) (< ~a~0 0) (= c_~A~0.base .cse94) (= .cse95 .cse94))))))) (or .cse6 .cse97 (and (or .cse34 .cse0) (or .cse98 (forall ((~a~0 Int)) (or (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1))))))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)) (let ((.cse99 (store |c_#memory_int| .cse52 (store .cse53 v_arrayElimCell_21 .cse54))) (.cse100 (* ~b~0 4))) (= (select (select .cse99 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse100)) (select (select .cse99 (select (select (store |c_#memory_$Pointer$.base| .cse52 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse100 v_arrayElimCell_22)))) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse73) (<= 1 c_~L~0) (not (= c_~A~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= 0 c_~M~0) (forall ((~a~0 Int) (~b~0 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse102 (* ~b~0 4))) (= (select .cse101 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse102)) (let ((.cse104 (+ (* ~a~0 4) c_~B~0.offset))) (select (select |c_#memory_int| (select .cse103 .cse104)) (+ (select (select |c_#memory_$Pointer$.offset| c_~B~0.base) .cse104) .cse102))))) (< c_~N~0 (+ ~a~0 1)))) (or (and (or .cse98 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse106 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse105 (select (select .cse106 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~A~0.base .cse105)) (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (= (select (select (store .cse106 .cse105 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base) (< c_~N~0 (+ ~a~0 1))))))) (or .cse98 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse109 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse108 (select (select .cse109 c_~B~0.base) c_~B~0.offset))) (let ((.cse107 (select (select (store .cse109 .cse108 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (not (= .cse107 .cse108)) (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (= .cse107 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)))))))) (or .cse98 (forall ((~a~0 Int)) (let ((.cse110 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4)))) (or (< ~a~0 0) (= .cse110 .cse8) (= c_~F~0.offset .cse110) (< c_~N~0 (+ ~a~0 1)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_603 (Array Int Int))) (let ((.cse112 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse111 (select (select .cse112 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~A~0.base .cse111)) (= (select (select (store .cse112 .cse111 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base))))))))) (or .cse98 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (or (not (let ((.cse113 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse114 (select (select .cse113 c_~B~0.base) c_~B~0.offset))) (= (select (select (store .cse113 .cse114 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse114)))) (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1)))))) .cse6 .cse97) (= c_~B~0.offset 0) (forall ((~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse117 (* ~b~0 4)) (.cse118 (store |c_#memory_int| .cse52 (store .cse53 (+ .cse119 v_arrayElimCell_21) .cse120)))) (let ((.cse116 (select .cse118 (select (select (store |c_#memory_$Pointer$.base| .cse52 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse115 (select (select .cse118 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse117)))) (or (= .cse115 (select .cse116 (+ .cse117 v_arrayElimCell_23))) (= (select .cse116 (+ .cse117 v_arrayElimCell_22)) .cse115))))) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))))) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse124 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse121 (select (select .cse124 c_~B~0.base) c_~B~0.offset))) (or (= c_~B~0.base .cse121) (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse122 (store .cse22 .cse121 (store (select .cse22 .cse121) v_arrayElimCell_21 .cse23))) (.cse123 (* ~b~0 4))) (= (select (select .cse122 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse123)) (select (select .cse122 (select (select (store .cse124 .cse121 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse123 v_arrayElimCell_22)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))))))) (or (not (= |c_ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (and .cse47 .cse125 (or .cse6 .cse41 (and .cse38 (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base|)) .cse39 .cse40)))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse126 (store |c_#memory_int| .cse28 (store .cse29 v_arrayElimCell_22 .cse30))) (.cse127 (* ~b~0 4))) (= (select (select .cse126 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse127)) (select (select .cse126 (select (select (store |c_#memory_$Pointer$.base| .cse28 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse127 v_arrayElimCell_22)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) .cse128) (forall ((~a~0 Int) (v_ArrVal_603 (Array Int Int)) (~b~0 Int) (v_ArrVal_604 (Array Int Int))) (or (< ~b~0 0) (let ((.cse129 (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base| (store .cse132 .cse133 .cse120))) (.cse131 (* ~b~0 4))) (= (let ((.cse130 (+ (* ~a~0 4) c_~B~0.offset))) (select (select .cse129 (select (select (store |c_#memory_$Pointer$.base| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_603) c_~B~0.base) .cse130)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_604) c_~B~0.base) .cse130) .cse131))) (select (select .cse129 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse131)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse137 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse134 (select (select .cse137 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~B~0.base .cse134)) (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse135 (store .cse22 .cse134 (store (select .cse22 .cse134) v_arrayElimCell_21 .cse23))) (.cse136 (* ~b~0 4))) (= (select (select .cse135 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse136)) (select (select .cse135 (select (select (store .cse137 .cse134 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse136 v_arrayElimCell_23)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse140 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse139 (select (select .cse140 c_~B~0.base) c_~B~0.offset))) (let ((.cse138 (select (select (store .cse140 .cse139 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= c_~F~0.base .cse138) (< c_~N~0 (+ ~a~0 1)) (= .cse139 .cse138)))))) .cse6) (or (< |c_ULTIMATE.start_main_#t~post12#1| 1) .cse6) (forall ((~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse144 (store |c_#memory_int| .cse52 (store .cse53 (+ .cse119 v_arrayElimCell_22) .cse120))) (.cse143 (* ~b~0 4))) (let ((.cse141 (select (select .cse144 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse143))) (.cse142 (select .cse144 (select (select (store |c_#memory_$Pointer$.base| .cse52 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse141 (select .cse142 (+ .cse143 v_arrayElimCell_23))) (= .cse141 (select .cse142 (+ .cse143 v_arrayElimCell_22))))))))))) (or (and .cse44 .cse45 (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1)) (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)))) .cse46) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (let ((.cse145 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse146 (select (select .cse145 c_~B~0.base) c_~B~0.offset))) (or (= c_~A~0.base (select (select (store .cse145 .cse146 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (< ~a~0 0) (not (= .cse146 c_~A~0.base)) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1)))))) .cse6) (or .cse6 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse149 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse148 (select (select .cse149 c_~B~0.base) c_~B~0.offset))) (let ((.cse147 (select (select (store .cse149 .cse148 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= c_~A~0.base .cse147) (< |c_ULTIMATE.start_main_#t~post12#1| ~a~0) (= .cse148 .cse147))))))) (<= |c_ULTIMATE.start_create_fresh_int_array_~size#1| c_~L~0) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (let ((.cse150 (store |c_#memory_int| .cse52 (store .cse53 (+ .cse119 v_arrayElimCell_22) .cse120))) (.cse151 (* ~b~0 4))) (= (select (select .cse150 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse151)) (select (select .cse150 (select (select (store |c_#memory_$Pointer$.base| .cse52 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse151 v_arrayElimCell_23)))) (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) .cse64) (or (and .cse38 .cse39 (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse40) .cse6 .cse41) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse152 (store |c_#memory_int| .cse52 (store .cse53 (+ .cse119 v_arrayElimCell_21) .cse120))) (.cse153 (* ~b~0 4))) (= (select (select .cse152 (select (select (store |c_#memory_$Pointer$.base| .cse52 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse153 v_arrayElimCell_22)) (select (select .cse152 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse153)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse73) .cse40 (= (select |c_#valid| c_~A~0.base) 1) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse154 (store |c_#memory_int| .cse52 (store .cse53 (+ .cse119 v_arrayElimCell_21) .cse120))) (.cse155 (* ~b~0 4))) (= (select (select .cse154 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse155)) (select (select .cse154 (select (select (store |c_#memory_$Pointer$.base| .cse52 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse155 v_arrayElimCell_23)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse64) (or .cse86 .cse6 .cse41) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse158 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse159 (select (select .cse158 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse156 (store .cse22 .cse159 (store (select .cse22 .cse159) v_arrayElimCell_22 .cse23))) (.cse157 (* ~b~0 4))) (= (select (select .cse156 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse157)) (select (select .cse156 (select (select (store .cse158 .cse159 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse157 v_arrayElimCell_22)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) (= c_~B~0.base .cse159))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (let ((.cse162 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse161 (select (select .cse162 c_~B~0.base) c_~B~0.offset))) (let ((.cse160 (select (select (store .cse162 .cse161 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= c_~A~0.base .cse160) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse161 .cse160)))))) .cse6) (forall ((~a~0 Int) (v_ArrVal_603 (Array Int Int)) (~b~0 Int) (v_ArrVal_604 (Array Int Int))) (or (< ~b~0 0) (let ((.cse163 (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base| (store .cse132 .cse133 |c_thread2Thread1of1ForFork1_#t~mem6|))) (.cse164 (* ~b~0 4))) (= (select (select .cse163 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse164)) (let ((.cse165 (+ (* ~a~0 4) c_~B~0.offset))) (select (select .cse163 (select (select (store |c_#memory_$Pointer$.base| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_603) c_~B~0.base) .cse165)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_604) c_~B~0.base) .cse165) .cse164))))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)) (let ((.cse166 (store |c_#memory_int| .cse52 (store .cse53 (+ .cse119 v_arrayElimCell_22) .cse120))) (.cse167 (* ~b~0 4))) (= (select (select .cse166 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse167)) (select (select .cse166 (select (select (store |c_#memory_$Pointer$.base| .cse52 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse167 v_arrayElimCell_22)))))) .cse73) (<= .cse76 |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (and .cse44 .cse45 (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1)) (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0)))) .cse46) (or .cse128 (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse168 (store |c_#memory_int| .cse28 (store .cse29 v_arrayElimCell_21 .cse30))) (.cse169 (* ~b~0 4))) (= (select (select .cse168 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse169)) (select (select .cse168 (select (select (store |c_#memory_$Pointer$.base| .cse28 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse169 v_arrayElimCell_22)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1))))) (or .cse87 .cse86 .cse6) (or (forall ((~a~0 Int)) (let ((.cse170 (* ~a~0 c_~M~0))) (let ((.cse171 (+ c_~A~0.offset (* .cse170 4)))) (or (= .cse170 c_thread1Thread1of1ForFork0_~i~0) (< ~a~0 0) (= .cse171 .cse8) (= c_~F~0.offset .cse171) (< c_~N~0 (+ ~a~0 1)))))) .cse6) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse173 (* ~b~0 4)) (.cse175 (store |c_#memory_int| .cse52 (store .cse53 v_arrayElimCell_22 .cse54)))) (let ((.cse172 (select .cse175 (select (select (store |c_#memory_$Pointer$.base| .cse52 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse174 (select (select .cse175 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse173)))) (or (= (select .cse172 (+ .cse173 v_arrayElimCell_23)) .cse174) (= (select .cse172 (+ .cse173 v_arrayElimCell_22)) .cse174))))) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) .cse125 (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (or (< ~a~0 0) (< |c_ULTIMATE.start_main_#t~post12#1| ~a~0) (let ((.cse177 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse176 (select (select .cse177 c_~B~0.base) c_~B~0.offset))) (= .cse176 (select (select (store .cse177 .cse176 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))))) .cse6) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse178 (store |c_#memory_int| .cse28 (store .cse29 v_arrayElimCell_22 .cse30))) (.cse179 (* ~b~0 4))) (= (select (select .cse178 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse179)) (select (select .cse178 (select (select (store |c_#memory_$Pointer$.base| .cse28 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse179 v_arrayElimCell_23)))) (< c_~N~0 (+ ~a~0 1)))) .cse59) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse182 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse181 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (.cse180 (select (select .cse182 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~A~0.base .cse180)) (< ~a~0 0) (= .cse181 .cse8) (= c_~F~0.offset .cse181) (= (select (select (store .cse182 .cse180 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base) (< c_~N~0 (+ ~a~0 1)))))) .cse6) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse185 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse184 (select (select .cse185 c_~B~0.base) c_~B~0.offset))) (let ((.cse183 (select (select (store .cse185 .cse184 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< |c_ULTIMATE.start_main_~i~2#1| ~a~0) (< ~a~0 0) (= c_~F~0.base .cse183) (= .cse184 .cse183)))))) .cse6) (or .cse6 .cse34 (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset) c_~B~0.base)))) (or .cse6 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (let ((.cse188 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse187 (select (select .cse188 c_~B~0.base) c_~B~0.offset))) (let ((.cse186 (select (select (store .cse188 .cse187 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= c_~F~0.base .cse186) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse187 .cse186))))))) (or (and .cse44 (or (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base| 1)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base|) 0))) .cse45) .cse46 (< |c_ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse189 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse190 (select (select .cse189 c_~B~0.base) c_~B~0.offset))) (or (< ~a~0 0) (= c_~A~0.base (select (select (store .cse189 .cse190 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (not (= c_~A~0.base .cse190)) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1)))))) .cse6) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse194 (store |c_#memory_int| .cse28 (store .cse29 v_arrayElimCell_22 .cse30))) (.cse193 (* ~b~0 4))) (let ((.cse191 (select (select .cse194 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse193))) (.cse192 (select .cse194 (select (select (store |c_#memory_$Pointer$.base| .cse28 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse191 (select .cse192 (+ .cse193 v_arrayElimCell_22))) (= .cse191 (select .cse192 (+ .cse193 v_arrayElimCell_23))))))) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) (or .cse6 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse197 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse196 (select (select .cse197 c_~B~0.base) c_~B~0.offset))) (let ((.cse195 (select (select (store .cse197 .cse196 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= c_~F~0.base .cse195) (< |c_ULTIMATE.start_main_#t~post12#1| ~a~0) (= .cse196 .cse195))))))) (or .cse98 .cse1 .cse97 (and (or (forall ((~a~0 Int)) (or (< ~a~0 0) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse3) .cse4) (< c_~N~0 (+ ~a~0 1)))) .cse6) (or (forall ((~a~0 Int)) (or (< ~a~0 0) (< c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< c_~N~0 (+ ~a~0 1)))) .cse6))) (or (let ((.cse198 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))))) (and (or .cse198 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_main_#t~malloc11#1.base|))) (or .cse198 (not (= c_~A~0.base |c_ULTIMATE.start_main_#t~malloc11#1.base|))) (or (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_#t~malloc11#1.base|)) .cse198) (not (= (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc11#1.base|) 0)))) .cse46)))))) is different from true [2024-01-26 08:30:35,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:30:35,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:30:35,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:30:35,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-01-26 08:30:35,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:30:35,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 08:30:35,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:30:35,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-01-26 08:30:35,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-01-26 08:30:35,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 08:30:35,678 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 08:30:35,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 08:30:35,679 INFO L85 PathProgramCache]: Analyzing trace with hash 694519321, now seen corresponding path program 2 times [2024-01-26 08:30:35,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 08:30:35,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780887008] [2024-01-26 08:30:35,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 08:30:35,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 08:30:35,707 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-01-26 08:30:35,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1682492339] [2024-01-26 08:30:35,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-26 08:30:35,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 08:30:35,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 08:30:35,708 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 08:30:35,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-01-26 08:30:36,130 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-26 08:30:36,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 08:30:36,134 INFO L262 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-26 08:30:36,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 08:30:36,357 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-26 08:30:36,358 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 08:30:36,653 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-26 08:30:36,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 08:30:36,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780887008] [2024-01-26 08:30:36,653 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-01-26 08:30:36,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682492339] [2024-01-26 08:30:36,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682492339] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 08:30:36,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-26 08:30:36,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2024-01-26 08:30:36,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822232103] [2024-01-26 08:30:36,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-26 08:30:36,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-01-26 08:30:36,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 08:30:36,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-01-26 08:30:36,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2024-01-26 08:30:36,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:30:36,655 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 08:30:36,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 15.631578947368421) internal successors, (297), 19 states have internal predecessors, (297), 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) [2024-01-26 08:30:36,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:30:36,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:30:36,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:30:36,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-01-26 08:30:36,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:30:36,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 08:30:36,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:30:36,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-01-26 08:30:36,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:30:37,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:30:37,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:30:37,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:30:37,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-01-26 08:30:37,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:30:37,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 08:30:37,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:30:37,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-01-26 08:30:37,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-01-26 08:30:37,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-01-26 08:30:37,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-01-26 08:30:37,594 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 08:30:37,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 08:30:37,594 INFO L85 PathProgramCache]: Analyzing trace with hash -964264081, now seen corresponding path program 3 times [2024-01-26 08:30:37,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 08:30:37,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196183128] [2024-01-26 08:30:37,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 08:30:37,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 08:30:37,620 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-01-26 08:30:37,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1917247262] [2024-01-26 08:30:37,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-26 08:30:37,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 08:30:37,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 08:30:37,632 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 08:30:37,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-01-26 08:30:38,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-01-26 08:30:38,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 08:30:38,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 14 conjunts are in the unsatisfiable core [2024-01-26 08:30:38,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 08:30:38,951 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-01-26 08:30:38,951 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 08:30:40,072 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-01-26 08:30:40,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 08:30:40,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196183128] [2024-01-26 08:30:40,073 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-01-26 08:30:40,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917247262] [2024-01-26 08:30:40,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917247262] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 08:30:40,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-26 08:30:40,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2024-01-26 08:30:40,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344781032] [2024-01-26 08:30:40,074 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-26 08:30:40,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-01-26 08:30:40,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 08:30:40,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-01-26 08:30:40,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2024-01-26 08:30:40,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:30:40,076 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 08:30:40,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 17.75) internal successors, (426), 24 states have internal predecessors, (426), 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) [2024-01-26 08:30:40,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:30:40,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:30:40,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:30:40,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-01-26 08:30:40,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:30:40,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 08:30:40,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:30:40,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-01-26 08:30:40,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-01-26 08:30:40,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:30:42,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:30:42,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:30:42,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:30:42,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-01-26 08:30:42,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:30:42,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 08:30:42,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:30:42,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-01-26 08:30:42,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-01-26 08:30:42,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-01-26 08:30:42,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-01-26 08:30:42,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 08:30:42,955 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 08:30:42,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 08:30:42,955 INFO L85 PathProgramCache]: Analyzing trace with hash -2104319938, now seen corresponding path program 4 times [2024-01-26 08:30:42,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 08:30:42,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486836577] [2024-01-26 08:30:42,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 08:30:42,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 08:30:42,973 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-01-26 08:30:42,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1654017013] [2024-01-26 08:30:42,974 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-26 08:30:42,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 08:30:42,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 08:30:42,975 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 08:30:42,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-01-26 08:30:43,141 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-26 08:30:43,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 08:30:43,143 INFO L262 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-26 08:30:43,147 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 08:30:43,433 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-01-26 08:30:43,434 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 08:30:43,799 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-01-26 08:30:43,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 08:30:43,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486836577] [2024-01-26 08:30:43,800 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-01-26 08:30:43,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654017013] [2024-01-26 08:30:43,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654017013] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 08:30:43,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-26 08:30:43,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2024-01-26 08:30:43,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563508527] [2024-01-26 08:30:43,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-26 08:30:43,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-01-26 08:30:43,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 08:30:43,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-01-26 08:30:43,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2024-01-26 08:30:43,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:30:43,802 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 08:30:43,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 15.526315789473685) internal successors, (295), 19 states have internal predecessors, (295), 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) [2024-01-26 08:30:43,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:30:43,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:30:43,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:30:43,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-01-26 08:30:43,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:30:43,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 08:30:43,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:30:43,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-01-26 08:30:43,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-01-26 08:30:43,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2024-01-26 08:30:43,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:30:44,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:30:44,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:30:44,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:30:44,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-01-26 08:30:44,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:30:44,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 08:30:44,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:30:44,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-01-26 08:30:44,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-01-26 08:30:44,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-01-26 08:30:44,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-01-26 08:30:44,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-01-26 08:30:44,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-01-26 08:30:44,804 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 08:30:44,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 08:30:44,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1137352248, now seen corresponding path program 5 times [2024-01-26 08:30:44,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 08:30:44,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016732466] [2024-01-26 08:30:44,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 08:30:44,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 08:30:44,823 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-01-26 08:30:44,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1185194990] [2024-01-26 08:30:44,823 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-26 08:30:44,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 08:30:44,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 08:30:44,824 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 08:30:44,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-01-26 08:30:50,662 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-01-26 08:30:50,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 08:30:50,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 16 conjunts are in the unsatisfiable core [2024-01-26 08:30:50,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 08:30:51,185 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 50 proven. 10 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-01-26 08:30:51,185 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 08:30:51,790 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 50 proven. 10 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-01-26 08:30:51,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 08:30:51,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016732466] [2024-01-26 08:30:51,790 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-01-26 08:30:51,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185194990] [2024-01-26 08:30:51,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185194990] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 08:30:51,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-26 08:30:51,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2024-01-26 08:30:51,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674397623] [2024-01-26 08:30:51,791 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-26 08:30:51,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-01-26 08:30:51,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 08:30:51,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-01-26 08:30:51,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=782, Unknown=0, NotChecked=0, Total=992 [2024-01-26 08:30:51,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:30:51,793 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 08:30:51,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 14.21875) internal successors, (455), 32 states have internal predecessors, (455), 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) [2024-01-26 08:30:51,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:30:51,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:30:51,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:30:51,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-01-26 08:30:51,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:30:51,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 08:30:51,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:30:51,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-01-26 08:30:51,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-01-26 08:30:51,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2024-01-26 08:30:51,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-01-26 08:30:51,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:30:52,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:30:52,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:30:52,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:30:52,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-01-26 08:30:52,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:30:52,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 08:30:52,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:30:52,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-01-26 08:30:52,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-01-26 08:30:52,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-01-26 08:30:52,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-01-26 08:30:52,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-01-26 08:30:52,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-01-26 08:30:53,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-01-26 08:30:53,127 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 08:30:53,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 08:30:53,127 INFO L85 PathProgramCache]: Analyzing trace with hash 546759388, now seen corresponding path program 6 times [2024-01-26 08:30:53,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 08:30:53,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587924310] [2024-01-26 08:30:53,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 08:30:53,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 08:30:53,154 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-01-26 08:30:53,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [147398916] [2024-01-26 08:30:53,154 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-01-26 08:30:53,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 08:30:53,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 08:30:53,155 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 08:30:53,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-01-26 08:30:56,676 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2024-01-26 08:30:56,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 08:30:56,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 21 conjunts are in the unsatisfiable core [2024-01-26 08:30:56,686 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 08:30:57,782 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 11 proven. 75 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-01-26 08:30:57,782 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 08:30:59,391 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 45 proven. 41 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-01-26 08:30:59,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 08:30:59,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587924310] [2024-01-26 08:30:59,391 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-01-26 08:30:59,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147398916] [2024-01-26 08:30:59,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147398916] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 08:30:59,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-26 08:30:59,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2024-01-26 08:30:59,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469758523] [2024-01-26 08:30:59,392 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-26 08:30:59,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-01-26 08:30:59,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 08:30:59,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-01-26 08:30:59,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1330, Unknown=0, NotChecked=0, Total=1640 [2024-01-26 08:30:59,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:30:59,395 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 08:30:59,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 11.78048780487805) internal successors, (483), 41 states have internal predecessors, (483), 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) [2024-01-26 08:30:59,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:30:59,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:30:59,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:30:59,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-01-26 08:30:59,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:30:59,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 08:30:59,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:30:59,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-01-26 08:30:59,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-01-26 08:30:59,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2024-01-26 08:30:59,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-01-26 08:30:59,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-01-26 08:30:59,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:31:03,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:31:03,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:31:03,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:31:03,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-01-26 08:31:03,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:31:03,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 08:31:03,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:31:03,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-01-26 08:31:03,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-01-26 08:31:03,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-01-26 08:31:03,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-01-26 08:31:03,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-01-26 08:31:03,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-01-26 08:31:03,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-01-26 08:31:03,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 08:31:03,245 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 08:31:03,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 08:31:03,246 INFO L85 PathProgramCache]: Analyzing trace with hash -392471530, now seen corresponding path program 7 times [2024-01-26 08:31:03,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 08:31:03,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308055691] [2024-01-26 08:31:03,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 08:31:03,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 08:31:03,279 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-01-26 08:31:03,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1466939336] [2024-01-26 08:31:03,279 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-01-26 08:31:03,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 08:31:03,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 08:31:03,293 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 08:31:03,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-01-26 08:31:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 08:31:03,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-26 08:31:03,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 08:31:03,884 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 30 proven. 70 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-01-26 08:31:03,884 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 08:31:04,154 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 1 proven. 99 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-01-26 08:31:04,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 08:31:04,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308055691] [2024-01-26 08:31:04,155 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-01-26 08:31:04,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466939336] [2024-01-26 08:31:04,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466939336] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 08:31:04,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-26 08:31:04,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2024-01-26 08:31:04,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804751356] [2024-01-26 08:31:04,155 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-26 08:31:04,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-01-26 08:31:04,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 08:31:04,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-01-26 08:31:04,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-01-26 08:31:04,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:31:04,157 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 08:31:04,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 27.333333333333332) internal successors, (328), 12 states have internal predecessors, (328), 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) [2024-01-26 08:31:04,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:31:04,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:31:04,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:31:04,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-01-26 08:31:04,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:31:04,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 08:31:04,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:31:04,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-01-26 08:31:04,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-01-26 08:31:04,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2024-01-26 08:31:04,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-01-26 08:31:04,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-01-26 08:31:04,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-01-26 08:31:04,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:31:04,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 08:31:04,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:31:04,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:31:04,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-01-26 08:31:04,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 08:31:04,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 08:31:04,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 08:31:04,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-01-26 08:31:04,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-01-26 08:31:04,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-01-26 08:31:04,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-01-26 08:31:04,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-01-26 08:31:04,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-01-26 08:31:04,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-01-26 08:31:04,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-01-26 08:31:05,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 08:31:05,188 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 08:31:05,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 08:31:05,189 INFO L85 PathProgramCache]: Analyzing trace with hash 95298580, now seen corresponding path program 8 times [2024-01-26 08:31:05,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 08:31:05,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868255798] [2024-01-26 08:31:05,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 08:31:05,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 08:31:05,215 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-01-26 08:31:05,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2121561520] [2024-01-26 08:31:05,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-26 08:31:05,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 08:31:05,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 08:31:05,216 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 08:31:05,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-01-26 08:31:09,221 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-26 08:31:09,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 08:31:09,237 INFO L262 TraceCheckSpWp]: Trace formula consists of 1000 conjuncts, 298 conjunts are in the unsatisfiable core [2024-01-26 08:31:09,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 08:31:09,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-01-26 08:31:09,278 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-01-26 08:31:09,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-01-26 08:31:10,019 INFO L349 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2024-01-26 08:31:10,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2024-01-26 08:31:11,826 INFO L349 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2024-01-26 08:31:11,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 50 [2024-01-26 08:31:14,511 INFO L349 Elim1Store]: treesize reduction 70, result has 28.6 percent of original size [2024-01-26 08:31:14,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 58 [2024-01-26 08:31:16,228 INFO L349 Elim1Store]: treesize reduction 80, result has 36.0 percent of original size [2024-01-26 08:31:16,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 45 treesize of output 78 [2024-01-26 08:31:20,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-01-26 08:31:20,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-01-26 08:31:23,877 INFO L349 Elim1Store]: treesize reduction 16, result has 78.1 percent of original size [2024-01-26 08:31:23,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 56 treesize of output 96 [2024-01-26 08:31:25,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 53 [2024-01-26 08:31:25,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-01-26 08:31:26,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-01-26 08:31:26,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 53 [2024-01-26 08:31:28,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-01-26 08:31:28,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 53 [2024-01-26 08:31:29,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 75 [2024-01-26 08:31:29,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-01-26 08:31:30,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-26 08:31:30,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-01-26 08:31:30,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-26 08:31:30,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 50 [2024-01-26 08:31:31,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2024-01-26 08:31:31,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-01-26 08:31:31,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 50 [2024-01-26 08:31:32,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 50 [2024-01-26 08:31:32,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 34 [2024-01-26 08:31:32,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-01-26 08:31:35,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 55 [2024-01-26 08:31:35,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 08:31:35,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 53 [2024-01-26 08:31:35,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-01-26 08:31:38,192 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-01-26 08:31:38,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 95 [2024-01-26 08:31:38,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2024-01-26 08:31:38,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 08:31:38,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 67 [2024-01-26 08:31:39,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-01-26 08:31:39,178 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 08:31:39,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 15 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 86 [2024-01-26 08:31:39,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 76 [2024-01-26 08:31:43,179 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-01-26 08:31:43,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 121 [2024-01-26 08:31:43,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2024-01-26 08:31:43,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 08:31:43,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 15 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 100 [2024-01-26 08:31:47,326 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-01-26 08:31:47,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 134 [2024-01-26 08:31:47,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2024-01-26 08:31:47,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 08:31:47,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 16 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 6 case distinctions, treesize of input 108 treesize of output 114 [2024-01-26 08:31:50,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 08:31:50,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 16 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 128 [2024-01-26 08:31:50,678 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-01-26 08:31:50,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 147 [2024-01-26 08:31:50,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2024-01-26 08:31:58,320 INFO L349 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2024-01-26 08:31:58,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 13 [2024-01-26 08:31:58,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 08:31:58,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 151 treesize of output 109 [2024-01-26 08:31:59,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-26 08:31:59,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-26 08:32:08,697 WARN L293 SmtUtils]: Spent 9.21s on a formula simplification. DAG size of input: 650 DAG size of output: 588 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-01-26 08:32:08,698 INFO L349 Elim1Store]: treesize reduction 272, result has 90.7 percent of original size [2024-01-26 08:32:08,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 25 select indices, 25 select index equivalence classes, 8 disjoint index pairs (out of 300 index pairs), introduced 25 new quantified variables, introduced 300 case distinctions, treesize of input 305 treesize of output 2781 [2024-01-26 08:34:11,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2024-01-26 08:34:11,558 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-01-26 08:34:11,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 08:34:11,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868255798] [2024-01-26 08:34:11,558 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-01-26 08:34:11,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121561520] [2024-01-26 08:34:11,558 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-01-26 08:34:11,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-01-26 08:34:11,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-01-26 08:34:11,759 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/UGemCutter-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.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: 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) ... 66 more [2024-01-26 08:34:11,763 INFO L158 Benchmark]: Toolchain (without parser) took 387440.50ms. Allocated memory was 228.6MB in the beginning and 958.4MB in the end (delta: 729.8MB). Free memory was 162.2MB in the beginning and 625.5MB in the end (delta: -463.4MB). Peak memory consumption was 598.4MB. Max. memory is 8.0GB. [2024-01-26 08:34:11,763 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 228.6MB. Free memory is still 178.7MB. There was no memory consumed. Max. memory is 8.0GB. [2024-01-26 08:34:11,763 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.47ms. Allocated memory is still 228.6MB. Free memory was 162.0MB in the beginning and 149.6MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-01-26 08:34:11,763 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.96ms. Allocated memory was 228.6MB in the beginning and 294.6MB in the end (delta: 66.1MB). Free memory was 149.4MB in the beginning and 259.9MB in the end (delta: -110.5MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2024-01-26 08:34:11,763 INFO L158 Benchmark]: Boogie Preprocessor took 38.05ms. Allocated memory is still 294.6MB. Free memory was 259.9MB in the beginning and 257.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-26 08:34:11,763 INFO L158 Benchmark]: RCFGBuilder took 485.87ms. Allocated memory is still 294.6MB. Free memory was 257.8MB in the beginning and 234.2MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2024-01-26 08:34:11,764 INFO L158 Benchmark]: TraceAbstraction took 386553.63ms. Allocated memory was 294.6MB in the beginning and 958.4MB in the end (delta: 663.7MB). Free memory was 233.1MB in the beginning and 625.5MB in the end (delta: -392.4MB). Peak memory consumption was 602.6MB. Max. memory is 8.0GB. [2024-01-26 08:34:11,764 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.39ms. Allocated memory is still 228.6MB. Free memory is still 178.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 279.47ms. Allocated memory is still 228.6MB. Free memory was 162.0MB in the beginning and 149.6MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 67.96ms. Allocated memory was 228.6MB in the beginning and 294.6MB in the end (delta: 66.1MB). Free memory was 149.4MB in the beginning and 259.9MB in the end (delta: -110.5MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.05ms. Allocated memory is still 294.6MB. Free memory was 259.9MB in the beginning and 257.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 485.87ms. Allocated memory is still 294.6MB. Free memory was 257.8MB in the beginning and 234.2MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 386553.63ms. Allocated memory was 294.6MB in the beginning and 958.4MB in the end (delta: 663.7MB). Free memory was 233.1MB in the beginning and 625.5MB in the end (delta: -392.4MB). Peak memory consumption was 602.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-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/UGemCutter-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. [2024-01-26 08:34:11,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 Received shutdown request...