/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT --traceabstraction.refinement.strategy.for.commutativity.condition.synthesis CAMEL -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.conditional-comm-158c277 [2024-11-14 18:24:11,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 18:24:11,859 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2024-11-14 18:24:11,862 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 18:24:11,862 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 18:24:11,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 18:24:11,879 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 18:24:11,879 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 18:24:11,879 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 18:24:11,879 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 18:24:11,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 18:24:11,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 18:24:11,879 INFO L153 SettingsManager]: * Use SBE=true [2024-11-14 18:24:11,879 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 18:24:11,879 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 18:24:11,879 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 18:24:11,879 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 18:24:11,880 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 18:24:11,880 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 18:24:11,880 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 18:24:11,880 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 18:24:11,880 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 18:24:11,880 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 18:24:11,880 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 18:24:11,880 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 18:24:11,880 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 18:24:11,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 18:24:11,880 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-14 18:24:11,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 18:24:11,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 18:24:11,880 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 18:24:11,880 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 18:24:11,880 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 18:24:11,881 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-14 18:24:11,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 18:24:11,881 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 18:24:11,881 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-14 18:24:11,881 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-14 18:24:11,881 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-14 18:24:11,881 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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: Commutativity condition synthesis -> NECESSARY_AND_SUFFICIENT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Refinement strategy for commutativity condition synthesis -> CAMEL [2024-11-14 18:24:12,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 18:24:12,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 18:24:12,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 18:24:12,096 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 18:24:12,096 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 18:24:12,097 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/queue.i [2024-11-14 18:24:13,341 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 18:24:13,616 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 18:24:13,617 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/queue.i [2024-11-14 18:24:13,636 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/91a377bc1/703c6790444e41b69f150b19eb21a41a/FLAG11f8cf0f2 [2024-11-14 18:24:13,652 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/91a377bc1/703c6790444e41b69f150b19eb21a41a [2024-11-14 18:24:13,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 18:24:13,655 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-14 18:24:13,656 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 18:24:13,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 18:24:13,658 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 18:24:13,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:24:13" (1/1) ... [2024-11-14 18:24:13,660 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18eb558d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:24:13, skipping insertion in model container [2024-11-14 18:24:13,660 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:24:13" (1/1) ... [2024-11-14 18:24:13,692 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 18:24:13,995 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/queue.i[43284,43297] [2024-11-14 18:24:14,000 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/queue.i[43491,43504] [2024-11-14 18:24:14,002 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/queue.i[43772,43785] [2024-11-14 18:24:14,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 18:24:14,017 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 18:24:14,052 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/queue.i[43284,43297] [2024-11-14 18:24:14,055 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/queue.i[43491,43504] [2024-11-14 18:24:14,056 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/queue.i[43772,43785] [2024-11-14 18:24:14,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 18:24:14,110 INFO L204 MainTranslator]: Completed translation [2024-11-14 18:24:14,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:24:14 WrapperNode [2024-11-14 18:24:14,111 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 18:24:14,111 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 18:24:14,112 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 18:24:14,112 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 18:24:14,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:24:14" (1/1) ... [2024-11-14 18:24:14,128 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:24:14" (1/1) ... [2024-11-14 18:24:14,160 INFO L138 Inliner]: procedures = 277, calls = 107, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 290 [2024-11-14 18:24:14,160 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 18:24:14,161 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 18:24:14,161 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 18:24:14,161 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 18:24:14,167 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:24:14" (1/1) ... [2024-11-14 18:24:14,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:24:14" (1/1) ... [2024-11-14 18:24:14,171 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:24:14" (1/1) ... [2024-11-14 18:24:14,171 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:24:14" (1/1) ... [2024-11-14 18:24:14,186 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:24:14" (1/1) ... [2024-11-14 18:24:14,190 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:24:14" (1/1) ... [2024-11-14 18:24:14,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:24:14" (1/1) ... [2024-11-14 18:24:14,192 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:24:14" (1/1) ... [2024-11-14 18:24:14,194 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 18:24:14,195 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 18:24:14,195 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 18:24:14,195 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 18:24:14,195 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:24:14" (1/1) ... [2024-11-14 18:24:14,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 18:24:14,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 18:24:14,217 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 18:24:14,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 18:24:14,249 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-14 18:24:14,249 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-14 18:24:14,249 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-14 18:24:14,249 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-14 18:24:14,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-14 18:24:14,249 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-14 18:24:14,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 18:24:14,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 18:24:14,249 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-14 18:24:14,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 18:24:14,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 18:24:14,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 18:24:14,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 18:24:14,250 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-14 18:24:14,349 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 18:24:14,350 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 18:24:14,644 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 18:24:14,644 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 18:24:14,658 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 18:24:14,658 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-14 18:24:14,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:24:14 BoogieIcfgContainer [2024-11-14 18:24:14,659 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 18:24:14,660 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 18:24:14,660 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 18:24:14,663 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 18:24:14,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:24:13" (1/3) ... [2024-11-14 18:24:14,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43747826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:24:14, skipping insertion in model container [2024-11-14 18:24:14,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:24:14" (2/3) ... [2024-11-14 18:24:14,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43747826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:24:14, skipping insertion in model container [2024-11-14 18:24:14,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:24:14" (3/3) ... [2024-11-14 18:24:14,664 INFO L112 eAbstractionObserver]: Analyzing ICFG queue.i [2024-11-14 18:24:14,672 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 18:24:14,673 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG queue.i that has 3 procedures, 303 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2024-11-14 18:24:14,673 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 18:24:14,741 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-14 18:24:14,774 INFO L123 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 18:24:14,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-14 18:24:14,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 18:24:14,776 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-14 18:24:14,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-14 18:24:14,840 INFO L185 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-14 18:24:14,849 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2024-11-14 18:24:14,854 INFO L333 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, 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;@432bb378, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 18:24:14,854 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 18:24:15,080 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 18:24:15,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 18:24:15,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1220443335, now seen corresponding path program 1 times [2024-11-14 18:24:15,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 18:24:15,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428947243] [2024-11-14 18:24:15,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 18:24:15,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 18:24:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 18:24:15,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 18:24:15,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 18:24:15,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428947243] [2024-11-14 18:24:15,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428947243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 18:24:15,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 18:24:15,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 18:24:15,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496264127] [2024-11-14 18:24:15,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 18:24:15,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 18:24:15,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 18:24:15,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 18:24:15,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 18:24:15,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:24:15,499 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 18:24:15,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 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-11-14 18:24:15,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:24:15,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:15,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 18:24:15,625 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 18:24:15,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 18:24:15,626 INFO L85 PathProgramCache]: Analyzing trace with hash -632737905, now seen corresponding path program 1 times [2024-11-14 18:24:15,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 18:24:15,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068766074] [2024-11-14 18:24:15,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 18:24:15,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 18:24:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 18:24:17,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 18:24:17,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 18:24:17,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068766074] [2024-11-14 18:24:17,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068766074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 18:24:17,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 18:24:17,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-14 18:24:17,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002428559] [2024-11-14 18:24:17,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 18:24:17,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-14 18:24:17,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 18:24:17,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-14 18:24:17,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-11-14 18:24:17,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:24:17,180 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 18:24:17,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.588235294117647) internal successors, (163), 17 states have internal predecessors, (163), 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-11-14 18:24:17,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:17,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:24:18,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:18,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 18:24:18,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 18:24:18,191 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 18:24:18,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 18:24:18,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1626758454, now seen corresponding path program 1 times [2024-11-14 18:24:18,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 18:24:18,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516321501] [2024-11-14 18:24:18,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 18:24:18,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 18:24:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 18:24:20,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 18:24:20,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 18:24:20,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516321501] [2024-11-14 18:24:20,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516321501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 18:24:20,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 18:24:20,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2024-11-14 18:24:20,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339941176] [2024-11-14 18:24:20,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 18:24:20,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-14 18:24:20,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 18:24:20,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-14 18:24:20,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2024-11-14 18:24:20,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:24:20,319 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 18:24:20,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.958333333333333) internal successors, (167), 24 states have internal predecessors, (167), 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-11-14 18:24:20,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:20,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-14 18:24:20,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:24:21,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:21,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 18:24:21,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-14 18:24:21,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 18:24:21,321 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 18:24:21,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 18:24:21,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1462624180, now seen corresponding path program 1 times [2024-11-14 18:24:21,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 18:24:21,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565967360] [2024-11-14 18:24:21,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 18:24:21,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 18:24:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 18:24:21,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 18:24:21,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 18:24:21,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565967360] [2024-11-14 18:24:21,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565967360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 18:24:21,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 18:24:21,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 18:24:21,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568083344] [2024-11-14 18:24:21,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 18:24:21,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 18:24:21,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 18:24:21,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 18:24:21,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 18:24:21,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:24:21,393 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 18:24:21,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 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-11-14 18:24:21,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:21,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-14 18:24:21,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-14 18:24:21,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:24:21,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:21,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 18:24:21,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 18:24:21,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:21,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 18:24:21,637 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 18:24:21,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 18:24:21,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1721960440, now seen corresponding path program 1 times [2024-11-14 18:24:21,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 18:24:21,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316591820] [2024-11-14 18:24:21,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 18:24:21,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 18:24:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 18:24:21,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 18:24:21,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 18:24:21,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316591820] [2024-11-14 18:24:21,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316591820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 18:24:21,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 18:24:21,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 18:24:21,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782835437] [2024-11-14 18:24:21,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 18:24:21,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 18:24:21,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 18:24:21,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 18:24:21,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 18:24:21,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:24:21,749 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 18:24:21,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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-11-14 18:24:21,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:21,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-14 18:24:21,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-14 18:24:21,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:21,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:24:22,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:22,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 18:24:22,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 18:24:22,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:22,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 18:24:22,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 18:24:22,219 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 18:24:22,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 18:24:22,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1591774546, now seen corresponding path program 1 times [2024-11-14 18:24:22,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 18:24:22,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218546998] [2024-11-14 18:24:22,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 18:24:22,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 18:24:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 18:24:22,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 18:24:22,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 18:24:22,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218546998] [2024-11-14 18:24:22,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218546998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 18:24:22,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 18:24:22,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 18:24:22,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767155715] [2024-11-14 18:24:22,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 18:24:22,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 18:24:22,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 18:24:22,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 18:24:22,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 18:24:22,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:24:22,376 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 18:24:22,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 18:24:22,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:22,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-14 18:24:22,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-14 18:24:22,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:22,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 18:24:22,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:24:22,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:22,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 18:24:22,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 18:24:22,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:22,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 18:24:22,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 18:24:22,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 18:24:22,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 18:24:22,491 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-14 18:24:22,492 INFO L320 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/3) [2024-11-14 18:24:22,499 INFO L123 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 18:24:22,499 INFO L185 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-14 18:24:22,500 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-14 18:24:22,500 INFO L333 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, 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;@432bb378, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 18:24:22,500 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-14 18:24:22,524 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 18:24:22,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 18:24:22,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1830851417, now seen corresponding path program 1 times [2024-11-14 18:24:22,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 18:24:22,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244775696] [2024-11-14 18:24:22,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 18:24:22,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 18:24:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 18:24:22,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 18:24:22,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 18:24:22,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244775696] [2024-11-14 18:24:22,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244775696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 18:24:22,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 18:24:22,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 18:24:22,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473855396] [2024-11-14 18:24:22,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 18:24:22,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 18:24:22,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 18:24:22,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 18:24:22,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 18:24:22,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:24:22,551 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 18:24:22,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 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-11-14 18:24:22,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:24:22,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:24:22,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-14 18:24:22,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-11-14 18:24:22,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-14 18:24:22,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 18:24:22,614 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-14 18:24:22,615 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (2/3) [2024-11-14 18:24:22,617 INFO L123 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 18:24:22,617 INFO L185 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-14 18:24:22,618 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork1 ======== [2024-11-14 18:24:22,618 INFO L333 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, 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;@432bb378, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 18:24:22,618 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 18:24:22,632 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 18:24:22,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 18:24:22,633 INFO L85 PathProgramCache]: Analyzing trace with hash -235332157, now seen corresponding path program 1 times [2024-11-14 18:24:22,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 18:24:22,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359607518] [2024-11-14 18:24:22,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 18:24:22,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 18:24:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 18:24:22,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 18:24:22,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 18:24:22,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359607518] [2024-11-14 18:24:22,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359607518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 18:24:22,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 18:24:22,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 18:24:22,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291854388] [2024-11-14 18:24:22,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 18:24:22,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 18:24:22,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 18:24:22,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 18:24:22,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 18:24:22,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:24:22,701 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 18:24:22,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.0) internal successors, (188), 4 states have internal predecessors, (188), 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-11-14 18:24:22,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:24:22,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:22,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 18:24:22,759 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 18:24:22,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 18:24:22,759 INFO L85 PathProgramCache]: Analyzing trace with hash -617602791, now seen corresponding path program 1 times [2024-11-14 18:24:22,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 18:24:22,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646205154] [2024-11-14 18:24:22,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 18:24:22,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 18:24:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 18:24:22,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 18:24:22,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 18:24:22,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646205154] [2024-11-14 18:24:22,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646205154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 18:24:22,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 18:24:22,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 18:24:22,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209829307] [2024-11-14 18:24:22,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 18:24:22,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 18:24:22,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 18:24:22,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 18:24:22,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 18:24:22,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:24:22,882 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 18:24:22,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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-11-14 18:24:22,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:22,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:24:23,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:23,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 18:24:23,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 18:24:23,098 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 18:24:23,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 18:24:23,099 INFO L85 PathProgramCache]: Analyzing trace with hash 433840297, now seen corresponding path program 1 times [2024-11-14 18:24:23,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 18:24:23,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657481710] [2024-11-14 18:24:23,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 18:24:23,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 18:24:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 18:24:23,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 18:24:23,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 18:24:23,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657481710] [2024-11-14 18:24:23,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657481710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 18:24:23,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 18:24:23,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 18:24:23,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280948797] [2024-11-14 18:24:23,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 18:24:23,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 18:24:23,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 18:24:23,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 18:24:23,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 18:24:23,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:24:23,224 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 18:24:23,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 18:24:23,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:23,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 18:24:23,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:24:23,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:23,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 18:24:23,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:23,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 18:24:23,281 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 18:24:23,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 18:24:23,281 INFO L85 PathProgramCache]: Analyzing trace with hash 878162727, now seen corresponding path program 1 times [2024-11-14 18:24:23,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 18:24:23,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990322772] [2024-11-14 18:24:23,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 18:24:23,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 18:24:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 18:24:24,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 18:24:24,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 18:24:24,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990322772] [2024-11-14 18:24:24,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990322772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 18:24:24,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 18:24:24,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-14 18:24:24,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14877310] [2024-11-14 18:24:24,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 18:24:24,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-14 18:24:24,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 18:24:24,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-14 18:24:24,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-14 18:24:24,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:24:24,155 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 18:24:24,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 14 states have internal predecessors, (246), 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-11-14 18:24:24,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:24,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 18:24:24,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:24,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:24:24,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:24,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 18:24:24,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:24,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 18:24:24,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 18:24:24,736 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 18:24:24,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 18:24:24,736 INFO L85 PathProgramCache]: Analyzing trace with hash -49101854, now seen corresponding path program 1 times [2024-11-14 18:24:24,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 18:24:24,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337394725] [2024-11-14 18:24:24,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 18:24:24,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 18:24:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 18:24:25,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 18:24:25,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 18:24:25,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337394725] [2024-11-14 18:24:25,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337394725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 18:24:25,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 18:24:25,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-14 18:24:25,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915912867] [2024-11-14 18:24:25,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 18:24:25,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 18:24:25,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 18:24:25,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 18:24:25,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-14 18:24:25,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:24:25,275 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 18:24:25,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.833333333333332) internal successors, (250), 12 states have internal predecessors, (250), 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-11-14 18:24:25,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:25,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 18:24:25,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:25,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-14 18:24:25,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:24:25,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:25,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 18:24:25,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:25,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 18:24:25,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 18:24:25,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 18:24:25,744 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 18:24:25,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 18:24:25,745 INFO L85 PathProgramCache]: Analyzing trace with hash 114761740, now seen corresponding path program 1 times [2024-11-14 18:24:25,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 18:24:25,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414149015] [2024-11-14 18:24:25,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 18:24:25,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 18:24:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 18:24:27,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 18:24:27,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 18:24:27,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414149015] [2024-11-14 18:24:27,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414149015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 18:24:27,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 18:24:27,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-11-14 18:24:27,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706900437] [2024-11-14 18:24:27,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 18:24:27,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-14 18:24:27,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 18:24:27,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-14 18:24:27,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2024-11-14 18:24:27,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:24:27,179 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 18:24:27,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 11.363636363636363) internal successors, (250), 22 states have internal predecessors, (250), 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-11-14 18:24:27,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:27,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 18:24:27,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:27,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-14 18:24:27,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-14 18:24:27,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:24:28,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:28,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 18:24:28,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:28,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 18:24:28,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 18:24:28,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 18:24:28,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 18:24:28,162 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 18:24:28,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 18:24:28,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1989621319, now seen corresponding path program 1 times [2024-11-14 18:24:28,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 18:24:28,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175312570] [2024-11-14 18:24:28,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 18:24:28,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 18:24:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 18:24:31,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 18:24:31,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 18:24:31,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175312570] [2024-11-14 18:24:31,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175312570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 18:24:31,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 18:24:31,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2024-11-14 18:24:31,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541477747] [2024-11-14 18:24:31,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 18:24:31,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-14 18:24:31,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 18:24:31,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-14 18:24:31,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=794, Unknown=0, NotChecked=0, Total=930 [2024-11-14 18:24:31,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:24:31,069 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 18:24:31,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 8.193548387096774) internal successors, (254), 31 states have internal predecessors, (254), 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-11-14 18:24:31,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:31,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 18:24:31,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:31,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-14 18:24:31,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-14 18:24:31,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-11-14 18:24:31,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:24:32,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:32,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 18:24:32,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:32,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 18:24:32,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 18:24:32,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 18:24:32,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-14 18:24:32,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 18:24:32,743 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 18:24:32,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 18:24:32,743 INFO L85 PathProgramCache]: Analyzing trace with hash 694028490, now seen corresponding path program 1 times [2024-11-14 18:24:32,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 18:24:32,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132457225] [2024-11-14 18:24:32,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 18:24:32,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 18:24:32,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 18:24:38,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 18:24:38,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 18:24:38,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132457225] [2024-11-14 18:24:38,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132457225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 18:24:38,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 18:24:38,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2024-11-14 18:24:38,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339546494] [2024-11-14 18:24:38,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 18:24:38,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-14 18:24:38,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 18:24:38,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-14 18:24:38,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1637, Unknown=0, NotChecked=0, Total=1806 [2024-11-14 18:24:38,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:24:38,699 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 18:24:38,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 5.953488372093023) internal successors, (256), 43 states have internal predecessors, (256), 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-11-14 18:24:38,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:38,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 18:24:38,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:38,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-14 18:24:38,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-14 18:24:38,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-11-14 18:24:38,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-11-14 18:24:38,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:24:42,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:42,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 18:24:42,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:42,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 18:24:42,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 18:24:42,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 18:24:42,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-14 18:24:42,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-11-14 18:24:42,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-14 18:24:42,860 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 18:24:42,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 18:24:42,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1258084925, now seen corresponding path program 1 times [2024-11-14 18:24:42,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 18:24:42,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101208907] [2024-11-14 18:24:42,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 18:24:42,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 18:24:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 18:24:45,723 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 18:24:45,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 18:24:45,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101208907] [2024-11-14 18:24:45,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101208907] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 18:24:45,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040238401] [2024-11-14 18:24:45,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 18:24:45,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 18:24:45,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 18:24:45,730 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 18:24:45,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 18:24:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 18:24:45,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 88 conjuncts are in the unsatisfiable core [2024-11-14 18:24:45,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 18:24:46,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 18:24:46,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-14 18:24:46,493 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 18:24:46,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 18:24:46,508 INFO L349 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2024-11-14 18:24:46,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 28 [2024-11-14 18:24:46,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 18:24:46,548 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 18:24:46,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2024-11-14 18:24:46,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2024-11-14 18:24:46,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 18:24:46,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 18:24:47,003 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 18:24:47,010 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-11-14 18:24:47,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2024-11-14 18:24:47,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 18:24:47,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-14 18:24:47,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2024-11-14 18:24:47,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 18:24:47,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 18:24:47,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 18:24:47,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-14 18:24:47,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-14 18:24:47,592 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 18:24:47,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-14 18:24:47,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-14 18:24:47,634 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 18:24:47,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 18:24:53,014 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1246) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) (not (= 20 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1)))))) is different from false [2024-11-14 18:24:53,077 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1246) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|)))) is different from false [2024-11-14 18:24:53,088 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1246) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|)))) is different from false [2024-11-14 18:24:53,098 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1246) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1) 20))))) is different from false [2024-11-14 18:24:53,148 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1246) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|)))) is different from false [2024-11-14 18:24:53,197 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1246) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|)))) is different from false [2024-11-14 18:24:53,219 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1246) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|) .cse3))) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|))))))) is different from false [2024-11-14 18:24:53,255 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse4 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1246) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|) .cse1) 20)) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|))))) is different from false [2024-11-14 18:24:53,860 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| Int) (v_ArrVal_1241 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse3 (+ 88 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1246) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) (not (= 20 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|) .cse1))) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|))))) is different from false [2024-11-14 18:24:54,451 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| Int) (v_ArrVal_1241 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_33| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1246) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|) .cse1) 20)) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|)))))) is different from false [2024-11-14 18:24:54,539 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| Int) (v_ArrVal_1241 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_33| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1246) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|)))))) is different from false [2024-11-14 18:24:54,563 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| Int) (v_ArrVal_1241 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_33| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1246) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|) .cse1) 20))))))) (< (select .cse7 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|)))) is different from false [2024-11-14 18:24:54,621 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| Int) (v_ArrVal_1241 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse7 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse7 .cse3) 1)))))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse4 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|))) (store (store .cse6 (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_33| 1)) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1246) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) (not (= 20 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|) .cse1))) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|))))))) is different from false [2024-11-14 18:24:55,872 INFO L349 Elim1Store]: treesize reduction 312, result has 39.3 percent of original size [2024-11-14 18:24:55,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 660 treesize of output 419 [2024-11-14 18:24:55,902 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-14 18:24:55,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 409 treesize of output 385 [2024-11-14 18:24:55,984 INFO L349 Elim1Store]: treesize reduction 72, result has 52.3 percent of original size [2024-11-14 18:24:55,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 275 treesize of output 292 [2024-11-14 18:24:56,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 18:24:56,016 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 377 treesize of output 377 [2024-11-14 18:24:56,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 18:24:56,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 294 treesize of output 284 [2024-11-14 18:24:56,091 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 146 treesize of output 130 [2024-11-14 18:24:56,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-14 18:24:56,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-14 18:24:56,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 18:24:56,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 86 [2024-11-14 18:24:56,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 18:24:56,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 241 treesize of output 227 [2024-11-14 18:24:56,848 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2024-11-14 18:24:56,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040238401] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 18:24:56,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 18:24:56,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28, 34] total 88 [2024-11-14 18:24:56,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402944097] [2024-11-14 18:24:56,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 18:24:56,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2024-11-14 18:24:56,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 18:24:56,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2024-11-14 18:24:56,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=4965, Unknown=35, NotChecked=2054, Total=7656 [2024-11-14 18:24:56,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:24:56,852 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 18:24:56,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 9.704545454545455) internal successors, (854), 88 states have internal predecessors, (854), 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-11-14 18:24:56,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:56,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 18:24:56,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:24:56,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-14 18:24:56,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-14 18:24:56,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-11-14 18:24:56,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-11-14 18:24:56,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-11-14 18:24:56,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:25:06,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 18:25:09,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 18:25:11,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 18:25:13,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 18:25:15,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 18:25:16,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:25:16,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 18:25:16,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:25:16,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 18:25:16,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 18:25:16,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 18:25:16,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-14 18:25:16,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-11-14 18:25:16,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-14 18:25:16,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 18:25:16,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-14 18:25:16,824 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 18:25:16,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 18:25:16,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1610772472, now seen corresponding path program 1 times [2024-11-14 18:25:16,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 18:25:16,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943638646] [2024-11-14 18:25:16,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 18:25:16,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 18:25:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 18:25:22,535 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 18:25:22,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 18:25:22,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943638646] [2024-11-14 18:25:22,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943638646] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 18:25:22,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142226126] [2024-11-14 18:25:22,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 18:25:22,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 18:25:22,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 18:25:22,538 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 18:25:22,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 18:25:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 18:25:22,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 868 conjuncts, 120 conjuncts are in the unsatisfiable core [2024-11-14 18:25:22,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 18:25:23,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 18:25:23,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-14 18:25:23,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 18:25:23,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-11-14 18:25:23,857 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 18:25:23,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 18:25:23,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 18:25:23,887 INFO L349 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2024-11-14 18:25:23,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 40 [2024-11-14 18:25:23,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 18:25:23,951 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 18:25:23,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 28 [2024-11-14 18:25:24,221 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 18:25:24,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 25 [2024-11-14 18:25:24,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 18:25:24,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-14 18:25:24,893 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 18:25:24,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 18:25:24,913 INFO L349 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2024-11-14 18:25:24,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 28 [2024-11-14 18:25:24,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 18:25:24,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 18:25:24,964 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 38 treesize of output 25 [2024-11-14 18:25:25,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2024-11-14 18:25:25,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 18:25:25,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-14 18:25:25,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 18:25:25,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 18:25:25,764 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 38 treesize of output 25 [2024-11-14 18:25:26,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 18:25:26,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 25 [2024-11-14 18:25:26,546 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 18:25:26,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 18:25:26,569 INFO L349 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2024-11-14 18:25:26,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 28 [2024-11-14 18:25:26,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 18:25:26,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 18:25:26,633 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 38 treesize of output 25 [2024-11-14 18:25:26,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 18:25:26,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 16 [2024-11-14 18:25:26,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 18:25:26,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 18:25:26,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-14 18:25:27,026 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 18:25:27,026 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 18:25:46,728 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (or (< |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (forall ((v_ArrVal_1538 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1531 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1531) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (let ((.cse2 (+ |c_~#queue~0.offset| 80))) (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1538) |c_~#queue~0.base|) .cse2)))) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|))))))) is different from false [2024-11-14 18:25:46,743 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1538 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1531 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1531) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (let ((.cse2 (+ |c_~#queue~0.offset| 80))) (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1538) |c_~#queue~0.base|) .cse2)))) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|)))))) is different from false [2024-11-14 18:25:48,010 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse5 .cse6))) (or (= .cse0 20) (forall ((v_ArrVal_1538 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1531 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))))) (let ((.cse2 (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_1531) |c_~#queue~0.base|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (or (not (= (let ((.cse3 (+ |c_~#queue~0.offset| 80))) (select (select (store (store .cse1 |c_~#queue~0.base| (store (store (store (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1538) |c_~#queue~0.base|) .cse3)) 20)) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (< (select .cse2 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|)))))))) is different from false [2024-11-14 18:25:48,082 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse5 .cse6))) (or (forall ((v_ArrVal_1538 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1531 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1531) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (let ((.cse2 (+ |c_~#queue~0.offset| 80))) (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1538) |c_~#queue~0.base|) .cse2)))) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|))))) (= .cse4 20))))) is different from false [2024-11-14 18:26:04,448 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1538 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1531 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse7 (store .cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))))) (let ((.cse2 (select .cse7 .cse4)) (.cse0 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1531) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< .cse2 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (= .cse2 20) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (not (= (let ((.cse6 (+ |c_~#queue~0.offset| 80))) (select (select (store (store .cse5 |c_~#queue~0.base| (store (store (store (store .cse0 .cse6 (+ (select .cse0 .cse6) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1538) |c_~#queue~0.base|) .cse6)) 20)))))))) is different from false [2024-11-14 18:26:09,539 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1527 (Array Int Int)) (v_ArrVal_1538 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1531 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse5 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1527) |c_~#queue~0.base|))) (let ((.cse6 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_1531) |c_~#queue~0.base|)) (.cse0 (select .cse6 .cse2))) (or (= .cse0 20) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (not (= (let ((.cse3 (+ |c_~#queue~0.offset| 80))) (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse1 .cse3 (+ (select .cse1 .cse3) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1538) |c_~#queue~0.base|) .cse3)) 20)) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)))))) is different from false [2024-11-14 18:26:09,781 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1527 (Array Int Int)) (v_ArrVal_1538 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1531 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1527) |c_~#queue~0.base|))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse7 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse7 .cse1)) (.cse4 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse7 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_1531) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (= .cse2 20) (not (= (let ((.cse5 (+ |c_~#queue~0.offset| 80))) (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse4 .cse5 (+ (select .cse4 .cse5) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1538) |c_~#queue~0.base|) .cse5)) 20)) (< .cse2 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|))))))) is different from false [2024-11-14 18:26:10,055 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1527 (Array Int Int)) (v_ArrVal_1538 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1531 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse8 .cse9 (+ (select .cse8 .cse9) 1)))))) (let ((.cse0 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1527) |c_~#queue~0.base|))) (let ((.cse7 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse7 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_1531) |c_~#queue~0.base|)) (.cse3 (select .cse7 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< .cse3 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (not (= (let ((.cse5 (+ |c_~#queue~0.offset| 80))) (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse2 .cse5 (+ (select .cse2 .cse5) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1538) |c_~#queue~0.base|) .cse5)) 20)) (= 20 .cse3))))))) is different from false [2024-11-14 18:26:10,226 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1527 (Array Int Int)) (v_ArrVal_1538 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1531 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_48| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ (select .cse8 .cse9) 1)))))) (let ((.cse3 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1527) |c_~#queue~0.base|))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse7 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse7 .cse2)) (.cse1 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse7 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_48| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_1531) |c_~#queue~0.base|))) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (= .cse0 20) (not (= (let ((.cse5 (+ |c_~#queue~0.offset| 80))) (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse1 .cse5 (+ (select .cse1 .cse5) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1538) |c_~#queue~0.base|) .cse5)) 20)))))))) is different from false [2024-11-14 18:26:10,367 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1527 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (v_ArrVal_1538 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1531 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_48| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse8 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ (select .cse8 .cse9) 1)))))) (let ((.cse6 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1527) |c_~#queue~0.base|))) (let ((.cse7 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse7 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_48| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_1531) |c_~#queue~0.base|)) (.cse2 (select .cse7 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (= .cse2 20) (not (= (let ((.cse4 (+ |c_~#queue~0.offset| 80))) (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse0 .cse4 (+ (select .cse0 .cse4) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1538) |c_~#queue~0.base|) .cse4)) 20)) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (< .cse2 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|))))))) is different from false [2024-11-14 18:26:10,420 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) (forall ((v_ArrVal_1527 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (v_ArrVal_1538 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1531 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_48| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse10 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse10 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse10 .cse1) 1)))))) (let ((.cse8 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1527) |c_~#queue~0.base|))) (let ((.cse9 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse9 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_48| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_1531) |c_~#queue~0.base|)) (.cse4 (select .cse9 .cse3))) (or (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (= .cse4 20) (not (= (let ((.cse6 (+ |c_~#queue~0.offset| 80))) (select (select (store (store .cse5 |c_~#queue~0.base| (store (store (store (store .cse2 .cse6 (+ (select .cse2 .cse6) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1538) |c_~#queue~0.base|) .cse6)) 20)) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|)))))))))) is different from false [2024-11-14 18:26:10,521 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1527 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (v_ArrVal_1538 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1531 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_48| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse10 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse10 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse10 .cse1) 1)))))) (let ((.cse8 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1527) |c_~#queue~0.base|))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse9 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|)) (.cse7 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse9 .cse7)) (.cse4 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse9 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_48| 1)) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_1531) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) (< .cse2 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (not (= (let ((.cse5 (+ |c_~#queue~0.offset| 80))) (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse4 .cse5 (+ (select .cse4 .cse5) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1538) |c_~#queue~0.base|) .cse5)) 20)) (< (select .cse8 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (= .cse2 20) (< (select .cse4 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|)))))))) is different from false [2024-11-14 18:26:20,799 INFO L349 Elim1Store]: treesize reduction 462, result has 37.0 percent of original size [2024-11-14 18:26:20,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 1049 treesize of output 653 [2024-11-14 18:26:20,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 18:26:20,843 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 574 treesize of output 572 [2024-11-14 18:26:20,865 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 58 treesize of output 54 [2024-11-14 18:26:20,881 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 66 treesize of output 54 [2024-11-14 18:26:20,897 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 13 treesize of output 9 [2024-11-14 18:26:20,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 25 treesize of output 13 [2024-11-14 18:26:21,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 18:26:21,075 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 111 treesize of output 119 [2024-11-14 18:26:21,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 25 treesize of output 13 [2024-11-14 18:26:21,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 18:26:21,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 279 treesize of output 295 [2024-11-14 18:26:23,636 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2024-11-14 18:26:23,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142226126] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 18:26:23,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 18:26:23,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 37, 45] total 118 [2024-11-14 18:26:23,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150486756] [2024-11-14 18:26:23,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 18:26:23,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 118 states [2024-11-14 18:26:23,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 18:26:23,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2024-11-14 18:26:23,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1194, Invalid=9857, Unknown=127, NotChecked=2628, Total=13806 [2024-11-14 18:26:23,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:26:23,644 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 18:26:23,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 118 states, 118 states have (on average 7.966101694915254) internal successors, (940), 118 states have internal predecessors, (940), 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-11-14 18:26:23,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:26:23,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 18:26:23,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:26:23,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-14 18:26:23,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-14 18:26:23,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-11-14 18:26:23,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-11-14 18:26:23,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-11-14 18:26:23,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-11-14 18:26:23,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 18:26:49,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:26:49,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 18:26:49,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 18:26:49,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 18:26:49,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 18:26:49,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 18:26:49,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-14 18:26:49,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-11-14 18:26:49,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-14 18:26:49,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-11-14 18:26:49,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-14 18:26:49,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-14 18:26:49,883 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 18:26:49,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 18:26:49,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1692506683, now seen corresponding path program 1 times [2024-11-14 18:26:49,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 18:26:49,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418100659] [2024-11-14 18:26:49,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 18:26:49,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 18:26:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 18:27:03,490 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 18:27:03,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 18:27:03,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418100659] [2024-11-14 18:27:03,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418100659] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 18:27:03,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842203883] [2024-11-14 18:27:03,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 18:27:03,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 18:27:03,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 18:27:03,493 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 18:27:03,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 18:27:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 18:27:03,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 154 conjuncts are in the unsatisfiable core [2024-11-14 18:27:03,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 18:27:04,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 18:27:04,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-14 18:27:04,877 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 26 treesize of output 28 [2024-11-14 18:27:06,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 18:27:06,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 18:27:06,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 18:27:06,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2024-11-14 18:27:06,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2024-11-14 18:27:07,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-14 18:27:07,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 18:27:07,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-14 18:27:09,750 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 26 treesize of output 28 [2024-11-14 18:27:10,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-11-14 18:27:10,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-11-14 18:27:10,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 18:27:10,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 37 [2024-11-14 18:27:12,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 18:27:12,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 40 [2024-11-14 18:27:13,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 18:27:13,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2024-11-14 18:27:15,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 18:27:15,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 40 [2024-11-14 18:27:15,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 18:27:15,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 40 [2024-11-14 18:27:15,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 18:27:15,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2024-11-14 18:27:16,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 18:27:16,246 INFO L349 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2024-11-14 18:27:16,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2024-11-14 18:27:17,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 18:27:17,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2024-11-14 18:27:17,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 18:27:17,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 25 [2024-11-14 18:27:17,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2024-11-14 18:27:18,344 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 19 treesize of output 7 [2024-11-14 18:27:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 18:27:18,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 18:27:19,339 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|)) (.cse0 (= |c_t2Thread1of1ForFork1_dequeue_#t~mem43#1| 0))) (and (or .cse0 (forall ((v_ArrVal_1831 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse1) 0)))) (or (forall ((v_ArrVal_1831 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse1) 1))) (not .cse0)))) is different from false [2024-11-14 18:27:26,450 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#queue~0.offset| 80)) (.cse1 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|)) (.cse5 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store (store .cse6 .cse7 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (store .cse4 |c_~#stored_elements~0.base| (store (select .cse4 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1829))))) (or (forall ((v_ArrVal_1831 (Array Int Int))) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse1) 0))) (= (let ((.cse2 (select .cse0 |c_~#queue~0.base|))) (select .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|))) 0)))) (forall ((v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse11 (let ((.cse12 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store (store .cse6 .cse7 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (store .cse12 |c_~#stored_elements~0.base| (store (select .cse12 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1829))))) (or (not (= (let ((.cse10 (select .cse11 |c_~#queue~0.base|))) (select .cse10 (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_1831 (Array Int Int))) (not (= (select (select (store .cse11 |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse1) 1)))))))) is different from false [2024-11-14 18:27:50,756 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse9 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse5 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse7 (+ (* (select .cse6 .cse9) 4) |c_~#queue~0.offset|)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse6 .cse7 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse3 (store (select .cse2 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1829))) (or (= (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base|))) (select .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)))) 0) (forall ((v_ArrVal_1831 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse4) 0))))))) (forall ((v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse12 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse6 .cse7 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse10 (store (select .cse12 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1829))) (or (forall ((v_ArrVal_1831 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse10) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse4) 1))) (not (= (let ((.cse11 (select (store .cse12 |c_~#stored_elements~0.base| .cse10) |c_~#queue~0.base|))) (select .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse1) 4)))) 0))))))))) is different from false [2024-11-14 18:29:15,690 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ 84 |c_~#queue~0.offset|)) (.cse13 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 80))) (let ((.cse0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse2 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse6 (store .cse13 .cse4 (+ (select .cse13 .cse4) 1))) (.cse7 (+ (* (select .cse13 .cse9) 4) |c_~#queue~0.offset|)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse5 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse6 .cse7 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse1 (store (select .cse5 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse0) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse2) 0)) (= (let ((.cse3 (select (store .cse5 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse3 (+ |c_~#queue~0.offset| (* 4 (select .cse3 .cse4))))) 0))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse11 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse6 .cse7 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse12 (store (select .cse11 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (let ((.cse10 (select (store .cse11 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (select .cse10 (+ |c_~#queue~0.offset| (* 4 (select .cse10 .cse4))))) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse0) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse2) 1))))))))) is different from false [2024-11-14 18:29:16,202 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* 4 |c_t2Thread1of1ForFork1_~i~1#1|)) (.cse2 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse4 (+ |c_~#queue~0.offset| 80)) (.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse8 (+ 84 |c_~#queue~0.offset|)) (.cse10 (select |c_#memory_int| |c_~#stored_elements~0.base|)) (.cse11 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse6 (store |c_#memory_int| |c_~#stored_elements~0.base| (store .cse10 (+ 4 |~#stored_elements~0.offset| .cse11) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse5 (store (store (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store (store .cse7 .cse4 (+ (select .cse7 .cse4) 1)) (+ (* (select .cse7 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (let ((.cse0 (store (select (store .cse6 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse1 4 |~#stored_elements~0.offset|)) 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse2) (not (= (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|))) (select .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)))) 0))))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse15 (store |c_#memory_int| |c_~#stored_elements~0.base| (store .cse10 (+ 4 |~#stored_elements~0.offset| .cse11) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse14 (store (store (let ((.cse16 (select .cse15 |c_~#queue~0.base|))) (store (store .cse16 .cse4 (+ (select .cse16 .cse4) 1)) (+ (* (select .cse16 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (let ((.cse12 (store (select (store .cse15 |c_~#queue~0.base| .cse14) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse1 4 |~#stored_elements~0.offset|)) 0)) (= (let ((.cse13 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse14) |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (select .cse13 (+ |c_~#queue~0.offset| (* (select .cse13 .cse4) 4)))) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse2)))))))) is different from false [2024-11-14 18:29:18,002 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse6 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse2 (* 4 |c_t2Thread1of1ForFork1_~i~1#1|)) (.cse4 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|)) (.cse11 (select .cse0 |c_~#stored_elements~0.base|)) (.cse12 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_5 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse7 (store .cse0 |c_~#stored_elements~0.base| (store .cse11 (+ 4 |~#stored_elements~0.offset| .cse12) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse5 (store (store (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store (store .cse8 .cse4 (+ (select .cse8 .cse4) 1)) (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ v_subst_5 1)))) (let ((.cse1 (store (select (store .cse7 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse2 4 |~#stored_elements~0.offset|)) 1)) (not (= (let ((.cse3 (select (store (store .cse0 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|))) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse6)))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_6 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse16 (store .cse0 |c_~#stored_elements~0.base| (store .cse11 (+ 4 |~#stored_elements~0.offset| .cse12) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse14 (store (store (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store (store .cse17 .cse4 (+ (select .cse17 .cse4) 1)) (+ (* (select .cse17 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ v_subst_6 1)))) (let ((.cse15 (store (select (store .cse16 |c_~#queue~0.base| .cse14) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (= (let ((.cse13 (select (store (store .cse0 |c_~#queue~0.base| .cse14) |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base|))) (select .cse13 (+ (* (select .cse13 .cse4) 4) |c_~#queue~0.offset|))) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse6) (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse2 4 |~#stored_elements~0.offset|)) 0)))))))))) is different from false [2024-11-14 18:29:18,159 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (let ((.cse3 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse2 (* 4 |c_t2Thread1of1ForFork1_~i~1#1|)) (.cse5 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|)) (.cse11 (select .cse0 |c_~#stored_elements~0.base|)) (.cse12 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_5 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse7 (store .cse0 |c_~#stored_elements~0.base| (store .cse11 (+ 4 |~#stored_elements~0.offset| .cse12) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse6 (store (store (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store (store .cse8 .cse5 (+ (select .cse8 .cse5) 1)) (+ |c_~#queue~0.offset| (* (select .cse8 .cse9) 4)) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ v_subst_5 1)))) (let ((.cse1 (store (select (store .cse7 |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse2 4 |~#stored_elements~0.offset|)) 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse3) (not (= 0 (let ((.cse4 (select (store (store .cse0 |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse4 (+ (* (select .cse4 .cse5) 4) |c_~#queue~0.offset|)))))))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_6 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse16 (store .cse0 |c_~#stored_elements~0.base| (store .cse11 (+ 4 |~#stored_elements~0.offset| .cse12) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse15 (store (store (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store (store .cse17 .cse5 (+ (select .cse17 .cse5) 1)) (+ |c_~#queue~0.offset| (* (select .cse17 .cse9) 4)) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ v_subst_6 1)))) (let ((.cse13 (store (select (store .cse16 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse3) (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse13) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse2 4 |~#stored_elements~0.offset|)) 0)) (= (let ((.cse14 (select (store (store .cse0 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base| .cse13) |c_~#queue~0.base|))) (select .cse14 (+ (* (select .cse14 .cse5) 4) |c_~#queue~0.offset|))) 0))))))))) is different from false [2024-11-14 18:29:18,280 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse18 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse19 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse18 .cse19 (+ (select .cse18 .cse19) 1)))))) (let ((.cse3 (* 4 |c_t2Thread1of1ForFork1_~i~1#1|)) (.cse0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse5 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|)) (.cse11 (select .cse1 |c_~#stored_elements~0.base|)) (.cse12 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_6 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse7 (store .cse1 |c_~#stored_elements~0.base| (store .cse11 (+ 4 |~#stored_elements~0.offset| .cse12) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse6 (store (store (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store (store .cse8 .cse5 (+ (select .cse8 .cse5) 1)) (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ v_subst_6 1)))) (let ((.cse2 (store (select (store .cse7 |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse0) (not (= (select (select (store (store .cse1 |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse3 4 |~#stored_elements~0.offset|)) 0)) (= (let ((.cse4 (select (store (store .cse1 |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base|))) (select .cse4 (+ (* (select .cse4 .cse5) 4) |c_~#queue~0.offset|))) 0)))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_5 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse16 (store .cse1 |c_~#stored_elements~0.base| (store .cse11 (+ 4 |~#stored_elements~0.offset| .cse12) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse15 (store (store (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store (store .cse17 .cse5 (+ (select .cse17 .cse5) 1)) (+ (* (select .cse17 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ v_subst_5 1)))) (let ((.cse13 (store (select (store .cse16 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse1 |c_~#stored_elements~0.base| .cse13) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse3 4 |~#stored_elements~0.offset|)) 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse0) (not (= (let ((.cse14 (select (store (store .cse1 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base| .cse13) |c_~#queue~0.base|))) (select .cse14 (+ (* (select .cse14 .cse5) 4) |c_~#queue~0.offset|))) 0)))))))))) is different from false [2024-11-14 18:29:18,910 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse14 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (* 4 |c_t2Thread1of1ForFork1_~i~1#1|)) (.cse5 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|)) (.cse11 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) (.cse13 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse15 (+ (select .cse12 .cse14) 1))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_7 Int) (v_subst_6 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse14 .cse15)))) (let ((.cse7 (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse11) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse3 (store (store (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)) (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse10 (+ v_subst_7 1)) .cse9 (+ v_subst_6 1)))) (let ((.cse4 (store (select (store .cse7 |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (= (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base|))) (select .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)))) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse5) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse6 4 |~#stored_elements~0.offset|)) 0)))))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (v_subst_5 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse16 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse14 .cse15)))) (let ((.cse20 (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse11) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse19 (store (store (let ((.cse21 (select .cse20 |c_~#queue~0.base|))) (store (store .cse21 .cse1 (+ (select .cse21 .cse1) 1)) (+ (* (select .cse21 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse10 (+ v_subst_8 1)) .cse9 (+ v_subst_5 1)))) (let ((.cse17 (store (select (store .cse20 |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse16 |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse6 4 |~#stored_elements~0.offset|)) 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse5) (not (= (let ((.cse18 (select (store (store .cse16 |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base|))) (select .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse1) 4)))) 0))))))))))) is different from false [2024-11-14 18:29:20,089 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse14 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (* 4 |c_t2Thread1of1ForFork1_~i~1#1|)) (.cse0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|)) (.cse11 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) (.cse13 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse15 (+ (select .cse12 .cse14) 1))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (v_subst_5 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse14 .cse15)))) (let ((.cse7 (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse11) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse4 (store (store (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store (store .cse8 .cse2 (+ (select .cse8 .cse2) 1)) (+ |c_~#queue~0.offset| (* (select .cse8 .cse9) 4)) v_subst_9)) .cse10 (+ v_subst_8 1)) .cse9 (+ v_subst_5 1)))) (let ((.cse5 (store (select (store .cse7 |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse0) (not (= (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base|))) (select .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)))) 0)) (not (= (select (select (store (store .cse3 |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse6 4 |~#stored_elements~0.offset|)) 1)))))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_7 Int) (v_subst_6 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (v_subst_10 Int)) (let ((.cse16 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse14 .cse15)))) (let ((.cse20 (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse11) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse19 (store (store (let ((.cse21 (select .cse20 |c_~#queue~0.base|))) (store (store .cse21 .cse2 (+ (select .cse21 .cse2) 1)) (+ |c_~#queue~0.offset| (* (select .cse21 .cse9) 4)) v_subst_10)) .cse10 (+ v_subst_7 1)) .cse9 (+ v_subst_6 1)))) (let ((.cse17 (store (select (store .cse20 |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse16 |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse6 4 |~#stored_elements~0.offset|)) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse0) (= (let ((.cse18 (select (store (store .cse16 |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base|))) (select .cse18 (+ (* 4 (select .cse18 .cse2)) |c_~#queue~0.offset|))) 0)))))))))) is different from false [2024-11-14 18:29:20,850 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse12 (let ((.cse22 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse22 (+ (* (select .cse22 .cse14) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork0_enqueue_~x#1|)))) (let ((.cse3 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse2 (* 4 |c_t2Thread1of1ForFork1_~i~1#1|)) (.cse5 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|)) (.cse11 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) (.cse13 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse15 (+ (select .cse12 .cse14) 1))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_7 Int) (v_subst_6 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (v_subst_10 Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse14 .cse15)))) (let ((.cse7 (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse11) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse6 (store (store (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store (store .cse8 .cse5 (+ (select .cse8 .cse5) 1)) (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) v_subst_10)) .cse10 (+ v_subst_7 1)) .cse9 (+ v_subst_6 1)))) (let ((.cse1 (store (select (store .cse7 |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse2 4 |~#stored_elements~0.offset|)) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse3) (= (let ((.cse4 (select (store (store .cse0 |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse5) 4)))) 0))))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (v_subst_5 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse17 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse14 .cse15)))) (let ((.cse20 (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse11) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse18 (store (store (let ((.cse21 (select .cse20 |c_~#queue~0.base|))) (store (store .cse21 .cse5 (+ (select .cse21 .cse5) 1)) (+ (* (select .cse21 .cse9) 4) |c_~#queue~0.offset|) v_subst_9)) .cse10 (+ v_subst_8 1)) .cse9 (+ v_subst_5 1)))) (let ((.cse19 (store (select (store .cse20 |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (let ((.cse16 (select (store (store .cse17 |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (select .cse16 (+ (* (select .cse16 .cse5) 4) |c_~#queue~0.offset|))) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse3) (not (= (select (select (store (store .cse17 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse2 4 |~#stored_elements~0.offset|)) 1)))))))))))) is different from false [2024-11-14 18:29:21,477 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse12 (let ((.cse22 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse22 (+ (* (select .cse22 .cse14) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork0_enqueue_#in~x#1|)))) (let ((.cse2 (* 4 |c_t2Thread1of1ForFork1_~i~1#1|)) (.cse3 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse5 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|)) (.cse11 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) (.cse13 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse15 (+ (select .cse12 .cse14) 1))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_7 Int) (v_subst_6 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (v_subst_10 Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse14 .cse15)))) (let ((.cse7 (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse11) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse6 (store (store (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store (store .cse8 .cse5 (+ (select .cse8 .cse5) 1)) (+ |c_~#queue~0.offset| (* 4 (select .cse8 .cse9))) v_subst_10)) .cse10 (+ v_subst_7 1)) .cse9 (+ v_subst_6 1)))) (let ((.cse1 (store (select (store .cse7 |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse2 4 |~#stored_elements~0.offset|)) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse3) (= (let ((.cse4 (select (store (store .cse0 |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse4 (+ |c_~#queue~0.offset| (* 4 (select .cse4 .cse5))))) 0))))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (v_subst_5 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse16 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse14 .cse15)))) (let ((.cse20 (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse11) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse19 (store (store (let ((.cse21 (select .cse20 |c_~#queue~0.base|))) (store (store .cse21 .cse5 (+ (select .cse21 .cse5) 1)) (+ |c_~#queue~0.offset| (* 4 (select .cse21 .cse9))) v_subst_9)) .cse10 (+ v_subst_8 1)) .cse9 (+ v_subst_5 1)))) (let ((.cse17 (store (select (store .cse20 |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse16 |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse2 4 |~#stored_elements~0.offset|)) 1)) (not (= (let ((.cse18 (select (store (store .cse16 |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base|))) (select .cse18 (+ (* (select .cse18 .cse5) 4) |c_~#queue~0.offset|))) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse3))))))))))) is different from false [2024-11-14 18:29:22,177 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse12 (let ((.cse22 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse22 (+ (* (select .cse22 .cse14) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) |c_t1Thread1of1ForFork0_enqueue_#in~x#1|)))) (let ((.cse5 (* 4 |c_t2Thread1of1ForFork1_~i~1#1|)) (.cse6 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|)) (.cse11 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) (.cse13 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse15 (+ (select .cse12 .cse14) 1))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (v_subst_5 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse12 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse14 .cse15)))) (let ((.cse7 (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse11) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse3 (store (store (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)) (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) v_subst_9)) .cse10 (+ v_subst_8 1)) .cse9 (+ v_subst_5 1)))) (let ((.cse4 (store (select (store .cse7 |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base|))) (select .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|))) 0)) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse5 4 |~#stored_elements~0.offset|)) 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse6))))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_7 Int) (v_subst_6 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (v_subst_10 Int)) (let ((.cse16 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse12 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse14 .cse15)))) (let ((.cse20 (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse11) |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse19 (store (store (let ((.cse21 (select .cse20 |c_~#queue~0.base|))) (store (store .cse21 .cse1 (+ (select .cse21 .cse1) 1)) (+ (* (select .cse21 .cse9) 4) |c_~#queue~0.offset|) v_subst_10)) .cse10 (+ v_subst_7 1)) .cse9 (+ v_subst_6 1)))) (let ((.cse17 (store (select (store .cse20 |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse16 |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse5 4 |~#stored_elements~0.offset|)) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse6) (= (let ((.cse18 (select (store (store .cse16 |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base|))) (select .cse18 (+ (* (select .cse18 .cse1) 4) |c_~#queue~0.offset|))) 0))))))))))) is different from false [2024-11-14 18:29:24,078 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse8 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse5 (* 4 |c_t2Thread1of1ForFork1_~i~1#1|)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse11 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse14 (+ (* (select .cse13 .cse8) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_7 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_6 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (v_subst_10 Int)) (let ((.cse9 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse12 (store .cse13 .cse14 |t1Thread1of1ForFork0_~value~0#1|))) (store (store .cse12 .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ (select .cse12 .cse8) 1)))))) (let ((.cse6 (store (select .cse9 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse11) |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse3 (store (store (let ((.cse7 (select (store .cse9 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse7 .cse2 (+ (select .cse7 .cse2) 1)) (+ (* (select .cse7 .cse8) 4) |c_~#queue~0.offset|) v_subst_10)) .cse10 (+ v_subst_7 1)) .cse8 (+ v_subst_6 1)))) (let ((.cse4 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse0) (= (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base|))) (select .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)))) 0) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse5 4 |~#stored_elements~0.offset|)) 0)))))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_5 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse20 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse21 (store .cse13 .cse14 |t1Thread1of1ForFork0_~value~0#1|))) (store (store .cse21 .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ (select .cse21 .cse8) 1)))))) (let ((.cse18 (store (select .cse20 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse11) |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse17 (store (store (let ((.cse19 (select (store .cse20 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base|))) (store (store .cse19 .cse2 (+ (select .cse19 .cse2) 1)) (+ (* (select .cse19 .cse8) 4) |c_~#queue~0.offset|) v_subst_9)) .cse10 (+ v_subst_8 1)) .cse8 (+ v_subst_5 1)))) (let ((.cse15 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse0) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ .cse5 4 |~#stored_elements~0.offset|)) 1)) (not (= (let ((.cse16 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base|))) (select .cse16 (+ (* 4 (select .cse16 .cse2)) |c_~#queue~0.offset|))) 0))))))))))) is different from false [2024-11-14 18:29:26,307 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse7 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse3 (+ |c_~#queue~0.offset| 80)) (.cse10 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) (.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse13 (+ (* (select .cse12 .cse7) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_5 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse8 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse11 (store .cse12 .cse13 |t1Thread1of1ForFork0_~value~0#1|))) (store (store .cse11 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse11 .cse7) 1)))))) (let ((.cse5 (store (select .cse8 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse10) |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse4 (store (store (let ((.cse6 (select (store .cse8 |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base|))) (store (store .cse6 .cse3 (+ (select .cse6 .cse3) 1)) (+ (* (select .cse6 .cse7) 4) |c_~#queue~0.offset|) v_subst_9)) .cse9 (+ v_subst_8 1)) .cse7 (+ v_subst_5 1)))) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset|)) 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse1) (not (= (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|))) (select .cse2 (+ (* 4 (select .cse2 .cse3)) |c_~#queue~0.offset|))) 0)))))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_7 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_6 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (v_subst_10 Int)) (let ((.cse19 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse20 (store .cse12 .cse13 |t1Thread1of1ForFork0_~value~0#1|))) (store (store .cse20 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse20 .cse7) 1)))))) (let ((.cse17 (store (select .cse19 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse10) |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse16 (store (store (let ((.cse18 (select (store .cse19 |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base|))) (store (store .cse18 .cse3 (+ (select .cse18 .cse3) 1)) (+ (* (select .cse18 .cse7) 4) |c_~#queue~0.offset|) v_subst_10)) .cse9 (+ v_subst_7 1)) .cse7 (+ v_subst_6 1)))) (let ((.cse14 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= 0 (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse14) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_28| .cse1) (= (let ((.cse15 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base| .cse14) |c_~#queue~0.base|))) (select .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse3) 4)))) 0)))))))))) is different from false [2024-11-14 18:29:28,022 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse7 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 80)) (.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse12 (+ (* (select .cse11 .cse7) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_5 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse8 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse10 (store .cse11 .cse12 |t1Thread1of1ForFork0_~value~0#1|))) (store (store .cse10 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse10 .cse7) 1))))) (.cse4 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse5 (store (select .cse8 |c_~#stored_elements~0.base|) .cse4 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse2 (store (store (let ((.cse6 (select (store .cse8 |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base|))) (store (store .cse6 .cse1 (+ (select .cse6 .cse1) 1)) (+ |c_~#queue~0.offset| (* (select .cse6 .cse7) 4)) v_subst_9)) .cse9 (+ v_subst_8 1)) .cse7 (+ v_subst_5 1)))) (let ((.cse3 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| .cse2) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse2) |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base|))) (select .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|))) 0)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse4) 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1))))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_7 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_6 Int) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (v_subst_10 Int)) (let ((.cse19 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse20 (store .cse11 .cse12 |t1Thread1of1ForFork0_~value~0#1|))) (store (store .cse20 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse20 .cse7) 1))))) (.cse16 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse17 (store (select .cse19 |c_~#stored_elements~0.base|) .cse16 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse14 (store (store (let ((.cse18 (select (store .cse19 |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base|))) (store (store .cse18 .cse1 (+ (select .cse18 .cse1) 1)) (+ |c_~#queue~0.offset| (* (select .cse18 .cse7) 4)) v_subst_10)) .cse9 (+ v_subst_7 1)) .cse7 (+ v_subst_6 1)))) (let ((.cse15 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base| .cse14) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (= (let ((.cse13 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse14) |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base|))) (select .cse13 (+ |c_~#queue~0.offset| (* 4 (select .cse13 .cse1))))) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse16) 0))))))))))) is different from false [2024-11-14 18:29:31,498 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#queue~0.offset| 80)) (.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse7 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_7 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_6 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (v_subst_10 Int)) (let ((.cse10 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1816))) (let ((.cse8 (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse7) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse11 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse11 .cse7) 1)))) (.cse1 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse5 (store (select (store .cse10 |c_~#queue~0.base| .cse8) |c_~#stored_elements~0.base|) .cse1 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse4 (store (store (let ((.cse6 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse8) |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base|))) (store (store .cse6 .cse3 (+ (select .cse6 .cse3) 1)) (+ (* (select .cse6 .cse7) 4) |c_~#queue~0.offset|) v_subst_10)) .cse9 (+ v_subst_7 1)) .cse7 (+ v_subst_6 1)))) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse1) 0)) (= (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|))) (select .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|))) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1)))))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_5 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse20 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1816))) (let ((.cse19 (let ((.cse21 (let ((.cse22 (select .cse20 |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse7) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse21 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse21 .cse7) 1)))) (.cse14 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse17 (store (select (store .cse20 |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base|) .cse14 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse16 (store (store (let ((.cse18 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base|))) (store (store .cse18 .cse3 (+ (select .cse18 .cse3) 1)) (+ (* (select .cse18 .cse7) 4) |c_~#queue~0.offset|) v_subst_9)) .cse9 (+ v_subst_8 1)) .cse7 (+ v_subst_5 1)))) (let ((.cse13 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse13) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse14) 1)) (not (= (let ((.cse15 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base| .cse13) |c_~#queue~0.base|))) (select .cse15 (+ (* (select .cse15 .cse3) 4) |c_~#queue~0.offset|))) 0))))))))))) is different from false [2024-11-14 18:29:36,271 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse8 (+ 84 |c_~#queue~0.offset|)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_7 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_6 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (v_subst_10 Int)) (let ((.cse11 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1816))) (let ((.cse9 (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* (select .cse13 .cse8) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse12 .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ (select .cse12 .cse8) 1)))) (.cse2 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse6 (store (select (store .cse11 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse5 (store (store (let ((.cse7 (select (store (store .cse0 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse7 .cse4 (+ (select .cse7 .cse4) 1)) (+ (* (select .cse7 .cse8) 4) |c_~#queue~0.offset|) v_subst_10)) .cse10 (+ v_subst_7 1)) .cse8 (+ v_subst_6 1)))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= 0 (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse2))) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1) (= (let ((.cse3 (select (store (store .cse0 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|))) 0)))))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_5 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse21 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1816))) (let ((.cse20 (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ |c_~#queue~0.offset| (* (select .cse23 .cse8) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse22 .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ (select .cse22 .cse8) 1)))) (.cse15 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse18 (store (select (store .cse21 |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base|) .cse15 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse17 (store (store (let ((.cse19 (select (store (store .cse0 |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base|))) (store (store .cse19 .cse4 (+ (select .cse19 .cse4) 1)) (+ (* (select .cse19 .cse8) 4) |c_~#queue~0.offset|) v_subst_9)) .cse10 (+ v_subst_8 1)) .cse8 (+ v_subst_5 1)))) (let ((.cse14 (store (select (store (store .cse0 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse14) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse15) 1)) (not (= (let ((.cse16 (select (store (store .cse0 |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base| .cse14) |c_~#queue~0.base|))) (select .cse16 (+ (* (select .cse16 .cse4) 4) |c_~#queue~0.offset|))) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1)))))))))) is different from false [2024-11-14 18:29:36,670 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse8 (+ 84 |c_~#queue~0.offset|)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_5 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse11 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1816))) (let ((.cse9 (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse12 .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ (select .cse12 .cse8) 1)))) (.cse2 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse6 (store (select (store .cse11 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse5 (store (store (let ((.cse7 (select (store (store .cse0 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse7 .cse4 (+ (select .cse7 .cse4) 1)) (+ (* (select .cse7 .cse8) 4) |c_~#queue~0.offset|) v_subst_9)) .cse10 (+ v_subst_8 1)) .cse8 (+ v_subst_5 1)))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse2) 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1) (not (= (let ((.cse3 (select (store (store .cse0 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|))) 0))))))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_7 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_6 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (v_subst_10 Int)) (let ((.cse21 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1816))) (let ((.cse20 (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse22 .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ (select .cse22 .cse8) 1)))) (.cse15 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse18 (store (select (store .cse21 |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base|) .cse15 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse17 (store (store (let ((.cse19 (select (store (store .cse0 |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base|))) (store (store .cse19 .cse4 (+ (select .cse19 .cse4) 1)) (+ (* (select .cse19 .cse8) 4) |c_~#queue~0.offset|) v_subst_10)) .cse10 (+ v_subst_7 1)) .cse8 (+ v_subst_6 1)))) (let ((.cse14 (store (select (store (store .cse0 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= 0 (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse14) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse15))) (= (let ((.cse16 (select (store (store .cse0 |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base| .cse14) |c_~#queue~0.base|))) (select .cse16 (+ (* 4 (select .cse16 .cse4)) |c_~#queue~0.offset|))) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1)))))))))) is different from false [2024-11-14 18:29:37,099 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse8 (+ 84 |c_~#queue~0.offset|)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse24 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse25 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse24 .cse25 (+ (select .cse24 .cse25) 1)))))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_7 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_6 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (v_subst_10 Int)) (let ((.cse11 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1816))) (let ((.cse9 (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse12 .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ (select .cse12 .cse8) 1)))) (.cse2 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse6 (store (select (store .cse11 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse5 (store (store (let ((.cse7 (select (store (store .cse0 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse7 .cse4 (+ (select .cse7 .cse4) 1)) (+ (* (select .cse7 .cse8) 4) |c_~#queue~0.offset|) v_subst_10)) .cse10 (+ v_subst_7 1)) .cse8 (+ v_subst_6 1)))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse2) 0)) (= (let ((.cse3 (select (store (store .cse0 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)))) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1)))))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_5 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse21 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1816))) (let ((.cse20 (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse22 .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ (select .cse22 .cse8) 1)))) (.cse15 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse18 (store (select (store .cse21 |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base|) .cse15 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse17 (store (store (let ((.cse19 (select (store (store .cse0 |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base|))) (store (store .cse19 .cse4 (+ (select .cse19 .cse4) 1)) (+ (* (select .cse19 .cse8) 4) |c_~#queue~0.offset|) v_subst_9)) .cse10 (+ v_subst_8 1)) .cse8 (+ v_subst_5 1)))) (let ((.cse14 (store (select (store (store .cse0 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse14) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse15) 1)) (not (= (let ((.cse16 (select (store (store .cse0 |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base| .cse14) |c_~#queue~0.base|))) (select .cse16 (+ (* (select .cse16 .cse4) 4) |c_~#queue~0.offset|))) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1)))))))))) is different from false [2024-11-14 18:29:41,033 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse16 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse8 (+ 84 |c_~#queue~0.offset|)) (.cse15 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse17 (+ (select .cse14 .cse16) 1))) (and (forall ((v_subst_12 Int) (v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_5 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse14 .cse15 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse16 .cse17)))) (let ((.cse11 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1816))) (let ((.cse9 (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* (select .cse13 .cse8) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse12 .cse10 (+ v_subst_12 1)) .cse8 (+ (select .cse12 .cse8) 1)))) (.cse2 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse6 (store (select (store .cse11 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse5 (store (store (let ((.cse7 (select (store (store .cse0 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse7 .cse4 (+ (select .cse7 .cse4) 1)) (+ (* 4 (select .cse7 .cse8)) |c_~#queue~0.offset|) v_subst_9)) .cse10 (+ v_subst_8 1)) .cse8 (+ v_subst_5 1)))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse2) 1)) (not (= (let ((.cse3 (select (store (store .cse0 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse3 (+ (* 4 (select .cse3 .cse4)) |c_~#queue~0.offset|))) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1))))))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_7 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_6 Int) (v_subst_11 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (v_subst_10 Int)) (let ((.cse19 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse14 .cse15 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse16 .cse17)))) (let ((.cse26 (store .cse19 |c_~#stored_elements~0.base| v_ArrVal_1816))) (let ((.cse25 (let ((.cse27 (let ((.cse28 (select .cse26 |c_~#queue~0.base|))) (store .cse28 (+ |c_~#queue~0.offset| (* (select .cse28 .cse8) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse27 .cse10 (+ v_subst_11 1)) .cse8 (+ (select .cse27 .cse8) 1)))) (.cse22 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse23 (store (select (store .cse26 |c_~#queue~0.base| .cse25) |c_~#stored_elements~0.base|) .cse22 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse20 (store (store (let ((.cse24 (select (store (store .cse19 |c_~#queue~0.base| .cse25) |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base|))) (store (store .cse24 .cse4 (+ (select .cse24 .cse4) 1)) (+ (* 4 (select .cse24 .cse8)) |c_~#queue~0.offset|) v_subst_10)) .cse10 (+ v_subst_7 1)) .cse8 (+ v_subst_6 1)))) (let ((.cse21 (store (select (store (store .cse19 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (= 0 (let ((.cse18 (select (store (store .cse19 |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base|))) (select .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse4) 4))))) (not (= (select (select (store (store .cse19 |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse22) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1)))))))))))) is different from false [2024-11-14 18:29:44,152 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse8 (+ 84 |c_~#queue~0.offset|)) (.cse15 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse16 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse17 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse18 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_7 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_6 Int) (v_subst_11 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (v_subst_10 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse14 (store .cse17 .cse18 |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse14 .cse15 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse16 (+ (select .cse14 .cse16) 1)))))) (let ((.cse11 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1816))) (let ((.cse9 (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse12 .cse10 (+ v_subst_11 1)) .cse8 (+ (select .cse12 .cse8) 1)))) (.cse5 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse6 (store (select (store .cse11 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse3 (store (store (let ((.cse7 (select (store (store .cse2 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse7 .cse1 (+ (select .cse7 .cse1) 1)) (+ |c_~#queue~0.offset| (* (select .cse7 .cse8) 4)) v_subst_10)) .cse10 (+ v_subst_7 1)) .cse8 (+ v_subst_6 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (= (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base|))) (select .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|))) 0) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse5) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1))))))))) (forall ((v_subst_12 Int) (v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_5 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse19 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse30 (store .cse17 .cse18 |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse30 .cse15 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse16 (+ (select .cse30 .cse16) 1)))))) (let ((.cse27 (store .cse19 |c_~#stored_elements~0.base| v_ArrVal_1816))) (let ((.cse26 (let ((.cse28 (let ((.cse29 (select .cse27 |c_~#queue~0.base|))) (store .cse29 (+ (* (select .cse29 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse28 .cse10 (+ v_subst_12 1)) .cse8 (+ (select .cse28 .cse8) 1)))) (.cse21 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse24 (store (select (store .cse27 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base|) .cse21 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse23 (store (store (let ((.cse25 (select (store (store .cse19 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (store (store .cse25 .cse1 (+ (select .cse25 .cse1) 1)) (+ (* 4 (select .cse25 .cse8)) |c_~#queue~0.offset|) v_subst_9)) .cse10 (+ v_subst_8 1)) .cse8 (+ v_subst_5 1)))) (let ((.cse20 (store (select (store (store .cse19 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse19 |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse21) 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1) (not (= (let ((.cse22 (select (store (store .cse19 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base|))) (select .cse22 (+ (* (select .cse22 .cse1) 4) |c_~#queue~0.offset|))) 0)))))))))))) is different from false [2024-11-14 18:29:44,977 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse17 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (+ |c_~#queue~0.offset| 80)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|)) (.cse16 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select .cse18 .cse17))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (forall ((v_subst_12 Int) (v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_5 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse15 (store .cse18 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse15 .cse16 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse17 (+ (select .cse15 .cse17) 1)))))) (let ((.cse12 (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_1816))) (let ((.cse10 (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* (select .cse14 .cse9) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse13 .cse11 (+ v_subst_12 1)) .cse9 (+ (select .cse13 .cse9) 1)))) (.cse3 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse7 (store (select (store .cse12 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse6 (store (store (let ((.cse8 (select (store (store .cse1 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base|))) (store (store .cse8 .cse5 (+ (select .cse8 .cse5) 1)) (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) v_subst_9)) .cse11 (+ v_subst_8 1)) .cse9 (+ v_subst_5 1)))) (let ((.cse2 (store (select (store (store .cse1 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse1 |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse3) 1)) (not (= (let ((.cse4 (select (store (store .cse1 |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base|))) (select .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse5) 4)))) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1))))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_7 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_6 Int) (v_subst_11 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (v_subst_10 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse19 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse30 (store .cse18 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse30 .cse16 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse17 (+ (select .cse30 .cse17) 1)))))) (let ((.cse27 (store .cse19 |c_~#stored_elements~0.base| v_ArrVal_1816))) (let ((.cse26 (let ((.cse28 (let ((.cse29 (select .cse27 |c_~#queue~0.base|))) (store .cse29 (+ |c_~#queue~0.offset| (* (select .cse29 .cse9) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse28 .cse11 (+ v_subst_11 1)) .cse9 (+ (select .cse28 .cse9) 1)))) (.cse21 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse24 (store (select (store .cse27 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base|) .cse21 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse23 (store (store (let ((.cse25 (select (store (store .cse19 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (store (store .cse25 .cse5 (+ (select .cse25 .cse5) 1)) (+ |c_~#queue~0.offset| (* (select .cse25 .cse9) 4)) v_subst_10)) .cse11 (+ v_subst_7 1)) .cse9 (+ v_subst_6 1)))) (let ((.cse20 (store (select (store (store .cse19 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse19 |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse21) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1) (= (let ((.cse22 (select (store (store .cse19 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base|))) (select .cse22 (+ |c_~#queue~0.offset| (* (select .cse22 .cse5) 4)))) 0))))))))) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|)))))) is different from false [2024-11-14 18:29:47,857 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse17 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse2 (+ |c_~#queue~0.offset| 80)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|)) (.cse16 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (select .cse18 .cse17))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_7 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_6 Int) (v_subst_11 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (v_subst_10 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse15 (store .cse18 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse15 .cse16 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse17 (+ (select .cse15 .cse17) 1)))))) (let ((.cse12 (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1816))) (let ((.cse10 (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse13 .cse11 (+ v_subst_11 1)) .cse9 (+ (select .cse13 .cse9) 1)))) (.cse6 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse7 (store (select (store .cse12 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse4 (store (store (let ((.cse8 (select (store (store .cse3 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base|))) (store (store .cse8 .cse2 (+ (select .cse8 .cse2) 1)) (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) v_subst_10)) .cse11 (+ v_subst_7 1)) .cse9 (+ v_subst_6 1)))) (let ((.cse5 (store (select (store (store .cse3 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (= (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base|))) (select .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|))) 0) (not (= (select (select (store (store .cse3 |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse6) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1))))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (forall ((v_subst_12 Int) (v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_5 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse20 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse30 (store .cse18 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse30 .cse16 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse17 (+ (select .cse30 .cse17) 1)))))) (let ((.cse27 (store .cse20 |c_~#stored_elements~0.base| v_ArrVal_1816))) (let ((.cse26 (let ((.cse28 (let ((.cse29 (select .cse27 |c_~#queue~0.base|))) (store .cse29 (+ (* (select .cse29 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse28 .cse11 (+ v_subst_12 1)) .cse9 (+ (select .cse28 .cse9) 1)))) (.cse23 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse24 (store (select (store .cse27 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base|) .cse23 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse21 (store (store (let ((.cse25 (select (store (store .cse20 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (store (store .cse25 .cse2 (+ (select .cse25 .cse2) 1)) (+ |c_~#queue~0.offset| (* (select .cse25 .cse9) 4)) v_subst_9)) .cse11 (+ v_subst_8 1)) .cse9 (+ v_subst_5 1)))) (let ((.cse22 (store (select (store (store .cse20 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (let ((.cse19 (select (store (store .cse20 |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base|))) (select .cse19 (+ (* 4 (select .cse19 .cse2)) |c_~#queue~0.offset|))) 0)) (not (= (select (select (store (store .cse20 |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse23) 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1))))))))) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|)))))) is different from false [2024-11-14 18:29:51,411 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse7 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (+ |c_~#queue~0.offset| 80)) (.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse14 (select .cse13 .cse7))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_7 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_6 Int) (v_subst_11 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (v_subst_10 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse8 (let ((.cse10 (let ((.cse11 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse12 (store .cse13 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse12 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ 1 (select .cse12 .cse7))))) |c_~#stored_elements~0.base| v_ArrVal_1816) |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse7) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse10 .cse9 (+ v_subst_11 1)) .cse7 (+ (select .cse10 .cse7) 1)))) (.cse1 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse5 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1816) |c_~#queue~0.base| .cse8) |c_~#stored_elements~0.base|) .cse1 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse4 (store (store (let ((.cse6 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse8) |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base|))) (store (store .cse6 .cse3 (+ (select .cse6 .cse3) 1)) (+ (* (select .cse6 .cse7) 4) |c_~#queue~0.offset|) v_subst_10)) .cse9 (+ v_subst_7 1)) .cse7 (+ v_subst_6 1)))) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse1) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1) (= (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|))) (select .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)))) 0))))))) (< .cse14 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (forall ((v_subst_12 Int) (v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_5 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse21 (let ((.cse22 (let ((.cse23 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse24 (store .cse13 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse24 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ 1 (select .cse24 .cse7))))) |c_~#stored_elements~0.base| v_ArrVal_1816) |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse7) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse22 .cse9 (+ v_subst_12 1)) .cse7 (+ (select .cse22 .cse7) 1)))) (.cse16 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse19 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1816) |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base|) .cse16 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse18 (store (store (let ((.cse20 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (store (store .cse20 .cse3 (+ (select .cse20 .cse3) 1)) (+ (* (select .cse20 .cse7) 4) |c_~#queue~0.offset|) v_subst_9)) .cse9 (+ v_subst_8 1)) .cse7 (+ v_subst_5 1)))) (let ((.cse15 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse16) 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1) (not (= (let ((.cse17 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base|))) (select .cse17 (+ (* (select .cse17 .cse3) 4) |c_~#queue~0.offset|))) 0)))))))) (< .cse14 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|)))))) is different from false [2024-11-14 18:30:05,790 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) 0)))) (let ((.cse14 (select .cse2 |c_~#queue~0.base|)) (.cse8 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse15 (select .cse14 .cse8))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (forall ((v_subst_12 Int) (v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_5 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse9 (let ((.cse11 (let ((.cse12 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse13 (store .cse14 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse13 .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ (select .cse13 .cse8) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1816) |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* 4 (select .cse12 .cse8))) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse11 .cse10 (+ v_subst_12 1)) .cse8 (+ (select .cse11 .cse8) 1)))) (.cse5 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse6 (store (select (store (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1816) |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse3 (store (store (let ((.cse7 (select (store (store .cse2 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse7 .cse1 (+ (select .cse7 .cse1) 1)) (+ |c_~#queue~0.offset| (* (select .cse7 .cse8) 4)) v_subst_9)) .cse10 (+ v_subst_8 1)) .cse8 (+ v_subst_5 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base|))) (select .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|))) 0)) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse5) 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1))))))) (< .cse15 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_7 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_6 Int) (v_subst_11 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (v_subst_10 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse22 (let ((.cse23 (let ((.cse24 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse25 (store .cse14 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse25 .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ (select .cse25 .cse8) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1816) |c_~#queue~0.base|))) (store .cse24 (+ |c_~#queue~0.offset| (* 4 (select .cse24 .cse8))) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse23 .cse10 (+ v_subst_11 1)) .cse8 (+ (select .cse23 .cse8) 1)))) (.cse19 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse20 (store (select (store (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1816) |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base|) .cse19 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse17 (store (store (let ((.cse21 (select (store (store .cse2 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base|))) (store (store .cse21 .cse1 (+ (select .cse21 .cse1) 1)) (+ |c_~#queue~0.offset| (* (select .cse21 .cse8) 4)) v_subst_10)) .cse10 (+ v_subst_7 1)) .cse8 (+ v_subst_6 1)))) (let ((.cse18 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (= (let ((.cse16 (select (store (store .cse2 |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base|))) (select .cse16 (+ (* 4 (select .cse16 .cse1)) |c_~#queue~0.offset|))) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse19) 0)))))))) (< .cse15 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|))))))) is different from false [2024-11-14 18:30:06,289 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ |c_ULTIMATE.start_init_~q#1.offset| 84) 0) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) 0)))) (let ((.cse15 (select .cse1 |c_~#queue~0.base|)) (.cse9 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (+ |c_~#queue~0.offset| 80)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select .cse15 .cse9))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_7 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_6 Int) (v_subst_11 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (v_subst_10 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse10 (let ((.cse12 (let ((.cse13 (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse14 (store .cse15 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse14 .cse11 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ (select .cse14 .cse9) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1816) |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* (select .cse13 .cse9) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse12 .cse11 (+ v_subst_11 1)) .cse9 (+ (select .cse12 .cse9) 1)))) (.cse3 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse7 (store (select (store (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_1816) |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse6 (store (store (let ((.cse8 (select (store (store .cse1 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base|))) (store (store .cse8 .cse5 (+ (select .cse8 .cse5) 1)) (+ |c_~#queue~0.offset| (* (select .cse8 .cse9) 4)) v_subst_10)) .cse11 (+ v_subst_7 1)) .cse9 (+ v_subst_6 1)))) (let ((.cse2 (store (select (store (store .cse1 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (select (select (store (store .cse1 |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse3) 0)) (= (let ((.cse4 (select (store (store .cse1 |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base|))) (select .cse4 (+ (* 4 (select .cse4 .cse5)) |c_~#queue~0.offset|))) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (forall ((v_subst_12 Int) (v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_subst_9 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_8 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_5 Int) (v_ArrVal_1816 (Array Int Int)) (|~#stored_elements~0.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_28| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse22 (let ((.cse23 (let ((.cse24 (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse25 (store .cse15 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse25 .cse11 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ (select .cse25 .cse9) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1816) |c_~#queue~0.base|))) (store .cse24 (+ |c_~#queue~0.offset| (* (select .cse24 .cse9) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse23 .cse11 (+ v_subst_12 1)) .cse9 (+ (select .cse23 .cse9) 1)))) (.cse19 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse20 (store (select (store (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_1816) |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base|) .cse19 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse17 (store (store (let ((.cse21 (select (store (store .cse1 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base|))) (store (store .cse21 .cse5 (+ (select .cse21 .cse5) 1)) (+ (* 4 (select .cse21 .cse9)) |c_~#queue~0.offset|) v_subst_9)) .cse11 (+ v_subst_8 1)) .cse9 (+ v_subst_5 1)))) (let ((.cse18 (store (select (store (store .cse1 |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_28| 4)) v_ArrVal_1829))) (or (not (= (let ((.cse16 (select (store (store .cse1 |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base|))) (select .cse16 (+ (* (select .cse16 .cse5) 4) |c_~#queue~0.offset|))) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_28| 1) (not (= (select (select (store (store .cse1 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base| v_ArrVal_1831) |c_~#stored_elements~0.base|) .cse19) 1)))))))) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|))))))) is different from false [2024-11-14 18:30:09,729 INFO L349 Elim1Store]: treesize reduction 462, result has 37.0 percent of original size [2024-11-14 18:30:09,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 16624 treesize of output 3054 [2024-11-14 18:30:09,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 18:30:09,802 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 5248 treesize of output 5246 [2024-11-14 18:30:10,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 18:30:10,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 259338 treesize of output 215832 [2024-11-14 18:30:24,963 WARN L286 SmtUtils]: Spent 14.92s on a formula simplification. DAG size of input: 761 DAG size of output: 737 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 18:30:26,285 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 22 treesize of output 18 [2024-11-14 18:33:57,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 25 treesize of output 13 [2024-11-14 18:33:57,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 18:33:57,193 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 85 treesize of output 93 [2024-11-14 18:33:57,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 25 treesize of output 13 [2024-11-14 18:34:03,863 WARN L286 SmtUtils]: Spent 5.14s on a formula simplification that was a NOOP. DAG size: 469 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-14 18:34:03,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 18:34:03,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 15 select indices, 15 select index equivalence classes, 4 disjoint index pairs (out of 105 index pairs), introduced 16 new quantified variables, introduced 101 case distinctions, treesize of input 9185656 treesize of output 6591630 [2024-11-14 18:35:13,186 WARN L286 SmtUtils]: Spent 1.15m on a formula simplification. DAG size of input: 10562 DAG size of output: 2588 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 18:36:37,904 WARN L249 Executor]: External (MP /storage/repos/ultimate-jdk21/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-11-14 18:36:37,906 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-14 18:36:37,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2024-11-14 18:36:37,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-14 18:36:38,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-14 18:36:38,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-11-14 18:36:38,121 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-jdk21/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:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) 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:590) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:728) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) 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:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.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:337) 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:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) 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.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) 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:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isCounterexampleFeasible(PartialOrderCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) ... 78 more [2024-11-14 18:36:38,130 INFO L158 Benchmark]: Toolchain (without parser) took 744475.01ms. Allocated memory was 100.7MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 71.3MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2024-11-14 18:36:38,130 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 100.7MB. Free memory is still 52.6MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-14 18:36:38,130 INFO L158 Benchmark]: CACSL2BoogieTranslator took 455.41ms. Allocated memory is still 100.7MB. Free memory was 71.0MB in the beginning and 40.2MB in the end (delta: 30.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2024-11-14 18:36:38,130 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.78ms. Allocated memory is still 100.7MB. Free memory was 40.2MB in the beginning and 37.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2024-11-14 18:36:38,130 INFO L158 Benchmark]: Boogie Preprocessor took 33.53ms. Allocated memory is still 100.7MB. Free memory was 37.2MB in the beginning and 35.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-14 18:36:38,131 INFO L158 Benchmark]: RCFGBuilder took 464.20ms. Allocated memory is still 100.7MB. Free memory was 35.2MB in the beginning and 55.3MB in the end (delta: -20.1MB). Peak memory consumption was 22.8MB. Max. memory is 8.0GB. [2024-11-14 18:36:38,131 INFO L158 Benchmark]: TraceAbstraction took 743469.40ms. Allocated memory was 100.7MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 54.7MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2024-11-14 18:36:38,131 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.15ms. Allocated memory is still 100.7MB. Free memory is still 52.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 455.41ms. Allocated memory is still 100.7MB. Free memory was 71.0MB in the beginning and 40.2MB in the end (delta: 30.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.78ms. Allocated memory is still 100.7MB. Free memory was 40.2MB in the beginning and 37.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.53ms. Allocated memory is still 100.7MB. Free memory was 37.2MB in the beginning and 35.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 464.20ms. Allocated memory is still 100.7MB. Free memory was 35.2MB in the beginning and 55.3MB in the end (delta: -20.1MB). Peak memory consumption was 22.8MB. Max. memory is 8.0GB. * TraceAbstraction took 743469.40ms. Allocated memory was 100.7MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 54.7MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 14599, independent: 14430, independent conditional: 1836, independent unconditional: 12594, dependent: 169, dependent conditional: 138, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14466, independent: 14430, independent conditional: 1836, independent unconditional: 12594, dependent: 36, dependent conditional: 5, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14466, independent: 14430, independent conditional: 1836, independent unconditional: 12594, dependent: 36, dependent conditional: 5, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14484, independent: 14430, independent conditional: 1836, independent unconditional: 12594, dependent: 54, dependent conditional: 23, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14484, independent: 14430, independent conditional: 0, independent unconditional: 14430, dependent: 54, dependent conditional: 5, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14484, independent: 14430, independent conditional: 0, independent unconditional: 14430, dependent: 54, dependent conditional: 5, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11761, independent: 11728, independent conditional: 0, independent unconditional: 11728, dependent: 33, dependent conditional: 2, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11761, independent: 11724, independent conditional: 0, independent unconditional: 11724, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 37, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 33, dependent conditional: 2, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 37, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 33, dependent conditional: 2, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 384, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 346, dependent conditional: 19, dependent unconditional: 327, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 14484, independent: 2702, independent conditional: 0, independent unconditional: 2702, dependent: 21, dependent conditional: 3, dependent unconditional: 18, unknown: 11761, unknown conditional: 2, unknown unconditional: 11759] , Statistics on independence cache: Total cache size (in pairs): 11761, Positive cache size: 11728, Positive conditional cache size: 0, Positive unconditional cache size: 11728, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1854, Maximal queried relation: 4, Independence queries for same thread: 133, Persistent sets #1 benchmarks: Persistent set computation time: 0.5s, Number of persistent set computation: 690, Number of trivial persistent sets: 435, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12625, independent: 12594, independent conditional: 0, independent unconditional: 12594, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 14599, independent: 14430, independent conditional: 1836, independent unconditional: 12594, dependent: 169, dependent conditional: 138, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14466, independent: 14430, independent conditional: 1836, independent unconditional: 12594, dependent: 36, dependent conditional: 5, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14466, independent: 14430, independent conditional: 1836, independent unconditional: 12594, dependent: 36, dependent conditional: 5, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14484, independent: 14430, independent conditional: 1836, independent unconditional: 12594, dependent: 54, dependent conditional: 23, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14484, independent: 14430, independent conditional: 0, independent unconditional: 14430, dependent: 54, dependent conditional: 5, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14484, independent: 14430, independent conditional: 0, independent unconditional: 14430, dependent: 54, dependent conditional: 5, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11761, independent: 11728, independent conditional: 0, independent unconditional: 11728, dependent: 33, dependent conditional: 2, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11761, independent: 11724, independent conditional: 0, independent unconditional: 11724, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 37, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 33, dependent conditional: 2, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 37, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 33, dependent conditional: 2, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 384, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 346, dependent conditional: 19, dependent unconditional: 327, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 14484, independent: 2702, independent conditional: 0, independent unconditional: 2702, dependent: 21, dependent conditional: 3, dependent unconditional: 18, unknown: 11761, unknown conditional: 2, unknown unconditional: 11759] , Statistics on independence cache: Total cache size (in pairs): 11761, Positive cache size: 11728, Positive conditional cache size: 0, Positive unconditional cache size: 11728, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1854, Maximal queried relation: 4, Independence queries for same thread: 133 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6585, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 30, dependent conditional: 15, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 0, independent unconditional: 6555, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 0, independent unconditional: 6555, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 462, independent: 461, independent conditional: 0, independent unconditional: 461, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 462, independent: 461, independent conditional: 0, independent unconditional: 461, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 6570, independent: 6094, independent conditional: 0, independent unconditional: 6094, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 462, unknown conditional: 0, unknown unconditional: 462] , Statistics on independence cache: Total cache size (in pairs): 12221, Positive cache size: 12189, Positive conditional cache size: 0, Positive unconditional cache size: 12189, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 372, Maximal queried relation: 0, Independence queries for same thread: 15, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 529, Number of trivial persistent sets: 523, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6198, independent: 6183, independent conditional: 0, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6585, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 30, dependent conditional: 15, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 0, independent unconditional: 6555, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 0, independent unconditional: 6555, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 462, independent: 461, independent conditional: 0, independent unconditional: 461, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 462, independent: 461, independent conditional: 0, independent unconditional: 461, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 6570, independent: 6094, independent conditional: 0, independent unconditional: 6094, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 462, unknown conditional: 0, unknown unconditional: 462] , Statistics on independence cache: Total cache size (in pairs): 12221, Positive cache size: 12189, Positive conditional cache size: 0, Positive unconditional cache size: 12189, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 372, Maximal queried relation: 0, Independence queries for same thread: 15 - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/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-jdk21/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. Received shutdown request...