/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking FORWARD --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-07 02:16:51,553 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-07 02:16:51,605 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-07 02:16:51,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-07 02:16:51,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-07 02:16:51,627 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-07 02:16:51,628 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-07 02:16:51,628 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-07 02:16:51,629 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-07 02:16:51,629 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-07 02:16:51,630 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-07 02:16:51,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-07 02:16:51,630 INFO L153 SettingsManager]: * Use SBE=true [2024-05-07 02:16:51,631 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-07 02:16:51,631 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-07 02:16:51,631 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-07 02:16:51,632 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-07 02:16:51,632 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-07 02:16:51,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-07 02:16:51,633 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-07 02:16:51,633 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-07 02:16:51,633 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-07 02:16:51,634 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-07 02:16:51,634 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-07 02:16:51,634 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-07 02:16:51,635 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-07 02:16:51,635 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-07 02:16:51,635 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-07 02:16:51,635 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-07 02:16:51,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 02:16:51,636 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-07 02:16:51,636 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-07 02:16:51,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-07 02:16:51,637 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-07 02:16:51,637 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-07 02:16:51,638 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-07 02:16:51,638 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-07 02:16:51,638 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-07 02:16:51,639 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-07 02:16:51,639 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: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> FORWARD Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-05-07 02:16:51,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-07 02:16:51,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-07 02:16:51,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-07 02:16:51,942 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-07 02:16:51,943 INFO L274 PluginConnector]: CDTParser initialized [2024-05-07 02:16:51,944 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-05-07 02:16:53,109 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-07 02:16:53,299 INFO L384 CDTParser]: Found 1 translation units. [2024-05-07 02:16:53,300 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c [2024-05-07 02:16:53,307 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/7a43ee6d0/a4bd128b24de4f80b2b84f69493f9712/FLAG38a7adcc6 [2024-05-07 02:16:53,325 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/7a43ee6d0/a4bd128b24de4f80b2b84f69493f9712 [2024-05-07 02:16:53,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-07 02:16:53,329 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-07 02:16:53,332 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-07 02:16:53,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-07 02:16:53,337 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-07 02:16:53,337 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 02:16:53" (1/1) ... [2024-05-07 02:16:53,338 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52137bf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:16:53, skipping insertion in model container [2024-05-07 02:16:53,338 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 02:16:53" (1/1) ... [2024-05-07 02:16:53,361 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-07 02:16:53,500 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c[2618,2631] [2024-05-07 02:16:53,507 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 02:16:53,516 INFO L202 MainTranslator]: Completed pre-run [2024-05-07 02:16:53,535 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c[2618,2631] [2024-05-07 02:16:53,538 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 02:16:53,550 INFO L206 MainTranslator]: Completed translation [2024-05-07 02:16:53,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:16:53 WrapperNode [2024-05-07 02:16:53,550 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-07 02:16:53,551 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-07 02:16:53,552 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-07 02:16:53,552 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-07 02:16:53,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:16:53" (1/1) ... [2024-05-07 02:16:53,566 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:16:53" (1/1) ... [2024-05-07 02:16:53,589 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 196 [2024-05-07 02:16:53,589 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-07 02:16:53,590 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-07 02:16:53,590 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-07 02:16:53,590 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-07 02:16:53,598 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:16:53" (1/1) ... [2024-05-07 02:16:53,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:16:53" (1/1) ... [2024-05-07 02:16:53,601 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:16:53" (1/1) ... [2024-05-07 02:16:53,601 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:16:53" (1/1) ... [2024-05-07 02:16:53,609 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:16:53" (1/1) ... [2024-05-07 02:16:53,621 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:16:53" (1/1) ... [2024-05-07 02:16:53,623 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:16:53" (1/1) ... [2024-05-07 02:16:53,633 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:16:53" (1/1) ... [2024-05-07 02:16:53,636 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-07 02:16:53,637 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-07 02:16:53,637 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-07 02:16:53,638 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-07 02:16:53,638 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:16:53" (1/1) ... [2024-05-07 02:16:53,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 02:16:53,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 02:16:53,670 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-05-07 02:16:53,672 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-05-07 02:16:53,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-07 02:16:53,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-05-07 02:16:53,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-07 02:16:53,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-07 02:16:53,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-07 02:16:53,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-05-07 02:16:53,709 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-07 02:16:53,709 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-07 02:16:53,709 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-07 02:16:53,709 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-07 02:16:53,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-07 02:16:53,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-07 02:16:53,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-07 02:16:53,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-07 02:16:53,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-07 02:16:53,712 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-07 02:16:53,814 INFO L241 CfgBuilder]: Building ICFG [2024-05-07 02:16:53,816 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-07 02:16:54,202 INFO L282 CfgBuilder]: Performing block encoding [2024-05-07 02:16:54,222 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-07 02:16:54,223 INFO L309 CfgBuilder]: Removed 7 assume(true) statements. [2024-05-07 02:16:54,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 02:16:54 BoogieIcfgContainer [2024-05-07 02:16:54,224 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-07 02:16:54,227 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-07 02:16:54,227 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-07 02:16:54,230 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-07 02:16:54,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.05 02:16:53" (1/3) ... [2024-05-07 02:16:54,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646dfe3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 02:16:54, skipping insertion in model container [2024-05-07 02:16:54,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:16:53" (2/3) ... [2024-05-07 02:16:54,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646dfe3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 02:16:54, skipping insertion in model container [2024-05-07 02:16:54,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 02:16:54" (3/3) ... [2024-05-07 02:16:54,232 INFO L112 eAbstractionObserver]: Analyzing ICFG loop-tiling-eq.wvr.c [2024-05-07 02:16:54,239 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-07 02:16:54,249 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-07 02:16:54,249 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-07 02:16:54,249 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-07 02:16:54,328 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-07 02:16:54,392 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 02:16:54,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 02:16:54,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 02:16:54,394 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-05-07 02:16:54,396 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-05-07 02:16:54,429 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 02:16:54,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 02:16:54,443 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 02:16:54,450 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;@6fb543f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 02:16:54,450 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-05-07 02:16:55,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2024-05-07 02:16:56,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1394787570, now seen corresponding path program 1 times [2024-05-07 02:16:56,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:16:56,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:16:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:16:56,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:16:56,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:16:56,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:16:56,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 441 treesize of output 417 [2024-05-07 02:16:59,711 INFO L85 PathProgramCache]: Analyzing trace with hash 288742404, now seen corresponding path program 2 times [2024-05-07 02:16:59,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:16:59,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:16:59,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:16:59,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:16:59,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:16:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:16:59,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2024-05-07 02:17:00,129 INFO L85 PathProgramCache]: Analyzing trace with hash -452701193, now seen corresponding path program 1 times [2024-05-07 02:17:00,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:17:00,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:17:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:17:00,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:17:00,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:17:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:17:00,237 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 02:17:00,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 02:17:00,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1610377654, now seen corresponding path program 1 times [2024-05-07 02:17:00,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 02:17:00,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259370098] [2024-05-07 02:17:00,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:17:00,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:17:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:17:00,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 02:17:00,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259370098] [2024-05-07 02:17:00,283 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2024-05-07 02:17:00,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712841349] [2024-05-07 02:17:00,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:17:00,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 02:17:00,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 02:17:00,321 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-05-07 02:17:00,340 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-05-07 02:17:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:17:00,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 1 conjunts are in the unsatisfiable core [2024-05-07 02:17:00,494 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 02:17:00,510 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-05-07 02:17:00,511 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-07 02:17:00,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712841349] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 02:17:00,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 02:17:00,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 02:17:00,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015891984] [2024-05-07 02:17:00,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 02:17:00,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 02:17:00,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 02:17:00,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 02:17:00,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 02:17:00,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:17:00,542 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 02:17:00,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 100.5) internal successors, (201), 2 states have internal predecessors, (201), 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-05-07 02:17:00,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:17:00,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2024-05-07 02:17:00,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1705702078, now seen corresponding path program 1 times [2024-05-07 02:17:00,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:17:00,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:17:01,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1802 treesize of output 1706 [2024-05-07 02:17:04,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1337156172, now seen corresponding path program 2 times [2024-05-07 02:17:04,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:17:04,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:17:04,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2024-05-07 02:17:04,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1409066055, now seen corresponding path program 1 times [2024-05-07 02:17:04,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:17:04,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:17:04,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:17:04,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-07 02:17:05,059 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,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable9 [2024-05-07 02:17:05,060 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 02:17:05,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 02:17:05,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1426262776, now seen corresponding path program 1 times [2024-05-07 02:17:05,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 02:17:05,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005115708] [2024-05-07 02:17:05,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:17:05,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:17:05,080 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-07 02:17:05,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1257745040] [2024-05-07 02:17:05,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:17:05,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 02:17:05,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 02:17:05,082 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-05-07 02:17:05,101 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-05-07 02:17:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:17:05,239 INFO L262 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-07 02:17:05,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 02:17:05,416 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-05-07 02:17:05,416 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-07 02:17:05,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 02:17:05,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005115708] [2024-05-07 02:17:05,417 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-07 02:17:05,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257745040] [2024-05-07 02:17:05,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257745040] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 02:17:05,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 02:17:05,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-07 02:17:05,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124593292] [2024-05-07 02:17:05,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 02:17:05,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-07 02:17:05,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 02:17:05,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 02:17:05,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-05-07 02:17:05,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:17:05,426 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 02:17:05,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.428571428571427) internal successors, (192), 7 states have internal predecessors, (192), 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-05-07 02:17:05,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:17:05,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:17:05,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2024-05-07 02:17:05,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1884943958, now seen corresponding path program 1 times [2024-05-07 02:17:05,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:17:05,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:17:05,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 441 treesize of output 417 [2024-05-07 02:17:08,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1696280140, now seen corresponding path program 2 times [2024-05-07 02:17:08,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:17:08,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:17:08,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2024-05-07 02:17:09,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1326562129, now seen corresponding path program 1 times [2024-05-07 02:17:09,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:17:09,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:17:09,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:17:09,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:17:09,940 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-05-07 02:17:10,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13 [2024-05-07 02:17:10,140 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 02:17:10,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 02:17:10,140 INFO L85 PathProgramCache]: Analyzing trace with hash -590941296, now seen corresponding path program 1 times [2024-05-07 02:17:10,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 02:17:10,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725307400] [2024-05-07 02:17:10,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:17:10,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:17:10,161 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-07 02:17:10,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1846242439] [2024-05-07 02:17:10,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:17:10,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 02:17:10,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 02:17:10,164 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-05-07 02:17:10,167 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-05-07 02:17:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:17:10,331 INFO L262 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 4 conjunts are in the unsatisfiable core [2024-05-07 02:17:10,334 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 02:17:10,395 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-05-07 02:17:10,395 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-07 02:17:10,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 02:17:10,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725307400] [2024-05-07 02:17:10,395 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-07 02:17:10,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846242439] [2024-05-07 02:17:10,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846242439] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 02:17:10,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 02:17:10,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-07 02:17:10,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112785895] [2024-05-07 02:17:10,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 02:17:10,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-07 02:17:10,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 02:17:10,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 02:17:10,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-07 02:17:10,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:17:10,398 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 02:17:10,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 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-05-07 02:17:10,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:17:10,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:17:10,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:17:10,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2024-05-07 02:17:10,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1675423378, now seen corresponding path program 1 times [2024-05-07 02:17:10,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:17:10,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:17:10,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 888 treesize of output 840 [2024-05-07 02:17:13,776 INFO L85 PathProgramCache]: Analyzing trace with hash -398516472, now seen corresponding path program 2 times [2024-05-07 02:17:13,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:17:13,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:17:13,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2024-05-07 02:17:13,926 INFO L85 PathProgramCache]: Analyzing trace with hash 459916915, now seen corresponding path program 1 times [2024-05-07 02:17:13,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:17:13,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:17:13,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:17:13,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:17:13,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 02:17:13,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-05-07 02:17:14,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-05-07 02:17:14,165 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 02:17:14,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 02:17:14,166 INFO L85 PathProgramCache]: Analyzing trace with hash -65961908, now seen corresponding path program 1 times [2024-05-07 02:17:14,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 02:17:14,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059334263] [2024-05-07 02:17:14,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:17:14,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:17:14,186 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-07 02:17:14,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [287517454] [2024-05-07 02:17:14,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:17:14,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 02:17:14,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 02:17:14,188 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-05-07 02:17:14,212 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-05-07 02:17:14,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:17:14,404 INFO L262 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 10 conjunts are in the unsatisfiable core [2024-05-07 02:17:14,407 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 02:17:14,702 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-07 02:17:14,702 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 02:17:15,069 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-07 02:17:15,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 02:17:15,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059334263] [2024-05-07 02:17:15,070 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-07 02:17:15,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287517454] [2024-05-07 02:17:15,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287517454] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-07 02:17:15,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-05-07 02:17:15,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2024-05-07 02:17:15,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376669329] [2024-05-07 02:17:15,071 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-05-07 02:17:15,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-05-07 02:17:15,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 02:17:15,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-05-07 02:17:15,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2024-05-07 02:17:15,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:17:15,073 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 02:17:15,073 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-05-07 02:17:15,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:17:15,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:17:15,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-07 02:17:15,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:17:15,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2024-05-07 02:17:15,642 INFO L85 PathProgramCache]: Analyzing trace with hash -657679402, now seen corresponding path program 3 times [2024-05-07 02:17:15,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:17:15,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:17:15,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 441 treesize of output 417 [2024-05-07 02:17:18,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1086775712, now seen corresponding path program 4 times [2024-05-07 02:17:18,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:17:18,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:17:18,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2024-05-07 02:17:18,831 INFO L85 PathProgramCache]: Analyzing trace with hash 693040347, now seen corresponding path program 2 times [2024-05-07 02:17:18,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:17:18,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:17:18,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:17:18,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:17:18,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 02:17:18,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-07 02:17:18,976 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-05-07 02:17:19,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20,SelfDestructingSolverStorable21 [2024-05-07 02:17:19,155 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 02:17:19,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 02:17:19,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1840211228, now seen corresponding path program 2 times [2024-05-07 02:17:19,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 02:17:19,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127246768] [2024-05-07 02:17:19,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:17:19,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:17:19,193 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-07 02:17:19,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [471015028] [2024-05-07 02:17:19,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-07 02:17:19,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 02:17:19,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 02:17:19,212 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-05-07 02:17:19,224 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-05-07 02:17:19,515 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-07 02:17:19,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-07 02:17:19,518 INFO L262 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-07 02:17:19,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 02:17:19,644 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-05-07 02:17:19,644 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-07 02:17:19,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 02:17:19,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127246768] [2024-05-07 02:17:19,644 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-07 02:17:19,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471015028] [2024-05-07 02:17:19,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471015028] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 02:17:19,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 02:17:19,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-07 02:17:19,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613128221] [2024-05-07 02:17:19,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 02:17:19,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-07 02:17:19,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 02:17:19,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 02:17:19,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-05-07 02:17:19,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:17:19,646 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 02:17:19,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 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-05-07 02:17:19,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:17:19,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:17:19,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-07 02:17:19,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-07 02:17:19,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:17:19,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:17:19,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:17:19,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 02:17:19,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-07 02:17:19,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-07 02:17:19,875 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-05-07 02:17:20,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-05-07 02:17:20,076 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 02:17:20,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 02:17:20,076 INFO L85 PathProgramCache]: Analyzing trace with hash 173938187, now seen corresponding path program 1 times [2024-05-07 02:17:20,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 02:17:20,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112383739] [2024-05-07 02:17:20,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:17:20,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:17:20,104 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-07 02:17:20,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1149516525] [2024-05-07 02:17:20,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:17:20,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 02:17:20,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 02:17:20,106 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-05-07 02:17:20,131 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-05-07 02:17:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:17:20,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-07 02:17:20,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 02:17:20,466 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 14 proven. 22 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-05-07 02:17:20,466 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 02:17:20,631 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-05-07 02:17:20,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 02:17:20,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112383739] [2024-05-07 02:17:20,631 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-07 02:17:20,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149516525] [2024-05-07 02:17:20,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149516525] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-07 02:17:20,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-05-07 02:17:20,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-05-07 02:17:20,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627051484] [2024-05-07 02:17:20,632 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-05-07 02:17:20,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-07 02:17:20,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 02:17:20,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-07 02:17:20,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-05-07 02:17:20,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:17:20,634 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 02:17:20,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 22.53846153846154) internal successors, (293), 13 states have internal predecessors, (293), 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-05-07 02:17:20,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:17:20,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:17:20,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-07 02:17:20,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-07 02:17:20,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-07 02:17:20,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:17:21,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2024-05-07 02:17:21,222 INFO L85 PathProgramCache]: Analyzing trace with hash 250321391, now seen corresponding path program 1 times [2024-05-07 02:17:21,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:17:21,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:17:21,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 908 treesize of output 860 [2024-05-07 02:17:23,885 INFO L85 PathProgramCache]: Analyzing trace with hash -829970777, now seen corresponding path program 2 times [2024-05-07 02:17:23,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:17:23,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:17:23,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2024-05-07 02:17:26,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1840026996, now seen corresponding path program 1 times [2024-05-07 02:17:26,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:17:26,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:17:26,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:17:26,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:17:26,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 02:17:26,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-07 02:17:26,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-07 02:17:26,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-07 02:17:26,136 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-05-07 02:17:26,337 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,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26 [2024-05-07 02:17:26,337 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 02:17:26,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 02:17:26,338 INFO L85 PathProgramCache]: Analyzing trace with hash -771055893, now seen corresponding path program 1 times [2024-05-07 02:17:26,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 02:17:26,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910113231] [2024-05-07 02:17:26,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:17:26,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:17:26,355 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-07 02:17:26,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [681010233] [2024-05-07 02:17:26,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:17:26,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 02:17:26,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 02:17:26,357 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-05-07 02:17:26,370 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-05-07 02:17:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:17:26,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 14 conjunts are in the unsatisfiable core [2024-05-07 02:17:26,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 02:17:26,958 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-05-07 02:17:26,958 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 02:17:27,344 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-05-07 02:17:27,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 02:17:27,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910113231] [2024-05-07 02:17:27,345 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-07 02:17:27,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681010233] [2024-05-07 02:17:27,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681010233] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-07 02:17:27,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-05-07 02:17:27,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2024-05-07 02:17:27,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095511384] [2024-05-07 02:17:27,346 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-05-07 02:17:27,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-05-07 02:17:27,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 02:17:27,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-05-07 02:17:27,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2024-05-07 02:17:27,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:17:27,348 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 02:17:27,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 12.481481481481481) internal successors, (337), 27 states have internal predecessors, (337), 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-05-07 02:17:27,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:17:27,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:17:27,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-07 02:17:27,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-07 02:17:27,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-07 02:17:27,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-05-07 02:17:27,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:17:27,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2024-05-07 02:17:28,161 INFO L85 PathProgramCache]: Analyzing trace with hash 2043963991, now seen corresponding path program 3 times [2024-05-07 02:17:28,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:17:28,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:17:28,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 908 treesize of output 860 [2024-05-07 02:17:31,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1061625025, now seen corresponding path program 4 times [2024-05-07 02:17:31,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:17:31,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:17:31,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2024-05-07 02:17:31,558 INFO L85 PathProgramCache]: Analyzing trace with hash 387451356, now seen corresponding path program 2 times [2024-05-07 02:17:31,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:17:31,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:17:31,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:17:31,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:17:31,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 02:17:31,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-07 02:17:31,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-07 02:17:31,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-07 02:17:31,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-07 02:17:31,599 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-05-07 02:17:31,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,SelfDestructingSolverStorable30,SelfDestructingSolverStorable27,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-05-07 02:17:31,790 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 02:17:31,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 02:17:31,791 INFO L85 PathProgramCache]: Analyzing trace with hash 2134717315, now seen corresponding path program 2 times [2024-05-07 02:17:31,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 02:17:31,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021454176] [2024-05-07 02:17:31,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:17:31,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:17:31,813 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-07 02:17:31,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [498791569] [2024-05-07 02:17:31,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-07 02:17:31,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 02:17:31,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 02:17:31,814 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-05-07 02:17:31,815 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-05-07 02:17:32,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-07 02:17:32,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-07 02:17:32,549 INFO L262 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 128 conjunts are in the unsatisfiable core [2024-05-07 02:17:32,556 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 02:17:32,716 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-05-07 02:17:33,017 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-05-07 02:17:33,018 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 17 treesize of output 21 [2024-05-07 02:17:33,514 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-05-07 02:17:33,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2024-05-07 02:17:34,114 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-05-07 02:17:34,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2024-05-07 02:17:34,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 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-05-07 02:17:34,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 02:17:34,948 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 33 treesize of output 24 [2024-05-07 02:17:35,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 02:17:35,148 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 33 treesize of output 24 [2024-05-07 02:17:35,403 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-05-07 02:17:35,411 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 33 treesize of output 24 [2024-05-07 02:17:35,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 18 [2024-05-07 02:17:35,860 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 33 treesize of output 24 [2024-05-07 02:17:36,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 21 [2024-05-07 02:17:36,436 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 40 treesize of output 29 [2024-05-07 02:17:36,460 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 16 treesize of output 11 [2024-05-07 02:17:37,156 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-05-07 02:17:37,156 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 84 treesize of output 73 [2024-05-07 02:17:37,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2024-05-07 02:17:37,172 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 36 treesize of output 23 [2024-05-07 02:17:39,103 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 51 treesize of output 31 [2024-05-07 02:17:39,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 [2024-05-07 02:17:39,218 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 0 case distinctions, treesize of input 37 treesize of output 13 [2024-05-07 02:17:39,358 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-05-07 02:17:39,359 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 02:17:48,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 02:17:48,012 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 1706 treesize of output 1570 [2024-05-07 02:17:48,024 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 381 treesize of output 375 [2024-05-07 02:17:48,035 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 386 treesize of output 374 [2024-05-07 02:17:51,346 WARN L876 $PredicateComparison]: unable to prove that (or (< (+ c_thread2Thread1of1ForFork1_~j~0 1) c_~M~0) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (let ((.cse4 (* c_thread2Thread1of1ForFork1_~j~0 4)) (.cse14 (= c_~B~0.base c_~A~0.base)) (.cse32 (= .cse2 c_~B~0.base))) (let ((.cse8 (not .cse32)) (.cse25 (not .cse14)) (.cse5 (select (select |c_#memory_int| c_~F~0.base) (+ .cse4 (* (* c_thread2Thread1of1ForFork1_~i~1 c_~M~0) 4) c_~F~0.offset))) (.cse6 (select |c_#memory_int| c_~A~0.base)) (.cse7 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4)))) (and (or (forall ((~a~0 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_arrayElimCell_52 Int) (|thread1Thread1of1ForFork0_#t~mem2| Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_arrayElimCell_54 Int)) (or (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (let ((.cse0 (let ((.cse3 (store |c_#memory_int| c_~A~0.base (store .cse6 .cse7 |thread1Thread1of1ForFork0_#t~mem2|)))) (store .cse3 .cse2 (store (select .cse3 .cse2) (+ .cse4 v_arrayElimCell_52) .cse5)))) (.cse1 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (= (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1 (* (* ~a~0 c_~M~0) 4))) (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse2 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse1 v_arrayElimCell_54)))))) .cse8) (forall ((|ULTIMATE.start_main_#t~nondet21#1| Int)) (or (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (forall ((~a~0 Int)) (or (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (forall ((v_arrayElimCell_52 Int) (|thread1Thread1of1ForFork0_#t~mem2| Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_arrayElimCell_54 Int)) (let ((.cse12 (let ((.cse13 (store |c_#memory_int| c_~A~0.base (store .cse6 .cse7 |thread1Thread1of1ForFork0_#t~mem2|)))) (store .cse13 .cse2 (store (select .cse13 .cse2) (+ .cse4 v_arrayElimCell_52) .cse5)))) (.cse11 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (let ((.cse9 (select (select .cse12 c_~A~0.base) (+ c_~A~0.offset .cse11 (* (* ~a~0 c_~M~0) 4)))) (.cse10 (select .cse12 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse2 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (forall ((v_arrayElimCell_53 Int)) (= .cse9 (select .cse10 (+ .cse11 v_arrayElimCell_53)))) (= .cse9 (select .cse10 (+ .cse11 v_arrayElimCell_52))) (= .cse9 (select .cse10 (+ .cse11 v_arrayElimCell_54))))))))))) (or .cse14 (forall ((~a~0 Int) (v_arrayElimCell_52 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (|thread1Thread1of1ForFork0_#t~mem2| Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_arrayElimCell_54 Int)) (let ((.cse18 (let ((.cse19 (store |c_#memory_int| c_~A~0.base (store .cse6 .cse7 |thread1Thread1of1ForFork0_#t~mem2|)))) (store .cse19 .cse2 (store (select .cse19 .cse2) (+ .cse4 v_arrayElimCell_52) .cse5)))) (.cse17 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (let ((.cse15 (select (select .cse18 c_~A~0.base) (+ c_~A~0.offset .cse17 (* (* ~a~0 c_~M~0) 4)))) (.cse16 (select .cse18 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse2 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (= .cse15 (select .cse16 (+ .cse17 v_arrayElimCell_52))) (= .cse15 (select .cse16 (+ .cse17 v_arrayElimCell_54)))))))) (or (and (forall ((|ULTIMATE.start_main_#t~nondet21#1| Int)) (or (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_51 Int) (|thread1Thread1of1ForFork0_#t~mem2| Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int))) (let ((.cse23 (let ((.cse24 (store |c_#memory_int| c_~A~0.base (store .cse6 .cse7 |thread1Thread1of1ForFork0_#t~mem2|)))) (store .cse24 .cse2 (store (select .cse24 .cse2) (+ .cse4 v_arrayElimCell_51) .cse5)))) (.cse21 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (let ((.cse22 (select (select .cse23 c_~A~0.base) (+ c_~A~0.offset .cse21 (* (* ~a~0 c_~M~0) 4)))) (.cse20 (select .cse23 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse2 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (forall ((v_arrayElimCell_53 Int)) (= (select .cse20 (+ .cse21 v_arrayElimCell_53)) .cse22)) (= .cse22 (select .cse20 (+ .cse21 v_arrayElimCell_52))))))) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)))) (or .cse25 (forall ((~a~0 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_arrayElimCell_51 Int) (|thread1Thread1of1ForFork0_#t~mem2| Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_arrayElimCell_53 Int)) (or (let ((.cse26 (let ((.cse28 (store |c_#memory_int| c_~A~0.base (store .cse6 .cse7 |thread1Thread1of1ForFork0_#t~mem2|)))) (store .cse28 .cse2 (store (select .cse28 .cse2) (+ .cse4 v_arrayElimCell_51) .cse5)))) (.cse27 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (= (select (select .cse26 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse2 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse27 v_arrayElimCell_53)) (select (select .cse26 c_~A~0.base) (+ c_~A~0.offset .cse27 (* (* ~a~0 c_~M~0) 4))))) (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0)))) (or .cse14 (forall ((~a~0 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_arrayElimCell_52 Int) (v_arrayElimCell_51 Int) (|thread1Thread1of1ForFork0_#t~mem2| Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int))) (or (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (let ((.cse29 (let ((.cse31 (store |c_#memory_int| c_~A~0.base (store .cse6 .cse7 |thread1Thread1of1ForFork0_#t~mem2|)))) (store .cse31 .cse2 (store (select .cse31 .cse2) (+ .cse4 v_arrayElimCell_51) .cse5)))) (.cse30 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (= (select (select .cse29 c_~A~0.base) (+ c_~A~0.offset .cse30 (* (* ~a~0 c_~M~0) 4))) (select (select .cse29 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse2 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse30 v_arrayElimCell_52)))) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))))) .cse32) (or (and (forall ((|ULTIMATE.start_main_#t~nondet21#1| Int)) (or (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (forall ((~a~0 Int)) (or (forall ((v_arrayElimCell_52 Int) (|thread1Thread1of1ForFork0_#t~mem2| Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int))) (let ((.cse36 (let ((.cse37 (store |c_#memory_int| c_~A~0.base (store .cse6 .cse7 |thread1Thread1of1ForFork0_#t~mem2|)))) (store .cse37 .cse2 (store (select .cse37 .cse2) (+ .cse4 v_arrayElimCell_52) .cse5)))) (.cse35 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (let ((.cse33 (select (select .cse36 c_~A~0.base) (+ c_~A~0.offset .cse35 (* (* ~a~0 c_~M~0) 4)))) (.cse34 (select .cse36 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse2 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (forall ((v_arrayElimCell_53 Int)) (= .cse33 (select .cse34 (+ .cse35 v_arrayElimCell_53)))) (= .cse33 (select .cse34 (+ .cse35 v_arrayElimCell_52))))))) (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0))))) (or (forall ((~a~0 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_arrayElimCell_52 Int) (|thread1Thread1of1ForFork0_#t~mem2| Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_arrayElimCell_53 Int)) (or (< ~a~0 0) (let ((.cse38 (let ((.cse40 (store |c_#memory_int| c_~A~0.base (store .cse6 .cse7 |thread1Thread1of1ForFork0_#t~mem2|)))) (store .cse40 .cse2 (store (select .cse40 .cse2) (+ .cse4 v_arrayElimCell_52) .cse5)))) (.cse39 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (= (select (select .cse38 c_~A~0.base) (+ c_~A~0.offset .cse39 (* (* ~a~0 c_~M~0) 4))) (select (select .cse38 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse2 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse39 v_arrayElimCell_53)))) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)))) .cse25) (or .cse14 (forall ((~a~0 Int) (v_arrayElimCell_52 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (|thread1Thread1of1ForFork0_#t~mem2| Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int))) (or (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (let ((.cse41 (let ((.cse43 (store |c_#memory_int| c_~A~0.base (store .cse6 .cse7 |thread1Thread1of1ForFork0_#t~mem2|)))) (store .cse43 .cse2 (store (select .cse43 .cse2) (+ .cse4 v_arrayElimCell_52) .cse5)))) (.cse42 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (= (select (select .cse41 c_~A~0.base) (+ c_~A~0.offset .cse42 (* (* ~a~0 c_~M~0) 4))) (select (select .cse41 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse2 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse42 v_arrayElimCell_52)))))))) .cse32) (or .cse8 (forall ((~a~0 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_arrayElimCell_51 Int) (|thread1Thread1of1ForFork0_#t~mem2| Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_arrayElimCell_54 Int)) (or (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (let ((.cse44 (let ((.cse46 (store |c_#memory_int| c_~A~0.base (store .cse6 .cse7 |thread1Thread1of1ForFork0_#t~mem2|)))) (store .cse46 .cse2 (store (select .cse46 .cse2) (+ .cse4 v_arrayElimCell_51) .cse5)))) (.cse45 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (= (select (select .cse44 c_~A~0.base) (+ c_~A~0.offset .cse45 (* (* ~a~0 c_~M~0) 4))) (select (select .cse44 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse2 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse45 v_arrayElimCell_54)))) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0)))) (or (forall ((~a~0 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_arrayElimCell_52 Int) (|thread1Thread1of1ForFork0_#t~mem2| Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_arrayElimCell_54 Int) (v_arrayElimCell_53 Int)) (let ((.cse50 (let ((.cse51 (store |c_#memory_int| c_~A~0.base (store .cse6 .cse7 |thread1Thread1of1ForFork0_#t~mem2|)))) (store .cse51 .cse2 (store (select .cse51 .cse2) (+ .cse4 v_arrayElimCell_52) .cse5)))) (.cse49 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (let ((.cse47 (select (select .cse50 c_~A~0.base) (+ c_~A~0.offset .cse49 (* (* ~a~0 c_~M~0) 4)))) (.cse48 (select .cse50 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse2 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (< ~a~0 0) (= .cse47 (select .cse48 (+ .cse49 v_arrayElimCell_53))) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (= .cse47 (select .cse48 (+ .cse49 v_arrayElimCell_54))))))) .cse25) (or .cse25 (forall ((~a~0 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_arrayElimCell_51 Int) (|thread1Thread1of1ForFork0_#t~mem2| Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_arrayElimCell_54 Int) (v_arrayElimCell_53 Int)) (let ((.cse55 (let ((.cse56 (store |c_#memory_int| c_~A~0.base (store .cse6 .cse7 |thread1Thread1of1ForFork0_#t~mem2|)))) (store .cse56 .cse2 (store (select .cse56 .cse2) (+ .cse4 v_arrayElimCell_51) .cse5)))) (.cse53 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (let ((.cse54 (select (select .cse55 c_~A~0.base) (+ c_~A~0.offset .cse53 (* (* ~a~0 c_~M~0) 4)))) (.cse52 (select .cse55 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse2 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= (select .cse52 (+ .cse53 v_arrayElimCell_53)) .cse54) (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (= .cse54 (select .cse52 (+ .cse53 v_arrayElimCell_54))) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0)))))) (or .cse14 (forall ((~a~0 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_arrayElimCell_52 Int) (v_arrayElimCell_51 Int) (|thread1Thread1of1ForFork0_#t~mem2| Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_arrayElimCell_54 Int)) (let ((.cse60 (let ((.cse61 (store |c_#memory_int| c_~A~0.base (store .cse6 .cse7 |thread1Thread1of1ForFork0_#t~mem2|)))) (store .cse61 .cse2 (store (select .cse61 .cse2) (+ .cse4 v_arrayElimCell_51) .cse5)))) (.cse59 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (let ((.cse57 (select (select .cse60 c_~A~0.base) (+ c_~A~0.offset .cse59 (* (* ~a~0 c_~M~0) 4)))) (.cse58 (select .cse60 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse2 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (= .cse57 (select .cse58 (+ .cse59 v_arrayElimCell_54))) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (= .cse57 (select .cse58 (+ .cse59 v_arrayElimCell_52))) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0)))))) (forall ((|ULTIMATE.start_main_#t~nondet21#1| Int)) (or (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (forall ((~a~0 Int)) (or (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0) (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_51 Int) (|thread1Thread1of1ForFork0_#t~mem2| Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_arrayElimCell_54 Int)) (let ((.cse65 (let ((.cse66 (store |c_#memory_int| c_~A~0.base (store .cse6 .cse7 |thread1Thread1of1ForFork0_#t~mem2|)))) (store .cse66 .cse2 (store (select .cse66 .cse2) (+ .cse4 v_arrayElimCell_51) .cse5)))) (.cse63 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (let ((.cse64 (select (select .cse65 c_~A~0.base) (+ c_~A~0.offset .cse63 (* (* ~a~0 c_~M~0) 4)))) (.cse62 (select .cse65 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse2 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (forall ((v_arrayElimCell_53 Int)) (= (select .cse62 (+ .cse63 v_arrayElimCell_53)) .cse64)) (= .cse64 (select .cse62 (+ .cse63 v_arrayElimCell_54))) (= .cse64 (select .cse62 (+ .cse63 v_arrayElimCell_52)))))))))))))))) is different from true [2024-05-07 02:19:36,104 WARN L876 $PredicateComparison]: unable to prove that (or (let ((.cse94 (* c_thread1Thread1of1ForFork0_~i~0 4)) (.cse4 (* c_thread2Thread1of1ForFork1_~j~0 4)) (.cse11 (= c_~B~0.base c_~A~0.base))) (let ((.cse38 (not .cse11)) (.cse6 (+ .cse4 (* (* c_thread2Thread1of1ForFork1_~i~1 c_~M~0) 4) c_~F~0.offset)) (.cse7 (+ c_~A~0.offset 4 .cse94)) (.cse8 (select |c_#memory_int| c_~A~0.base)) (.cse9 (+ c_~A~0.offset .cse94)) (.cse10 (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset))) (and (or (forall ((~a~0 Int) (v_arrayElimCell_52 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_ArrVal_2426 (Array Int Int)) (|thread1Thread1of1ForFork0_#t~mem2| Int) (v_subst_5 Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse10))) (or (= .cse0 c_~B~0.base) (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (let ((.cse1 (let ((.cse5 (store .cse8 .cse9 |thread1Thread1of1ForFork0_#t~mem2|))) (let ((.cse3 (store |c_#memory_int| c_~A~0.base (store .cse5 .cse7 v_subst_5)))) (store .cse3 .cse0 (store (select .cse3 .cse0) (+ .cse4 v_arrayElimCell_52) (select (select (store |c_#memory_int| c_~A~0.base .cse5) c_~F~0.base) .cse6)))))) (.cse2 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (= (select (select .cse1 c_~A~0.base) (+ c_~A~0.offset .cse2 (* (* ~a~0 c_~M~0) 4))) (select (select .cse1 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse0 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse2 v_arrayElimCell_52))))))) .cse11) (or .cse11 (forall ((~a~0 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_arrayElimCell_52 Int) (v_ArrVal_2426 (Array Int Int)) (v_arrayElimCell_51 Int) (|thread1Thread1of1ForFork0_#t~mem2| Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_arrayElimCell_54 Int) (v_subst_10 Int)) (let ((.cse16 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse10))) (let ((.cse14 (* 4 |ULTIMATE.start_main_#t~nondet21#1|)) (.cse15 (let ((.cse18 (store .cse8 .cse9 |thread1Thread1of1ForFork0_#t~mem2|))) (let ((.cse17 (store |c_#memory_int| c_~A~0.base (store .cse18 .cse7 v_subst_10)))) (store .cse17 .cse16 (store (select .cse17 .cse16) (+ .cse4 v_arrayElimCell_51) (select (select (store |c_#memory_int| c_~A~0.base .cse18) c_~F~0.base) .cse6))))))) (let ((.cse13 (select .cse15 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse16 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse12 (select (select .cse15 c_~A~0.base) (+ c_~A~0.offset .cse14 (* (* ~a~0 c_~M~0) 4))))) (or (< ~a~0 0) (= .cse12 (select .cse13 (+ .cse14 v_arrayElimCell_52))) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (= (select .cse13 (+ .cse14 v_arrayElimCell_54)) .cse12) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))))))) (forall ((|ULTIMATE.start_main_#t~nondet21#1| Int) (v_ArrVal_2426 (Array Int Int)) (|thread1Thread1of1ForFork0_#t~mem2| Int)) (or (forall ((~a~0 Int)) (or (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_51 Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_arrayElimCell_54 Int) (v_subst_1 Int)) (let ((.cse23 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse10))) (let ((.cse22 (let ((.cse25 (store .cse8 .cse9 |thread1Thread1of1ForFork0_#t~mem2|))) (let ((.cse24 (store |c_#memory_int| c_~A~0.base (store .cse25 .cse7 v_subst_1)))) (store .cse24 .cse23 (store (select .cse24 .cse23) (+ .cse4 v_arrayElimCell_51) (select (select (store |c_#memory_int| c_~A~0.base .cse25) c_~F~0.base) .cse6)))))) (.cse20 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (let ((.cse21 (select (select .cse22 c_~A~0.base) (+ c_~A~0.offset .cse20 (* (* ~a~0 c_~M~0) 4)))) (.cse19 (select .cse22 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse23 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= (select .cse19 (+ .cse20 v_arrayElimCell_54)) .cse21) (= (select .cse19 (+ .cse20 v_arrayElimCell_52)) .cse21) (forall ((v_arrayElimCell_53 Int)) (= .cse21 (select .cse19 (+ .cse20 v_arrayElimCell_53))))))))) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)))) (forall ((|ULTIMATE.start_main_#t~nondet21#1| Int) (v_ArrVal_2426 (Array Int Int)) (|thread1Thread1of1ForFork0_#t~mem2| Int)) (or (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (forall ((~a~0 Int)) (or (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (forall ((v_subst_14 Int) (v_arrayElimCell_52 Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_arrayElimCell_54 Int)) (let ((.cse30 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse10))) (let ((.cse29 (let ((.cse32 (store .cse8 .cse9 |thread1Thread1of1ForFork0_#t~mem2|))) (let ((.cse31 (store |c_#memory_int| c_~A~0.base (store .cse32 .cse7 v_subst_14)))) (store .cse31 .cse30 (store (select .cse31 .cse30) (+ .cse4 v_arrayElimCell_52) (select (select (store |c_#memory_int| c_~A~0.base .cse32) c_~F~0.base) .cse6)))))) (.cse28 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (let ((.cse26 (select (select .cse29 c_~A~0.base) (+ c_~A~0.offset .cse28 (* (* ~a~0 c_~M~0) 4)))) (.cse27 (select .cse29 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse30 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse26 (select .cse27 (+ .cse28 v_arrayElimCell_54))) (= (select .cse27 (+ .cse28 v_arrayElimCell_52)) .cse26) (forall ((v_arrayElimCell_53 Int)) (= .cse26 (select .cse27 (+ .cse28 v_arrayElimCell_53))))))))))))) (forall ((v_ArrVal_2426 (Array Int Int)) (|thread1Thread1of1ForFork0_#t~mem2| Int)) (let ((.cse35 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse10))) (or (forall ((~a~0 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_arrayElimCell_52 Int) (v_subst_6 Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_arrayElimCell_54 Int)) (or (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (let ((.cse33 (let ((.cse37 (store .cse8 .cse9 |thread1Thread1of1ForFork0_#t~mem2|))) (let ((.cse36 (store |c_#memory_int| c_~A~0.base (store .cse37 .cse7 v_subst_6)))) (store .cse36 .cse35 (store (select .cse36 .cse35) (+ .cse4 v_arrayElimCell_52) (select (select (store |c_#memory_int| c_~A~0.base .cse37) c_~F~0.base) .cse6)))))) (.cse34 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (= (select (select .cse33 c_~A~0.base) (+ c_~A~0.offset .cse34 (* (* ~a~0 c_~M~0) 4))) (select (select .cse33 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse35 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse34 v_arrayElimCell_54)))))) (not (= .cse35 c_~B~0.base))))) (or .cse38 (forall ((~a~0 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_arrayElimCell_52 Int) (v_ArrVal_2426 (Array Int Int)) (|thread1Thread1of1ForFork0_#t~mem2| Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_subst_11 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_53 Int)) (let ((.cse43 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse10))) (let ((.cse40 (* 4 |ULTIMATE.start_main_#t~nondet21#1|)) (.cse42 (let ((.cse45 (store .cse8 .cse9 |thread1Thread1of1ForFork0_#t~mem2|))) (let ((.cse44 (store |c_#memory_int| c_~A~0.base (store .cse45 .cse7 v_subst_11)))) (store .cse44 .cse43 (store (select .cse44 .cse43) (+ .cse4 v_arrayElimCell_52) (select (select (store |c_#memory_int| c_~A~0.base .cse45) c_~F~0.base) .cse6))))))) (let ((.cse39 (select .cse42 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse43 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse41 (select (select .cse42 c_~A~0.base) (+ c_~A~0.offset .cse40 (* (* ~a~0 c_~M~0) 4))))) (or (< ~a~0 0) (= (select .cse39 (+ .cse40 v_arrayElimCell_53)) .cse41) (= (select .cse39 (+ .cse40 v_arrayElimCell_54)) .cse41) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)))))))) (or .cse38 (forall ((~a~0 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_ArrVal_2426 (Array Int Int)) (v_arrayElimCell_51 Int) (|thread1Thread1of1ForFork0_#t~mem2| Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_subst_2 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_53 Int)) (let ((.cse50 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse10))) (let ((.cse49 (let ((.cse52 (store .cse8 .cse9 |thread1Thread1of1ForFork0_#t~mem2|))) (let ((.cse51 (store |c_#memory_int| c_~A~0.base (store .cse52 .cse7 v_subst_2)))) (store .cse51 .cse50 (store (select .cse51 .cse50) (+ .cse4 v_arrayElimCell_51) (select (select (store |c_#memory_int| c_~A~0.base .cse52) c_~F~0.base) .cse6)))))) (.cse48 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (let ((.cse46 (select (select .cse49 c_~A~0.base) (+ c_~A~0.offset .cse48 (* (* ~a~0 c_~M~0) 4)))) (.cse47 (select .cse49 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse50 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse46 (select .cse47 (+ .cse48 v_arrayElimCell_54))) (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (= .cse46 (select .cse47 (+ .cse48 v_arrayElimCell_53))) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))))))) (or .cse11 (forall ((~a~0 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_arrayElimCell_52 Int) (v_ArrVal_2426 (Array Int Int)) (v_arrayElimCell_51 Int) (|thread1Thread1of1ForFork0_#t~mem2| Int) (v_subst_8 Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int))) (let ((.cse53 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse10))) (or (= .cse53 c_~B~0.base) (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (let ((.cse54 (let ((.cse57 (store .cse8 .cse9 |thread1Thread1of1ForFork0_#t~mem2|))) (let ((.cse56 (store |c_#memory_int| c_~A~0.base (store .cse57 .cse7 v_subst_8)))) (store .cse56 .cse53 (store (select .cse56 .cse53) (+ .cse4 v_arrayElimCell_51) (select (select (store |c_#memory_int| c_~A~0.base .cse57) c_~F~0.base) .cse6)))))) (.cse55 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (= (select (select .cse54 c_~A~0.base) (+ c_~A~0.offset .cse55 (* (* ~a~0 c_~M~0) 4))) (select (select .cse54 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse53 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse55 v_arrayElimCell_52)))) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))))) (or .cse38 (forall ((~a~0 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_ArrVal_2426 (Array Int Int)) (v_arrayElimCell_51 Int) (|thread1Thread1of1ForFork0_#t~mem2| Int) (v_subst_9 Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_arrayElimCell_53 Int)) (let ((.cse58 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse10))) (or (= .cse58 c_~B~0.base) (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0) (let ((.cse59 (let ((.cse62 (store .cse8 .cse9 |thread1Thread1of1ForFork0_#t~mem2|))) (let ((.cse61 (store |c_#memory_int| c_~A~0.base (store .cse62 .cse7 v_subst_9)))) (store .cse61 .cse58 (store (select .cse61 .cse58) (+ .cse4 v_arrayElimCell_51) (select (select (store |c_#memory_int| c_~A~0.base .cse62) c_~F~0.base) .cse6)))))) (.cse60 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (= (select (select .cse59 c_~A~0.base) (+ c_~A~0.offset .cse60 (* (* ~a~0 c_~M~0) 4))) (select (select .cse59 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse58 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse60 v_arrayElimCell_53)))))))) (forall ((v_ArrVal_2426 (Array Int Int))) (let ((.cse67 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse10))) (or (forall ((|ULTIMATE.start_main_#t~nondet21#1| Int) (|thread1Thread1of1ForFork0_#t~mem2| Int)) (or (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (forall ((~a~0 Int)) (or (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (forall ((v_arrayElimCell_52 Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_subst_3 Int)) (let ((.cse66 (let ((.cse69 (store .cse8 .cse9 |thread1Thread1of1ForFork0_#t~mem2|))) (let ((.cse68 (store |c_#memory_int| c_~A~0.base (store .cse69 .cse7 v_subst_3)))) (store .cse68 .cse67 (store (select .cse68 .cse67) (+ .cse4 v_arrayElimCell_52) (select (select (store |c_#memory_int| c_~A~0.base .cse69) c_~F~0.base) .cse6)))))) (.cse65 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (let ((.cse63 (select (select .cse66 c_~A~0.base) (+ c_~A~0.offset .cse65 (* (* ~a~0 c_~M~0) 4)))) (.cse64 (select .cse66 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse67 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse63 (select .cse64 (+ .cse65 v_arrayElimCell_52))) (forall ((v_arrayElimCell_53 Int)) (= .cse63 (select .cse64 (+ .cse65 v_arrayElimCell_53)))))))))))) (= .cse67 c_~B~0.base)))) (forall ((v_ArrVal_2426 (Array Int Int))) (let ((.cse70 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse10))) (or (= .cse70 c_~B~0.base) (forall ((|ULTIMATE.start_main_#t~nondet21#1| Int) (|thread1Thread1of1ForFork0_#t~mem2| Int)) (or (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_51 Int) (v_subst_7 Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int))) (let ((.cse74 (let ((.cse76 (store .cse8 .cse9 |thread1Thread1of1ForFork0_#t~mem2|))) (let ((.cse75 (store |c_#memory_int| c_~A~0.base (store .cse76 .cse7 v_subst_7)))) (store .cse75 .cse70 (store (select .cse75 .cse70) (+ .cse4 v_arrayElimCell_51) (select (select (store |c_#memory_int| c_~A~0.base .cse76) c_~F~0.base) .cse6)))))) (.cse73 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (let ((.cse71 (select (select .cse74 c_~A~0.base) (+ c_~A~0.offset .cse73 (* (* ~a~0 c_~M~0) 4)))) (.cse72 (select .cse74 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse70 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (forall ((v_arrayElimCell_53 Int)) (= .cse71 (select .cse72 (+ .cse73 v_arrayElimCell_53)))) (= .cse71 (select .cse72 (+ .cse73 v_arrayElimCell_52))))))) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1))))))) (or .cse38 (forall ((~a~0 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_arrayElimCell_52 Int) (v_ArrVal_2426 (Array Int Int)) (|thread1Thread1of1ForFork0_#t~mem2| Int) (v_ArrVal_2431 (Array Int Int)) (v_subst_4 Int) (v_ArrVal_2430 (Array Int Int)) (v_arrayElimCell_53 Int)) (let ((.cse77 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse10))) (or (= .cse77 c_~B~0.base) (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (let ((.cse78 (let ((.cse81 (store .cse8 .cse9 |thread1Thread1of1ForFork0_#t~mem2|))) (let ((.cse80 (store |c_#memory_int| c_~A~0.base (store .cse81 .cse7 v_subst_4)))) (store .cse80 .cse77 (store (select .cse80 .cse77) (+ .cse4 v_arrayElimCell_52) (select (select (store |c_#memory_int| c_~A~0.base .cse81) c_~F~0.base) .cse6)))))) (.cse79 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (= (select (select .cse78 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse77 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse79 v_arrayElimCell_53)) (select (select .cse78 c_~A~0.base) (+ c_~A~0.offset .cse79 (* (* ~a~0 c_~M~0) 4))))))))) (forall ((v_ArrVal_2426 (Array Int Int)) (|thread1Thread1of1ForFork0_#t~mem2| Int)) (let ((.cse82 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse10))) (or (not (= .cse82 c_~B~0.base)) (forall ((~a~0 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_subst_13 Int) (v_arrayElimCell_51 Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_arrayElimCell_54 Int)) (or (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (let ((.cse83 (let ((.cse86 (store .cse8 .cse9 |thread1Thread1of1ForFork0_#t~mem2|))) (let ((.cse85 (store |c_#memory_int| c_~A~0.base (store .cse86 .cse7 v_subst_13)))) (store .cse85 .cse82 (store (select .cse85 .cse82) (+ .cse4 v_arrayElimCell_51) (select (select (store |c_#memory_int| c_~A~0.base .cse86) c_~F~0.base) .cse6)))))) (.cse84 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (= (select (select .cse83 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse82 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse84 v_arrayElimCell_54)) (select (select .cse83 c_~A~0.base) (+ c_~A~0.offset .cse84 (* (* ~a~0 c_~M~0) 4))))) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0)))))) (or (forall ((~a~0 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_arrayElimCell_52 Int) (v_subst_12 Int) (v_ArrVal_2426 (Array Int Int)) (|thread1Thread1of1ForFork0_#t~mem2| Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_arrayElimCell_54 Int)) (let ((.cse91 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse10))) (let ((.cse90 (let ((.cse93 (store .cse8 .cse9 |thread1Thread1of1ForFork0_#t~mem2|))) (let ((.cse92 (store |c_#memory_int| c_~A~0.base (store .cse93 .cse7 v_subst_12)))) (store .cse92 .cse91 (store (select .cse92 .cse91) (+ .cse4 v_arrayElimCell_52) (select (select (store |c_#memory_int| c_~A~0.base .cse93) c_~F~0.base) .cse6)))))) (.cse89 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (let ((.cse87 (select (select .cse90 c_~A~0.base) (+ c_~A~0.offset .cse89 (* (* ~a~0 c_~M~0) 4)))) (.cse88 (select .cse90 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse91 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (< ~a~0 0) (= .cse87 (select .cse88 (+ .cse89 v_arrayElimCell_54))) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (= .cse87 (select .cse88 (+ .cse89 v_arrayElimCell_52)))))))) .cse11)))) (< (+ c_thread2Thread1of1ForFork1_~j~0 1) c_~M~0)) is different from true [2024-05-07 02:19:40,660 WARN L876 $PredicateComparison]: unable to prove that (or (< 1 c_~M~0) (let ((.cse93 (* c_thread1Thread1of1ForFork0_~i~0 4)) (.cse10 (= c_~B~0.base c_~A~0.base))) (let ((.cse25 (not .cse10)) (.cse5 (+ (* (* c_thread2Thread1of1ForFork1_~i~1 c_~M~0) 4) c_~F~0.offset)) (.cse6 (+ c_~A~0.offset 4 .cse93)) (.cse7 (select |c_#memory_int| c_~A~0.base)) (.cse8 (+ c_~A~0.offset .cse93)) (.cse9 (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset))) (and (forall ((v_ArrVal_2426 (Array Int Int)) (|thread1Thread1of1ForFork0_#t~mem2| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse9))) (or (not (= .cse0 c_~B~0.base)) (forall ((~a~0 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_subst_13 Int) (v_arrayElimCell_51 Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_arrayElimCell_54 Int)) (or (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (let ((.cse1 (let ((.cse4 (store .cse7 .cse8 |thread1Thread1of1ForFork0_#t~mem2|))) (let ((.cse3 (store |c_#memory_int| c_~A~0.base (store .cse4 .cse6 v_subst_13)))) (store .cse3 .cse0 (store (select .cse3 .cse0) v_arrayElimCell_51 (select (select (store |c_#memory_int| c_~A~0.base .cse4) c_~F~0.base) .cse5)))))) (.cse2 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (= (select (select .cse1 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse0 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse2 v_arrayElimCell_54)) (select (select .cse1 c_~A~0.base) (+ c_~A~0.offset .cse2 (* (* ~a~0 c_~M~0) 4))))) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0)))))) (or .cse10 (forall ((~a~0 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_arrayElimCell_52 Int) (v_subst_12 Int) (v_ArrVal_2426 (Array Int Int)) (|thread1Thread1of1ForFork0_#t~mem2| Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_arrayElimCell_54 Int)) (let ((.cse15 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse9))) (let ((.cse14 (let ((.cse17 (store .cse7 .cse8 |thread1Thread1of1ForFork0_#t~mem2|))) (let ((.cse16 (store |c_#memory_int| c_~A~0.base (store .cse17 .cse6 v_subst_12)))) (store .cse16 .cse15 (store (select .cse16 .cse15) v_arrayElimCell_52 (select (select (store |c_#memory_int| c_~A~0.base .cse17) c_~F~0.base) .cse5)))))) (.cse13 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (let ((.cse11 (select (select .cse14 c_~A~0.base) (+ c_~A~0.offset .cse13 (* (* ~a~0 c_~M~0) 4)))) (.cse12 (select .cse14 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse15 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse11 (select .cse12 (+ .cse13 v_arrayElimCell_52))) (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (= .cse11 (select .cse12 (+ .cse13 v_arrayElimCell_54))))))))) (or (forall ((~a~0 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_ArrVal_2426 (Array Int Int)) (v_arrayElimCell_51 Int) (|thread1Thread1of1ForFork0_#t~mem2| Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_subst_2 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_53 Int)) (let ((.cse22 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse9))) (let ((.cse21 (let ((.cse24 (store .cse7 .cse8 |thread1Thread1of1ForFork0_#t~mem2|))) (let ((.cse23 (store |c_#memory_int| c_~A~0.base (store .cse24 .cse6 v_subst_2)))) (store .cse23 .cse22 (store (select .cse23 .cse22) v_arrayElimCell_51 (select (select (store |c_#memory_int| c_~A~0.base .cse24) c_~F~0.base) .cse5)))))) (.cse20 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (let ((.cse18 (select (select .cse21 c_~A~0.base) (+ c_~A~0.offset .cse20 (* (* ~a~0 c_~M~0) 4)))) (.cse19 (select .cse21 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse22 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (= .cse18 (select .cse19 (+ .cse20 v_arrayElimCell_53))) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0) (= .cse18 (select .cse19 (+ .cse20 v_arrayElimCell_54)))))))) .cse25) (or (forall ((~a~0 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_arrayElimCell_52 Int) (v_ArrVal_2426 (Array Int Int)) (|thread1Thread1of1ForFork0_#t~mem2| Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_subst_11 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_53 Int)) (let ((.cse30 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse9))) (let ((.cse27 (* 4 |ULTIMATE.start_main_#t~nondet21#1|)) (.cse29 (let ((.cse32 (store .cse7 .cse8 |thread1Thread1of1ForFork0_#t~mem2|))) (let ((.cse31 (store |c_#memory_int| c_~A~0.base (store .cse32 .cse6 v_subst_11)))) (store .cse31 .cse30 (store (select .cse31 .cse30) v_arrayElimCell_52 (select (select (store |c_#memory_int| c_~A~0.base .cse32) c_~F~0.base) .cse5))))))) (let ((.cse26 (select .cse29 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse30 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse28 (select (select .cse29 c_~A~0.base) (+ c_~A~0.offset .cse27 (* (* ~a~0 c_~M~0) 4))))) (or (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (= (select .cse26 (+ .cse27 v_arrayElimCell_53)) .cse28) (= (select .cse26 (+ .cse27 v_arrayElimCell_54)) .cse28)))))) .cse25) (forall ((|ULTIMATE.start_main_#t~nondet21#1| Int) (v_ArrVal_2426 (Array Int Int)) (|thread1Thread1of1ForFork0_#t~mem2| Int)) (or (forall ((~a~0 Int)) (or (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_51 Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_arrayElimCell_54 Int) (v_subst_1 Int)) (let ((.cse37 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse9))) (let ((.cse34 (* 4 |ULTIMATE.start_main_#t~nondet21#1|)) (.cse36 (let ((.cse39 (store .cse7 .cse8 |thread1Thread1of1ForFork0_#t~mem2|))) (let ((.cse38 (store |c_#memory_int| c_~A~0.base (store .cse39 .cse6 v_subst_1)))) (store .cse38 .cse37 (store (select .cse38 .cse37) v_arrayElimCell_51 (select (select (store |c_#memory_int| c_~A~0.base .cse39) c_~F~0.base) .cse5))))))) (let ((.cse33 (select .cse36 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse37 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse35 (select (select .cse36 c_~A~0.base) (+ c_~A~0.offset .cse34 (* (* ~a~0 c_~M~0) 4))))) (or (forall ((v_arrayElimCell_53 Int)) (= (select .cse33 (+ .cse34 v_arrayElimCell_53)) .cse35)) (= .cse35 (select .cse33 (+ .cse34 v_arrayElimCell_54))) (= (select .cse33 (+ .cse34 v_arrayElimCell_52)) .cse35)))))) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)))) (or (forall ((~a~0 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_arrayElimCell_52 Int) (v_ArrVal_2426 (Array Int Int)) (|thread1Thread1of1ForFork0_#t~mem2| Int) (v_ArrVal_2431 (Array Int Int)) (v_subst_4 Int) (v_ArrVal_2430 (Array Int Int)) (v_arrayElimCell_53 Int)) (let ((.cse42 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse9))) (or (let ((.cse40 (let ((.cse44 (store .cse7 .cse8 |thread1Thread1of1ForFork0_#t~mem2|))) (let ((.cse43 (store |c_#memory_int| c_~A~0.base (store .cse44 .cse6 v_subst_4)))) (store .cse43 .cse42 (store (select .cse43 .cse42) v_arrayElimCell_52 (select (select (store |c_#memory_int| c_~A~0.base .cse44) c_~F~0.base) .cse5)))))) (.cse41 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (= (select (select .cse40 c_~A~0.base) (+ c_~A~0.offset .cse41 (* (* ~a~0 c_~M~0) 4))) (select (select .cse40 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse42 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse41 v_arrayElimCell_53)))) (= .cse42 c_~B~0.base) (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1))))) .cse25) (or (forall ((~a~0 Int) (v_arrayElimCell_52 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_ArrVal_2426 (Array Int Int)) (|thread1Thread1of1ForFork0_#t~mem2| Int) (v_subst_5 Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int))) (let ((.cse45 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse9))) (or (= .cse45 c_~B~0.base) (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (let ((.cse46 (let ((.cse49 (store .cse7 .cse8 |thread1Thread1of1ForFork0_#t~mem2|))) (let ((.cse48 (store |c_#memory_int| c_~A~0.base (store .cse49 .cse6 v_subst_5)))) (store .cse48 .cse45 (store (select .cse48 .cse45) v_arrayElimCell_52 (select (select (store |c_#memory_int| c_~A~0.base .cse49) c_~F~0.base) .cse5)))))) (.cse47 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (= (select (select .cse46 c_~A~0.base) (+ c_~A~0.offset .cse47 (* (* ~a~0 c_~M~0) 4))) (select (select .cse46 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse45 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse47 v_arrayElimCell_52))))))) .cse10) (forall ((v_ArrVal_2426 (Array Int Int))) (let ((.cse50 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse9))) (or (= .cse50 c_~B~0.base) (forall ((|ULTIMATE.start_main_#t~nondet21#1| Int) (|thread1Thread1of1ForFork0_#t~mem2| Int)) (or (forall ((~a~0 Int)) (or (forall ((v_arrayElimCell_52 Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_subst_3 Int)) (let ((.cse54 (let ((.cse56 (store .cse7 .cse8 |thread1Thread1of1ForFork0_#t~mem2|))) (let ((.cse55 (store |c_#memory_int| c_~A~0.base (store .cse56 .cse6 v_subst_3)))) (store .cse55 .cse50 (store (select .cse55 .cse50) v_arrayElimCell_52 (select (select (store |c_#memory_int| c_~A~0.base .cse56) c_~F~0.base) .cse5)))))) (.cse52 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (let ((.cse53 (select (select .cse54 c_~A~0.base) (+ c_~A~0.offset .cse52 (* (* ~a~0 c_~M~0) 4)))) (.cse51 (select .cse54 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse50 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= (select .cse51 (+ .cse52 v_arrayElimCell_52)) .cse53) (forall ((v_arrayElimCell_53 Int)) (= .cse53 (select .cse51 (+ .cse52 v_arrayElimCell_53)))))))) (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0))) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1))))))) (forall ((v_ArrVal_2426 (Array Int Int))) (let ((.cse57 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse9))) (or (= .cse57 c_~B~0.base) (forall ((|ULTIMATE.start_main_#t~nondet21#1| Int) (|thread1Thread1of1ForFork0_#t~mem2| Int)) (or (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (forall ((~a~0 Int)) (or (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_51 Int) (v_subst_7 Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int))) (let ((.cse61 (let ((.cse63 (store .cse7 .cse8 |thread1Thread1of1ForFork0_#t~mem2|))) (let ((.cse62 (store |c_#memory_int| c_~A~0.base (store .cse63 .cse6 v_subst_7)))) (store .cse62 .cse57 (store (select .cse62 .cse57) v_arrayElimCell_51 (select (select (store |c_#memory_int| c_~A~0.base .cse63) c_~F~0.base) .cse5)))))) (.cse59 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (let ((.cse60 (select (select .cse61 c_~A~0.base) (+ c_~A~0.offset .cse59 (* (* ~a~0 c_~M~0) 4)))) (.cse58 (select .cse61 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse57 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= (select .cse58 (+ .cse59 v_arrayElimCell_52)) .cse60) (forall ((v_arrayElimCell_53 Int)) (= .cse60 (select .cse58 (+ .cse59 v_arrayElimCell_53)))))))) (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0)))))))) (or (forall ((~a~0 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_ArrVal_2426 (Array Int Int)) (v_arrayElimCell_51 Int) (|thread1Thread1of1ForFork0_#t~mem2| Int) (v_subst_9 Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_arrayElimCell_53 Int)) (let ((.cse64 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse9))) (or (= .cse64 c_~B~0.base) (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (let ((.cse65 (let ((.cse68 (store .cse7 .cse8 |thread1Thread1of1ForFork0_#t~mem2|))) (let ((.cse67 (store |c_#memory_int| c_~A~0.base (store .cse68 .cse6 v_subst_9)))) (store .cse67 .cse64 (store (select .cse67 .cse64) v_arrayElimCell_51 (select (select (store |c_#memory_int| c_~A~0.base .cse68) c_~F~0.base) .cse5)))))) (.cse66 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (= (select (select .cse65 c_~A~0.base) (+ c_~A~0.offset .cse66 (* (* ~a~0 c_~M~0) 4))) (select (select .cse65 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse64 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse66 v_arrayElimCell_53)))) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0)))) .cse25) (or (forall ((~a~0 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_arrayElimCell_52 Int) (v_ArrVal_2426 (Array Int Int)) (v_arrayElimCell_51 Int) (|thread1Thread1of1ForFork0_#t~mem2| Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_arrayElimCell_54 Int) (v_subst_10 Int)) (let ((.cse73 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse9))) (let ((.cse71 (* 4 |ULTIMATE.start_main_#t~nondet21#1|)) (.cse72 (let ((.cse75 (store .cse7 .cse8 |thread1Thread1of1ForFork0_#t~mem2|))) (let ((.cse74 (store |c_#memory_int| c_~A~0.base (store .cse75 .cse6 v_subst_10)))) (store .cse74 .cse73 (store (select .cse74 .cse73) v_arrayElimCell_51 (select (select (store |c_#memory_int| c_~A~0.base .cse75) c_~F~0.base) .cse5))))))) (let ((.cse70 (select .cse72 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse73 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse69 (select (select .cse72 c_~A~0.base) (+ c_~A~0.offset .cse71 (* (* ~a~0 c_~M~0) 4))))) (or (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (= .cse69 (select .cse70 (+ .cse71 v_arrayElimCell_54))) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (= (select .cse70 (+ .cse71 v_arrayElimCell_52)) .cse69) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0)))))) .cse10) (forall ((|ULTIMATE.start_main_#t~nondet21#1| Int) (v_ArrVal_2426 (Array Int Int)) (|thread1Thread1of1ForFork0_#t~mem2| Int)) (or (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_subst_14 Int) (v_arrayElimCell_52 Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_arrayElimCell_54 Int)) (let ((.cse80 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse9))) (let ((.cse77 (* 4 |ULTIMATE.start_main_#t~nondet21#1|)) (.cse79 (let ((.cse82 (store .cse7 .cse8 |thread1Thread1of1ForFork0_#t~mem2|))) (let ((.cse81 (store |c_#memory_int| c_~A~0.base (store .cse82 .cse6 v_subst_14)))) (store .cse81 .cse80 (store (select .cse81 .cse80) v_arrayElimCell_52 (select (select (store |c_#memory_int| c_~A~0.base .cse82) c_~F~0.base) .cse5))))))) (let ((.cse76 (select .cse79 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse80 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse78 (select (select .cse79 c_~A~0.base) (+ c_~A~0.offset .cse77 (* (* ~a~0 c_~M~0) 4))))) (or (= (select .cse76 (+ .cse77 v_arrayElimCell_52)) .cse78) (= (select .cse76 (+ .cse77 v_arrayElimCell_54)) .cse78) (forall ((v_arrayElimCell_53 Int)) (= (select .cse76 (+ .cse77 v_arrayElimCell_53)) .cse78))))))) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0))) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)))) (or (forall ((~a~0 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_arrayElimCell_52 Int) (v_ArrVal_2426 (Array Int Int)) (v_arrayElimCell_51 Int) (|thread1Thread1of1ForFork0_#t~mem2| Int) (v_subst_8 Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int))) (let ((.cse83 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse9))) (or (= .cse83 c_~B~0.base) (< ~a~0 0) (let ((.cse84 (let ((.cse87 (store .cse7 .cse8 |thread1Thread1of1ForFork0_#t~mem2|))) (let ((.cse86 (store |c_#memory_int| c_~A~0.base (store .cse87 .cse6 v_subst_8)))) (store .cse86 .cse83 (store (select .cse86 .cse83) v_arrayElimCell_51 (select (select (store |c_#memory_int| c_~A~0.base .cse87) c_~F~0.base) .cse5)))))) (.cse85 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (= (select (select .cse84 c_~A~0.base) (+ c_~A~0.offset .cse85 (* (* ~a~0 c_~M~0) 4))) (select (select .cse84 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse83 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse85 v_arrayElimCell_52)))) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0)))) .cse10) (forall ((v_ArrVal_2426 (Array Int Int)) (|thread1Thread1of1ForFork0_#t~mem2| Int)) (let ((.cse88 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse9))) (or (not (= .cse88 c_~B~0.base)) (forall ((~a~0 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_arrayElimCell_52 Int) (v_subst_6 Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_arrayElimCell_54 Int)) (or (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (let ((.cse89 (let ((.cse92 (store .cse7 .cse8 |thread1Thread1of1ForFork0_#t~mem2|))) (let ((.cse91 (store |c_#memory_int| c_~A~0.base (store .cse92 .cse6 v_subst_6)))) (store .cse91 .cse88 (store (select .cse91 .cse88) v_arrayElimCell_52 (select (select (store |c_#memory_int| c_~A~0.base .cse92) c_~F~0.base) .cse5)))))) (.cse90 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (= (select (select .cse89 c_~A~0.base) (+ c_~A~0.offset .cse90 (* (* ~a~0 c_~M~0) 4))) (select (select .cse89 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse88 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse90 v_arrayElimCell_54))))))))))))) is different from true [2024-05-07 02:21:39,350 WARN L876 $PredicateComparison]: unable to prove that (or (< 1 c_~M~0) (let ((.cse11 (= c_~B~0.base c_~A~0.base))) (let ((.cse19 (not .cse11)) (.cse7 (+ (* (* c_thread2Thread1of1ForFork1_~i~1 c_~M~0) 4) c_~F~0.offset)) (.cse9 (select |c_#memory_int| c_~A~0.base)) (.cse8 (* c_thread1Thread1of1ForFork0_~i~0 4)) (.cse10 (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset))) (and (or (forall ((~A~0.offset Int) (~a~0 Int) (v_arrayElimCell_52 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_subst_12 Int) (v_ArrVal_2426 (Array Int Int)) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_arrayElimCell_54 Int) (v_subst_21 Int)) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse10))) (let ((.cse1 (* 4 |ULTIMATE.start_main_#t~nondet21#1|)) (.cse3 (let ((.cse6 (store (store .cse9 (+ ~A~0.offset .cse8) |c_thread1Thread1of1ForFork0_#t~mem2|) (+ ~A~0.offset 4 .cse8) v_subst_21))) (let ((.cse5 (store |c_#memory_int| c_~A~0.base (store .cse6 (+ ~A~0.offset 8 .cse8) v_subst_12)))) (store .cse5 .cse4 (store (select .cse5 .cse4) v_arrayElimCell_52 (select (select (store |c_#memory_int| c_~A~0.base .cse6) c_~F~0.base) .cse7))))))) (let ((.cse0 (select .cse3 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse4 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse2 (select (select .cse3 c_~A~0.base) (+ .cse1 (* (* ~a~0 c_~M~0) 4) ~A~0.offset)))) (or (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (= (select .cse0 (+ .cse1 v_arrayElimCell_54)) .cse2) (= (select .cse0 (+ .cse1 v_arrayElimCell_52)) .cse2)))))) .cse11) (or (forall ((~A~0.offset Int) (v_subst_15 Int) (~a~0 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_ArrVal_2426 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_subst_2 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_53 Int)) (let ((.cse16 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse10))) (let ((.cse13 (* 4 |ULTIMATE.start_main_#t~nondet21#1|)) (.cse15 (let ((.cse18 (store (store .cse9 (+ ~A~0.offset .cse8) |c_thread1Thread1of1ForFork0_#t~mem2|) (+ ~A~0.offset 4 .cse8) v_subst_15))) (let ((.cse17 (store |c_#memory_int| c_~A~0.base (store .cse18 (+ ~A~0.offset 8 .cse8) v_subst_2)))) (store .cse17 .cse16 (store (select .cse17 .cse16) v_arrayElimCell_51 (select (select (store |c_#memory_int| c_~A~0.base .cse18) c_~F~0.base) .cse7))))))) (let ((.cse12 (select .cse15 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse16 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse14 (select (select .cse15 c_~A~0.base) (+ .cse13 (* (* ~a~0 c_~M~0) 4) ~A~0.offset)))) (or (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (= (select .cse12 (+ .cse13 v_arrayElimCell_54)) .cse14) (= (select .cse12 (+ .cse13 v_arrayElimCell_53)) .cse14) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0)))))) .cse19) (or (forall ((~A~0.offset Int) (~a~0 Int) (v_subst_24 Int) (v_arrayElimCell_52 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_ArrVal_2426 (Array Int Int)) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_subst_11 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_53 Int)) (let ((.cse24 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse10))) (let ((.cse21 (* 4 |ULTIMATE.start_main_#t~nondet21#1|)) (.cse23 (let ((.cse26 (store (store .cse9 (+ ~A~0.offset .cse8) |c_thread1Thread1of1ForFork0_#t~mem2|) (+ ~A~0.offset 4 .cse8) v_subst_24))) (let ((.cse25 (store |c_#memory_int| c_~A~0.base (store .cse26 (+ ~A~0.offset 8 .cse8) v_subst_11)))) (store .cse25 .cse24 (store (select .cse25 .cse24) v_arrayElimCell_52 (select (select (store |c_#memory_int| c_~A~0.base .cse26) c_~F~0.base) .cse7))))))) (let ((.cse20 (select .cse23 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse24 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse22 (select (select .cse23 c_~A~0.base) (+ .cse21 (* (* ~a~0 c_~M~0) 4) ~A~0.offset)))) (or (= (select .cse20 (+ .cse21 v_arrayElimCell_53)) .cse22) (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (= (select .cse20 (+ .cse21 v_arrayElimCell_54)) .cse22)))))) .cse19) (forall ((~A~0.offset Int) (v_ArrVal_2426 (Array Int Int)) (v_subst_28 Int)) (let ((.cse27 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse10))) (or (not (= .cse27 c_~B~0.base)) (forall ((~a~0 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_subst_13 Int) (v_arrayElimCell_51 Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_arrayElimCell_54 Int)) (or (let ((.cse28 (let ((.cse31 (store (store .cse9 (+ ~A~0.offset .cse8) |c_thread1Thread1of1ForFork0_#t~mem2|) (+ ~A~0.offset 4 .cse8) v_subst_28))) (let ((.cse30 (store |c_#memory_int| c_~A~0.base (store .cse31 (+ ~A~0.offset 8 .cse8) v_subst_13)))) (store .cse30 .cse27 (store (select .cse30 .cse27) v_arrayElimCell_51 (select (select (store |c_#memory_int| c_~A~0.base .cse31) c_~F~0.base) .cse7)))))) (.cse29 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (= (select (select .cse28 c_~A~0.base) (+ .cse29 (* (* ~a~0 c_~M~0) 4) ~A~0.offset)) (select (select .cse28 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse27 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse29 v_arrayElimCell_54)))) (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0)))))) (or .cse11 (forall ((~A~0.offset Int) (~a~0 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_arrayElimCell_52 Int) (v_ArrVal_2426 (Array Int Int)) (v_arrayElimCell_51 Int) (v_subst_8 Int) (v_subst_27 Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int))) (let ((.cse32 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse10))) (or (= .cse32 c_~B~0.base) (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (let ((.cse33 (let ((.cse36 (store (store .cse9 (+ ~A~0.offset .cse8) |c_thread1Thread1of1ForFork0_#t~mem2|) (+ ~A~0.offset 4 .cse8) v_subst_27))) (let ((.cse35 (store |c_#memory_int| c_~A~0.base (store .cse36 (+ ~A~0.offset 8 .cse8) v_subst_8)))) (store .cse35 .cse32 (store (select .cse35 .cse32) v_arrayElimCell_51 (select (select (store |c_#memory_int| c_~A~0.base .cse36) c_~F~0.base) .cse7)))))) (.cse34 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (= (select (select .cse33 c_~A~0.base) (+ .cse34 (* (* ~a~0 c_~M~0) 4) ~A~0.offset)) (select (select .cse33 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse32 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse34 v_arrayElimCell_52)))) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))))) (or (forall ((~A~0.offset Int) (~a~0 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_arrayElimCell_52 Int) (v_ArrVal_2426 (Array Int Int)) (v_arrayElimCell_51 Int) (v_subst_19 Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_arrayElimCell_54 Int) (v_subst_10 Int)) (let ((.cse41 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse10))) (let ((.cse40 (let ((.cse43 (store (store .cse9 (+ ~A~0.offset .cse8) |c_thread1Thread1of1ForFork0_#t~mem2|) (+ ~A~0.offset 4 .cse8) v_subst_19))) (let ((.cse42 (store |c_#memory_int| c_~A~0.base (store .cse43 (+ ~A~0.offset 8 .cse8) v_subst_10)))) (store .cse42 .cse41 (store (select .cse42 .cse41) v_arrayElimCell_51 (select (select (store |c_#memory_int| c_~A~0.base .cse43) c_~F~0.base) .cse7)))))) (.cse39 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (let ((.cse37 (select (select .cse40 c_~A~0.base) (+ .cse39 (* (* ~a~0 c_~M~0) 4) ~A~0.offset))) (.cse38 (select .cse40 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse41 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (< ~a~0 0) (= .cse37 (select .cse38 (+ .cse39 v_arrayElimCell_52))) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (= .cse37 (select .cse38 (+ .cse39 v_arrayElimCell_54))) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0)))))) .cse11) (or (forall ((~A~0.offset Int) (~a~0 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_arrayElimCell_52 Int) (v_ArrVal_2426 (Array Int Int)) (v_subst_16 Int) (v_subst_5 Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int))) (let ((.cse44 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse10))) (or (= .cse44 c_~B~0.base) (let ((.cse45 (let ((.cse48 (store (store .cse9 (+ ~A~0.offset .cse8) |c_thread1Thread1of1ForFork0_#t~mem2|) (+ ~A~0.offset 4 .cse8) v_subst_16))) (let ((.cse47 (store |c_#memory_int| c_~A~0.base (store .cse48 (+ ~A~0.offset 8 .cse8) v_subst_5)))) (store .cse47 .cse44 (store (select .cse47 .cse44) v_arrayElimCell_52 (select (select (store |c_#memory_int| c_~A~0.base .cse48) c_~F~0.base) .cse7)))))) (.cse46 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (= (select (select .cse45 c_~A~0.base) (+ .cse46 (* (* ~a~0 c_~M~0) 4) ~A~0.offset)) (select (select .cse45 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse44 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse46 v_arrayElimCell_52)))) (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1))))) .cse11) (forall ((~A~0.offset Int) (v_ArrVal_2426 (Array Int Int))) (let ((.cse53 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse10))) (or (forall ((|ULTIMATE.start_main_#t~nondet21#1| Int) (v_subst_23 Int)) (or (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (forall ((~a~0 Int)) (or (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (forall ((v_arrayElimCell_52 Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_subst_3 Int)) (let ((.cse50 (* 4 |ULTIMATE.start_main_#t~nondet21#1|)) (.cse52 (let ((.cse55 (store (store .cse9 (+ ~A~0.offset .cse8) |c_thread1Thread1of1ForFork0_#t~mem2|) (+ ~A~0.offset 4 .cse8) v_subst_23))) (let ((.cse54 (store |c_#memory_int| c_~A~0.base (store .cse55 (+ ~A~0.offset 8 .cse8) v_subst_3)))) (store .cse54 .cse53 (store (select .cse54 .cse53) v_arrayElimCell_52 (select (select (store |c_#memory_int| c_~A~0.base .cse55) c_~F~0.base) .cse7))))))) (let ((.cse49 (select .cse52 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse53 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse51 (select (select .cse52 c_~A~0.base) (+ .cse50 (* (* ~a~0 c_~M~0) 4) ~A~0.offset)))) (or (forall ((v_arrayElimCell_53 Int)) (= (select .cse49 (+ .cse50 v_arrayElimCell_53)) .cse51)) (= (select .cse49 (+ .cse50 v_arrayElimCell_52)) .cse51))))))))) (= .cse53 c_~B~0.base)))) (or (forall ((~A~0.offset Int) (v_subst_26 Int) (~a~0 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_arrayElimCell_52 Int) (v_ArrVal_2426 (Array Int Int)) (v_ArrVal_2431 (Array Int Int)) (v_subst_4 Int) (v_ArrVal_2430 (Array Int Int)) (v_arrayElimCell_53 Int)) (let ((.cse56 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse10))) (or (= .cse56 c_~B~0.base) (let ((.cse57 (let ((.cse60 (store (store .cse9 (+ ~A~0.offset .cse8) |c_thread1Thread1of1ForFork0_#t~mem2|) (+ ~A~0.offset 4 .cse8) v_subst_26))) (let ((.cse59 (store |c_#memory_int| c_~A~0.base (store .cse60 (+ ~A~0.offset 8 .cse8) v_subst_4)))) (store .cse59 .cse56 (store (select .cse59 .cse56) v_arrayElimCell_52 (select (select (store |c_#memory_int| c_~A~0.base .cse60) c_~F~0.base) .cse7)))))) (.cse58 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (= (select (select .cse57 c_~A~0.base) (+ .cse58 (* (* ~a~0 c_~M~0) 4) ~A~0.offset)) (select (select .cse57 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse56 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse58 v_arrayElimCell_53)))) (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1))))) .cse19) (or .cse19 (forall ((~A~0.offset Int) (~a~0 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_ArrVal_2426 (Array Int Int)) (v_arrayElimCell_51 Int) (v_subst_9 Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_subst_22 Int) (v_arrayElimCell_53 Int)) (let ((.cse61 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse10))) (or (= .cse61 c_~B~0.base) (< ~a~0 0) (let ((.cse62 (let ((.cse65 (store (store .cse9 (+ ~A~0.offset .cse8) |c_thread1Thread1of1ForFork0_#t~mem2|) (+ ~A~0.offset 4 .cse8) v_subst_22))) (let ((.cse64 (store |c_#memory_int| c_~A~0.base (store .cse65 (+ ~A~0.offset 8 .cse8) v_subst_9)))) (store .cse64 .cse61 (store (select .cse64 .cse61) v_arrayElimCell_51 (select (select (store |c_#memory_int| c_~A~0.base .cse65) c_~F~0.base) .cse7)))))) (.cse63 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (= (select (select .cse62 c_~A~0.base) (+ .cse63 (* (* ~a~0 c_~M~0) 4) ~A~0.offset)) (select (select .cse62 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse61 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse63 v_arrayElimCell_53)))) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))))) (forall ((~A~0.offset Int) (v_subst_25 Int) (v_ArrVal_2426 (Array Int Int))) (let ((.cse66 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse10))) (or (not (= .cse66 c_~B~0.base)) (forall ((~a~0 Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_arrayElimCell_52 Int) (v_subst_6 Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_arrayElimCell_54 Int)) (or (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (let ((.cse67 (let ((.cse70 (store (store .cse9 (+ ~A~0.offset .cse8) |c_thread1Thread1of1ForFork0_#t~mem2|) (+ ~A~0.offset 4 .cse8) v_subst_25))) (let ((.cse69 (store |c_#memory_int| c_~A~0.base (store .cse70 (+ ~A~0.offset 8 .cse8) v_subst_6)))) (store .cse69 .cse66 (store (select .cse69 .cse66) v_arrayElimCell_52 (select (select (store |c_#memory_int| c_~A~0.base .cse70) c_~F~0.base) .cse7)))))) (.cse68 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (= (select (select .cse67 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse66 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse68 v_arrayElimCell_54)) (select (select .cse67 c_~A~0.base) (+ .cse68 (* (* ~a~0 c_~M~0) 4) ~A~0.offset))))))))) (forall ((~A~0.offset Int) (v_ArrVal_2426 (Array Int Int))) (let ((.cse71 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse10))) (or (= .cse71 c_~B~0.base) (forall ((|ULTIMATE.start_main_#t~nondet21#1| Int) (v_subst_20 Int)) (or (forall ((~a~0 Int)) (or (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_51 Int) (v_subst_7 Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int))) (let ((.cse73 (* 4 |ULTIMATE.start_main_#t~nondet21#1|)) (.cse75 (let ((.cse77 (store (store .cse9 (+ ~A~0.offset .cse8) |c_thread1Thread1of1ForFork0_#t~mem2|) (+ ~A~0.offset 4 .cse8) v_subst_20))) (let ((.cse76 (store |c_#memory_int| c_~A~0.base (store .cse77 (+ ~A~0.offset 8 .cse8) v_subst_7)))) (store .cse76 .cse71 (store (select .cse76 .cse71) v_arrayElimCell_51 (select (select (store |c_#memory_int| c_~A~0.base .cse77) c_~F~0.base) .cse7))))))) (let ((.cse72 (select .cse75 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse71 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse74 (select (select .cse75 c_~A~0.base) (+ .cse73 (* (* ~a~0 c_~M~0) 4) ~A~0.offset)))) (or (= (select .cse72 (+ .cse73 v_arrayElimCell_52)) .cse74) (forall ((v_arrayElimCell_53 Int)) (= (select .cse72 (+ .cse73 v_arrayElimCell_53)) .cse74)))))) (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1))))))) (forall ((~A~0.offset Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_ArrVal_2426 (Array Int Int)) (v_subst_18 Int)) (or (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_subst_14 Int) (v_arrayElimCell_52 Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_arrayElimCell_54 Int)) (let ((.cse82 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse10))) (let ((.cse79 (* 4 |ULTIMATE.start_main_#t~nondet21#1|)) (.cse81 (let ((.cse84 (store (store .cse9 (+ ~A~0.offset .cse8) |c_thread1Thread1of1ForFork0_#t~mem2|) (+ ~A~0.offset 4 .cse8) v_subst_18))) (let ((.cse83 (store |c_#memory_int| c_~A~0.base (store .cse84 (+ ~A~0.offset 8 .cse8) v_subst_14)))) (store .cse83 .cse82 (store (select .cse83 .cse82) v_arrayElimCell_52 (select (select (store |c_#memory_int| c_~A~0.base .cse84) c_~F~0.base) .cse7))))))) (let ((.cse78 (select .cse81 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse82 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse80 (select (select .cse81 c_~A~0.base) (+ .cse79 (* (* ~a~0 c_~M~0) 4) ~A~0.offset)))) (or (forall ((v_arrayElimCell_53 Int)) (= (select .cse78 (+ .cse79 v_arrayElimCell_53)) .cse80)) (= .cse80 (select .cse78 (+ .cse79 v_arrayElimCell_54))) (= (select .cse78 (+ .cse79 v_arrayElimCell_52)) .cse80)))))) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0))))) (forall ((~A~0.offset Int) (|ULTIMATE.start_main_#t~nondet21#1| Int) (v_ArrVal_2426 (Array Int Int)) (v_subst_17 Int)) (or (< |ULTIMATE.start_main_#t~nondet21#1| 0) (< c_~M~0 (+ |ULTIMATE.start_main_#t~nondet21#1| 1)) (forall ((~a~0 Int)) (or (< ~a~0 0) (< c_thread2Thread1of1ForFork1_~i~1 ~a~0) (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_51 Int) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_arrayElimCell_54 Int) (v_subst_1 Int)) (let ((.cse89 (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2426) c_~B~0.base) .cse10))) (let ((.cse88 (let ((.cse91 (store (store .cse9 (+ ~A~0.offset .cse8) |c_thread1Thread1of1ForFork0_#t~mem2|) (+ ~A~0.offset 4 .cse8) v_subst_17))) (let ((.cse90 (store |c_#memory_int| c_~A~0.base (store .cse91 (+ ~A~0.offset 8 .cse8) v_subst_1)))) (store .cse90 .cse89 (store (select .cse90 .cse89) v_arrayElimCell_51 (select (select (store |c_#memory_int| c_~A~0.base .cse91) c_~F~0.base) .cse7)))))) (.cse87 (* 4 |ULTIMATE.start_main_#t~nondet21#1|))) (let ((.cse85 (select (select .cse88 c_~A~0.base) (+ .cse87 (* (* ~a~0 c_~M~0) 4) ~A~0.offset))) (.cse86 (select .cse88 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_2430) .cse89 v_ArrVal_2431) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (forall ((v_arrayElimCell_53 Int)) (= .cse85 (select .cse86 (+ .cse87 v_arrayElimCell_53)))) (= (select .cse86 (+ .cse87 v_arrayElimCell_54)) .cse85) (= .cse85 (select .cse86 (+ .cse87 v_arrayElimCell_52)))))))) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))))))))) is different from true [2024-05-07 02:21:40,413 INFO L349 Elim1Store]: treesize reduction 8, result has 97.6 percent of original size [2024-05-07 02:21:40,415 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 11469083 treesize of output 10242143 [2024-05-07 02:22:43,151 WARN L293 SmtUtils]: Spent 1.05m on a formula simplification. DAG size of input: 1407 DAG size of output: 480 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-05-07 02:27:22,146 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-05-07 02:27:22,149 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-05-07 02:27:22,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 02:27:22,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021454176] [2024-05-07 02:27:22,150 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-07 02:27:22,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498791569] [2024-05-07 02:27:22,150 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-05-07 02:27:22,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-05-07 02:27:22,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 02:27:22,351 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$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:340) 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:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 68 more [2024-05-07 02:27:22,355 INFO L158 Benchmark]: Toolchain (without parser) took 629025.62ms. Allocated memory was 281.0MB in the beginning and 941.6MB in the end (delta: 660.6MB). Free memory was 212.3MB in the beginning and 385.7MB in the end (delta: -173.4MB). Peak memory consumption was 554.0MB. Max. memory is 8.0GB. [2024-05-07 02:27:22,355 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 281.0MB. Free memory is still 248.7MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-07 02:27:22,355 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.37ms. Allocated memory is still 281.0MB. Free memory was 212.0MB in the beginning and 200.0MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-07 02:27:22,356 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.06ms. Allocated memory is still 281.0MB. Free memory was 199.9MB in the beginning and 197.6MB in the end (delta: 2.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-07 02:27:22,356 INFO L158 Benchmark]: Boogie Preprocessor took 46.58ms. Allocated memory is still 281.0MB. Free memory was 197.6MB in the beginning and 195.7MB in the end (delta: 1.9MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-07 02:27:22,356 INFO L158 Benchmark]: RCFGBuilder took 586.84ms. Allocated memory is still 281.0MB. Free memory was 195.5MB in the beginning and 233.1MB in the end (delta: -37.6MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-05-07 02:27:22,356 INFO L158 Benchmark]: TraceAbstraction took 628128.00ms. Allocated memory was 281.0MB in the beginning and 941.6MB in the end (delta: 660.6MB). Free memory was 231.5MB in the beginning and 385.7MB in the end (delta: -154.2MB). Peak memory consumption was 573.6MB. Max. memory is 8.0GB. [2024-05-07 02:27:22,357 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 281.0MB. Free memory is still 248.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 218.37ms. Allocated memory is still 281.0MB. Free memory was 212.0MB in the beginning and 200.0MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.06ms. Allocated memory is still 281.0MB. Free memory was 199.9MB in the beginning and 197.6MB in the end (delta: 2.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.58ms. Allocated memory is still 281.0MB. Free memory was 197.6MB in the beginning and 195.7MB in the end (delta: 1.9MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 586.84ms. Allocated memory is still 281.0MB. Free memory was 195.5MB in the beginning and 233.1MB in the end (delta: -37.6MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 628128.00ms. Allocated memory was 281.0MB in the beginning and 941.6MB in the end (delta: 660.6MB). Free memory was 231.5MB in the beginning and 385.7MB in the end (delta: -154.2MB). Peak memory consumption was 573.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-05-07 02:27:22,385 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...