/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 SUFFICIENT_WITH_CONTEXT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.conditional-comm-158c277 [2024-11-14 08:19:39,636 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 08:19:39,710 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2024-11-14 08:19:39,716 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 08:19:39,716 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 08:19:39,737 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 08:19:39,738 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 08:19:39,738 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 08:19:39,738 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 08:19:39,738 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 08:19:39,739 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 08:19:39,739 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 08:19:39,739 INFO L153 SettingsManager]: * Use SBE=true [2024-11-14 08:19:39,739 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 08:19:39,740 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 08:19:39,740 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 08:19:39,740 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 08:19:39,741 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 08:19:39,741 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 08:19:39,741 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 08:19:39,741 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 08:19:39,741 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 08:19:39,741 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 08:19:39,741 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 08:19:39,741 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 08:19:39,741 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 08:19:39,741 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 08:19:39,741 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-14 08:19:39,741 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 08:19:39,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 08:19:39,742 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 08:19:39,742 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 08:19:39,742 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 08:19:39,742 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-14 08:19:39,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 08:19:39,742 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 08:19:39,742 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-14 08:19:39,742 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-14 08:19:39,742 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-14 08:19:39,742 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 -> SUFFICIENT_WITH_CONTEXT [2024-11-14 08:19:40,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 08:19:40,040 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 08:19:40,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 08:19:40,043 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 08:19:40,043 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 08:19:40,044 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/queue_longest.i [2024-11-14 08:19:41,363 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 08:19:41,702 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 08:19:41,702 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/queue_longest.i [2024-11-14 08:19:41,724 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/bbea201d4/c0b52c3f62e9407a8c86393a2b17b0e0/FLAG7f6ac1b94 [2024-11-14 08:19:41,741 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/bbea201d4/c0b52c3f62e9407a8c86393a2b17b0e0 [2024-11-14 08:19:41,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 08:19:41,745 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-14 08:19:41,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 08:19:41,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 08:19:41,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 08:19:41,752 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 08:19:41" (1/1) ... [2024-11-14 08:19:41,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c5fcb72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 08:19:41, skipping insertion in model container [2024-11-14 08:19:41,753 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 08:19:41" (1/1) ... [2024-11-14 08:19:41,796 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 08:19:42,124 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_longest.i[43296,43309] [2024-11-14 08:19:42,131 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_longest.i[43503,43516] [2024-11-14 08:19:42,134 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_longest.i[43783,43796] [2024-11-14 08:19:42,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 08:19:42,197 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 08:19:42,260 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_longest.i[43296,43309] [2024-11-14 08:19:42,263 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_longest.i[43503,43516] [2024-11-14 08:19:42,264 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_longest.i[43783,43796] [2024-11-14 08:19:42,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 08:19:42,395 INFO L204 MainTranslator]: Completed translation [2024-11-14 08:19:42,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 08:19:42 WrapperNode [2024-11-14 08:19:42,395 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 08:19:42,396 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 08:19:42,396 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 08:19:42,396 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 08:19:42,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 08:19:42" (1/1) ... [2024-11-14 08:19:42,451 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 08:19:42" (1/1) ... [2024-11-14 08:19:42,560 INFO L138 Inliner]: procedures = 277, calls = 1659, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 1841 [2024-11-14 08:19:42,560 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 08:19:42,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 08:19:42,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 08:19:42,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 08:19:42,568 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 08:19:42" (1/1) ... [2024-11-14 08:19:42,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 08:19:42" (1/1) ... [2024-11-14 08:19:42,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 08:19:42" (1/1) ... [2024-11-14 08:19:42,586 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 08:19:42" (1/1) ... [2024-11-14 08:19:42,634 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 08:19:42" (1/1) ... [2024-11-14 08:19:42,642 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 08:19:42" (1/1) ... [2024-11-14 08:19:42,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 08:19:42" (1/1) ... [2024-11-14 08:19:42,664 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 08:19:42" (1/1) ... [2024-11-14 08:19:42,680 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 08:19:42,682 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 08:19:42,682 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 08:19:42,682 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 08:19:42,683 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 08:19:42" (1/1) ... [2024-11-14 08:19:42,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 08:19:42,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 08:19:42,715 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 08:19:42,719 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 08:19:42,742 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-14 08:19:42,742 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-14 08:19:42,742 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-14 08:19:42,742 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-14 08:19:42,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-14 08:19:42,742 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-14 08:19:42,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 08:19:42,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 08:19:42,743 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-14 08:19:42,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 08:19:42,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 08:19:42,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 08:19:42,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 08:19:42,745 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 08:19:42,909 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 08:19:42,910 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 08:19:44,834 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 08:19:44,835 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 08:19:44,907 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 08:19:44,908 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-14 08:19:44,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 08:19:44 BoogieIcfgContainer [2024-11-14 08:19:44,914 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 08:19:44,916 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 08:19:44,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 08:19:44,921 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 08:19:44,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 08:19:41" (1/3) ... [2024-11-14 08:19:44,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6803886f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 08:19:44, skipping insertion in model container [2024-11-14 08:19:44,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 08:19:42" (2/3) ... [2024-11-14 08:19:44,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6803886f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 08:19:44, skipping insertion in model container [2024-11-14 08:19:44,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 08:19:44" (3/3) ... [2024-11-14 08:19:44,923 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2024-11-14 08:19:44,936 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 08:19:44,937 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_longest.i that has 3 procedures, 1855 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2024-11-14 08:19:44,937 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 08:19:45,139 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-14 08:19:45,235 INFO L123 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 08:19:45,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-14 08:19:45,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 08:19:45,239 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 08:19:45,242 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 08:19:45,336 INFO L185 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-14 08:19:45,347 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2024-11-14 08:19:45,355 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;@3541c60b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 08:19:45,355 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 08:19:45,880 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 08:19:45,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 08:19:45,890 INFO L85 PathProgramCache]: Analyzing trace with hash 795487247, now seen corresponding path program 1 times [2024-11-14 08:19:45,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 08:19:45,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472216880] [2024-11-14 08:19:45,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 08:19:45,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 08:19:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 08:19:47,733 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 08:19:47,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 08:19:47,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472216880] [2024-11-14 08:19:47,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472216880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 08:19:47,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 08:19:47,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 08:19:47,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687106706] [2024-11-14 08:19:47,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 08:19:47,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 08:19:47,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 08:19:47,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 08:19:47,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 08:19:47,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:19:47,796 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 08:19:47,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 849.0) internal successors, (1698), 2 states have internal predecessors, (1698), 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 08:19:47,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:19:47,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:19:47,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 08:19:47,997 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 08:19:48,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 08:19:48,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1988372438, now seen corresponding path program 1 times [2024-11-14 08:19:48,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 08:19:48,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744953185] [2024-11-14 08:19:48,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 08:19:48,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 08:19:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 08:19:50,646 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 08:19:50,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 08:19:50,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744953185] [2024-11-14 08:19:50,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744953185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 08:19:50,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 08:19:50,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 08:19:50,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423603687] [2024-11-14 08:19:50,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 08:19:50,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 08:19:50,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 08:19:50,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 08:19:50,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 08:19:50,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:19:50,661 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 08:19:50,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 424.0) internal successors, (1696), 4 states have internal predecessors, (1696), 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 08:19:50,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:19:50,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:19:50,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:19:50,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:19:50,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 08:19:50,872 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 08:19:50,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 08:19:50,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1632284371, now seen corresponding path program 1 times [2024-11-14 08:19:50,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 08:19:50,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754737229] [2024-11-14 08:19:50,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 08:19:50,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 08:19:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 08:19:59,732 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 08:19:59,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 08:19:59,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754737229] [2024-11-14 08:19:59,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754737229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 08:19:59,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 08:19:59,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-14 08:19:59,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563067240] [2024-11-14 08:19:59,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 08:19:59,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 08:19:59,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 08:19:59,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 08:19:59,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-14 08:19:59,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:19:59,740 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 08:19:59,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 142.91666666666666) internal successors, (1715), 12 states have internal predecessors, (1715), 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 08:19:59,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:19:59,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:19:59,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:04,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:04,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:20:04,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 08:20:04,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 08:20:04,659 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 08:20:04,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 08:20:04,662 INFO L85 PathProgramCache]: Analyzing trace with hash -995860402, now seen corresponding path program 1 times [2024-11-14 08:20:04,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 08:20:04,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815654430] [2024-11-14 08:20:04,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 08:20:04,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 08:20:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 08:20:18,189 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 08:20:18,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 08:20:18,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815654430] [2024-11-14 08:20:18,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815654430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 08:20:18,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 08:20:18,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2024-11-14 08:20:18,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737239043] [2024-11-14 08:20:18,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 08:20:18,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-14 08:20:18,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 08:20:18,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-14 08:20:18,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2024-11-14 08:20:18,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:18,197 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 08:20:18,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 71.625) internal successors, (1719), 24 states have internal predecessors, (1719), 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 08:20:18,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:18,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:20:18,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-14 08:20:18,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:25,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:25,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:20:25,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 08:20:25,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-14 08:20:25,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 08:20:25,592 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 08:20:25,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 08:20:25,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1970430640, now seen corresponding path program 1 times [2024-11-14 08:20:25,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 08:20:25,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749574240] [2024-11-14 08:20:25,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 08:20:25,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 08:20:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 08:20:26,497 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 08:20:26,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 08:20:26,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749574240] [2024-11-14 08:20:26,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749574240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 08:20:26,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 08:20:26,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 08:20:26,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68979547] [2024-11-14 08:20:26,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 08:20:26,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 08:20:26,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 08:20:26,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 08:20:26,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 08:20:26,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:26,503 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 08:20:26,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 429.25) internal successors, (1717), 4 states have internal predecessors, (1717), 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 08:20:26,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:26,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:20:26,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-14 08:20:26,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-14 08:20:26,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:26,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:26,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:20:26,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 08:20:26,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 08:20:26,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:20:26,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 08:20:26,835 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 08:20:26,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 08:20:26,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1582825080, now seen corresponding path program 1 times [2024-11-14 08:20:26,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 08:20:26,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636458621] [2024-11-14 08:20:26,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 08:20:26,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 08:20:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 08:20:28,025 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 08:20:28,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 08:20:28,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636458621] [2024-11-14 08:20:28,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636458621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 08:20:28,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 08:20:28,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 08:20:28,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019382749] [2024-11-14 08:20:28,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 08:20:28,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 08:20:28,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 08:20:28,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 08:20:28,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 08:20:28,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:28,030 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 08:20:28,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 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 08:20:28,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:28,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:20:28,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-14 08:20:28,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-14 08:20:28,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:20:28,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:28,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:28,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:20:28,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 08:20:28,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 08:20:28,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:20:28,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 08:20:28,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 08:20:28,528 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 08:20:28,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 08:20:28,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1311794446, now seen corresponding path program 1 times [2024-11-14 08:20:28,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 08:20:28,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757019674] [2024-11-14 08:20:28,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 08:20:28,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 08:20:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 08:20:29,745 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 08:20:29,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 08:20:29,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757019674] [2024-11-14 08:20:29,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757019674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 08:20:29,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 08:20:29,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 08:20:29,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444777667] [2024-11-14 08:20:29,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 08:20:29,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 08:20:29,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 08:20:29,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 08:20:29,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 08:20:29,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:29,749 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 08:20:29,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 587.0) internal successors, (1761), 3 states have internal predecessors, (1761), 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 08:20:29,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:29,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:20:29,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-14 08:20:29,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-14 08:20:29,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:20:29,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 08:20:29,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:29,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:29,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:20:29,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 08:20:29,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 08:20:29,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:20:29,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 08:20:29,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 08:20:29,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 08:20:29,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 08:20:29,874 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-14 08:20:29,875 INFO L320 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/3) [2024-11-14 08:20:29,898 INFO L123 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 08:20:29,899 INFO L185 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-14 08:20:29,899 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-14 08:20:29,900 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;@3541c60b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 08:20:29,900 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-14 08:20:29,957 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 08:20:29,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 08:20:29,960 INFO L85 PathProgramCache]: Analyzing trace with hash 268447021, now seen corresponding path program 1 times [2024-11-14 08:20:29,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 08:20:29,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186247378] [2024-11-14 08:20:29,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 08:20:29,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 08:20:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 08:20:30,272 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 08:20:30,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 08:20:30,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186247378] [2024-11-14 08:20:30,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186247378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 08:20:30,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 08:20:30,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 08:20:30,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146615047] [2024-11-14 08:20:30,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 08:20:30,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 08:20:30,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 08:20:30,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 08:20:30,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 08:20:30,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:30,276 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 08:20:30,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 829.0) internal successors, (1658), 2 states have internal predecessors, (1658), 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 08:20:30,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:30,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:30,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-14 08:20:30,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-11-14 08:20:30,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-14 08:20:30,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 08:20:30,378 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-14 08:20:30,378 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (2/3) [2024-11-14 08:20:30,395 INFO L123 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 08:20:30,397 INFO L185 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-14 08:20:30,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork1 ======== [2024-11-14 08:20:30,397 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;@3541c60b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 08:20:30,397 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 08:20:30,456 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 08:20:30,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 08:20:30,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1103165845, now seen corresponding path program 1 times [2024-11-14 08:20:30,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 08:20:30,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872387630] [2024-11-14 08:20:30,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 08:20:30,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 08:20:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 08:20:30,877 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 08:20:30,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 08:20:30,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872387630] [2024-11-14 08:20:30,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872387630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 08:20:30,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 08:20:30,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 08:20:30,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487662365] [2024-11-14 08:20:30,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 08:20:30,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 08:20:30,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 08:20:30,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 08:20:30,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 08:20:30,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:30,880 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 08:20:30,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 871.0) internal successors, (1742), 2 states have internal predecessors, (1742), 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 08:20:30,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:30,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:30,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 08:20:30,908 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 08:20:30,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 08:20:30,912 INFO L85 PathProgramCache]: Analyzing trace with hash -653941028, now seen corresponding path program 1 times [2024-11-14 08:20:30,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 08:20:30,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394916255] [2024-11-14 08:20:30,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 08:20:30,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 08:20:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 08:20:31,746 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 08:20:31,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 08:20:31,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394916255] [2024-11-14 08:20:31,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394916255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 08:20:31,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 08:20:31,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 08:20:31,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147011283] [2024-11-14 08:20:31,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 08:20:31,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 08:20:31,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 08:20:31,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 08:20:31,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 08:20:31,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:31,749 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 08:20:31,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 435.0) internal successors, (1740), 4 states have internal predecessors, (1740), 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 08:20:31,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:31,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:31,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:31,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:20:31,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 08:20:31,798 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 08:20:31,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 08:20:31,801 INFO L85 PathProgramCache]: Analyzing trace with hash 695952985, now seen corresponding path program 1 times [2024-11-14 08:20:31,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 08:20:31,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063180285] [2024-11-14 08:20:31,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 08:20:31,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 08:20:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 08:20:32,916 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 08:20:32,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 08:20:32,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063180285] [2024-11-14 08:20:32,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063180285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 08:20:32,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 08:20:32,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 08:20:32,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823806550] [2024-11-14 08:20:32,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 08:20:32,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 08:20:32,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 08:20:32,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 08:20:32,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 08:20:32,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:32,919 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 08:20:32,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 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 08:20:32,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:32,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:20:32,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:33,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:33,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:20:33,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 08:20:33,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 08:20:33,211 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 08:20:33,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 08:20:33,215 INFO L85 PathProgramCache]: Analyzing trace with hash 228867594, now seen corresponding path program 1 times [2024-11-14 08:20:33,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 08:20:33,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649168506] [2024-11-14 08:20:33,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 08:20:33,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 08:20:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 08:20:33,866 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 08:20:33,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 08:20:33,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649168506] [2024-11-14 08:20:33,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649168506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 08:20:33,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 08:20:33,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 08:20:33,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015875793] [2024-11-14 08:20:33,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 08:20:33,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 08:20:33,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 08:20:33,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 08:20:33,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 08:20:33,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:33,869 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 08:20:33,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 450.0) internal successors, (1800), 4 states have internal predecessors, (1800), 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 08:20:33,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:33,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:20:33,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 08:20:33,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:33,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:33,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:20:33,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 08:20:33,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:20:33,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 08:20:33,947 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 08:20:33,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 08:20:33,950 INFO L85 PathProgramCache]: Analyzing trace with hash -911218776, now seen corresponding path program 1 times [2024-11-14 08:20:33,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 08:20:33,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829165653] [2024-11-14 08:20:33,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 08:20:33,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 08:20:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 08:20:40,872 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 08:20:40,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 08:20:40,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829165653] [2024-11-14 08:20:40,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829165653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 08:20:40,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 08:20:40,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-14 08:20:40,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890996747] [2024-11-14 08:20:40,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 08:20:40,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 08:20:40,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 08:20:40,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 08:20:40,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-14 08:20:40,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:40,876 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 08:20:40,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 119.86666666666666) internal successors, (1798), 15 states have internal predecessors, (1798), 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 08:20:40,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:40,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:20:40,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 08:20:40,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:20:40,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:46,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:46,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:20:46,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 08:20:46,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:20:46,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 08:20:46,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 08:20:46,808 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 08:20:46,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 08:20:46,810 INFO L85 PathProgramCache]: Analyzing trace with hash 268259363, now seen corresponding path program 1 times [2024-11-14 08:20:46,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 08:20:46,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923362331] [2024-11-14 08:20:46,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 08:20:46,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 08:20:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 08:20:56,548 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 08:20:56,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 08:20:56,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923362331] [2024-11-14 08:20:56,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923362331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 08:20:56,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 08:20:56,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-14 08:20:56,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818289630] [2024-11-14 08:20:56,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 08:20:56,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-14 08:20:56,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 08:20:56,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-14 08:20:56,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-11-14 08:20:56,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:56,552 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 08:20:56,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 112.625) internal successors, (1802), 16 states have internal predecessors, (1802), 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 08:20:56,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:20:56,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:20:56,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 08:20:56,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:20:56,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-14 08:20:56,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:21:02,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:21:02,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:21:02,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 08:21:02,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:21:02,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 08:21:02,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 08:21:02,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 08:21:02,535 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 08:21:02,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 08:21:02,537 INFO L85 PathProgramCache]: Analyzing trace with hash 2108223053, now seen corresponding path program 1 times [2024-11-14 08:21:02,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 08:21:02,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084513442] [2024-11-14 08:21:02,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 08:21:02,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 08:21:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 08:21:13,646 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 08:21:13,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 08:21:13,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084513442] [2024-11-14 08:21:13,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084513442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 08:21:13,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 08:21:13,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-11-14 08:21:13,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247277860] [2024-11-14 08:21:13,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 08:21:13,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-14 08:21:13,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 08:21:13,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-14 08:21:13,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2024-11-14 08:21:13,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:21:13,651 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 08:21:13,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 81.9090909090909) internal successors, (1802), 22 states have internal predecessors, (1802), 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 08:21:13,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:21:13,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:21:13,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 08:21:13,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:21:13,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-14 08:21:13,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-14 08:21:13,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:21:21,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:21:21,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:21:21,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 08:21:21,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:21:21,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 08:21:21,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 08:21:21,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-14 08:21:21,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-14 08:21:21,978 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 08:21:21,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 08:21:21,980 INFO L85 PathProgramCache]: Analyzing trace with hash 2098756680, now seen corresponding path program 1 times [2024-11-14 08:21:21,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 08:21:21,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800406097] [2024-11-14 08:21:21,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 08:21:21,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 08:21:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 08:21:41,166 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 08:21:41,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 08:21:41,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800406097] [2024-11-14 08:21:41,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800406097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 08:21:41,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 08:21:41,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2024-11-14 08:21:41,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103832187] [2024-11-14 08:21:41,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 08:21:41,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-14 08:21:41,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 08:21:41,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-14 08:21:41,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2024-11-14 08:21:41,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:21:41,171 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 08:21:41,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 64.5) internal successors, (1806), 28 states have internal predecessors, (1806), 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 08:21:41,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:21:41,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:21:41,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 08:21:41,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:21:41,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-14 08:21:41,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-14 08:21:41,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-14 08:21:41,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:21:47,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:21:47,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:21:47,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 08:21:47,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:21:47,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 08:21:47,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 08:21:47,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-14 08:21:47,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 08:21:47,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-14 08:21:47,836 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 08:21:47,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 08:21:47,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1800972629, now seen corresponding path program 1 times [2024-11-14 08:21:47,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 08:21:47,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442126808] [2024-11-14 08:21:47,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 08:21:47,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 08:21:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 08:22:24,184 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 08:22:24,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 08:22:24,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442126808] [2024-11-14 08:22:24,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442126808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 08:22:24,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 08:22:24,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2024-11-14 08:22:24,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530884615] [2024-11-14 08:22:24,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 08:22:24,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-14 08:22:24,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 08:22:24,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-14 08:22:24,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1860, Unknown=0, NotChecked=0, Total=2070 [2024-11-14 08:22:24,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:22:24,188 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 08:22:24,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 39.30434782608695) internal successors, (1808), 46 states have internal predecessors, (1808), 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 08:22:24,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:22:24,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:22:24,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 08:22:24,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:22:24,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-14 08:22:24,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-14 08:22:24,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-14 08:22:24,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-14 08:22:24,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:22:44,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:22:44,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:22:44,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 08:22:44,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:22:44,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 08:22:44,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 08:22:44,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-14 08:22:44,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 08:22:44,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-11-14 08:22:44,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-14 08:22:44,384 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 08:22:44,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 08:22:44,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1988737854, now seen corresponding path program 1 times [2024-11-14 08:22:44,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 08:22:44,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085870209] [2024-11-14 08:22:44,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 08:22:44,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 08:22:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 08:23:03,705 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 08:23:03,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 08:23:03,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085870209] [2024-11-14 08:23:03,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085870209] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 08:23:03,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194012297] [2024-11-14 08:23:03,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 08:23:03,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 08:23:03,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 08:23:03,708 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 08:23:03,709 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 08:23:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 08:23:04,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 3967 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-11-14 08:23:04,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 08:23:06,972 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 08:23:07,025 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 08:23:07,516 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 08:23:07,535 INFO L349 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2024-11-14 08:23:07,535 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 08:23:07,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:23:07,622 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 08:23:07,623 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 31 [2024-11-14 08:23:07,844 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 3 [2024-11-14 08:23:07,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:23:07,908 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 08:23:08,261 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 08:23:08,271 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 08:23:08,272 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 08:23:08,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:23:08,338 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 08:23:08,499 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 31 treesize of output 15 [2024-11-14 08:23:08,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:23:08,556 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 08:23:08,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:23:08,720 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 08:23:08,767 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 08:23:08,958 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 08:23:08,975 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-14 08:23:08,975 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 2 case distinctions, treesize of input 45 treesize of output 35 [2024-11-14 08:23:09,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:23:09,027 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 08:23:09,045 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 08:23:09,077 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 08:23:09,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 08:23:09,145 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 10 treesize of output 4 [2024-11-14 08:23:27,382 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_33| Int) (v_ArrVal_1338 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1334 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_31| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_31| 1))))) (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1334) |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 3208 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_33| 1)) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1338) |c_~#queue~0.base|) .cse1) 800) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_31|) (= 800 .cse4)))))))) is different from false [2024-11-14 08:23:35,006 INFO L349 Elim1Store]: treesize reduction 273, result has 40.9 percent of original size [2024-11-14 08:23:35,007 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 434 treesize of output 376 [2024-11-14 08:23:35,049 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-14 08:23:35,049 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 323 treesize of output 301 [2024-11-14 08:23:35,144 INFO L349 Elim1Store]: treesize reduction 72, result has 52.3 percent of original size [2024-11-14 08:23:35,144 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 128 treesize of output 187 [2024-11-14 08:23:35,178 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 08:23:35,178 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 178 treesize of output 178 [2024-11-14 08:23:35,226 INFO L349 Elim1Store]: treesize reduction 40, result has 29.8 percent of original size [2024-11-14 08:23:35,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 176 treesize of output 127 [2024-11-14 08:23:35,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 08:23:35,273 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 69 treesize of output 67 [2024-11-14 08:23:35,288 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 28 treesize of output 20 [2024-11-14 08:23:35,386 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 08:23:35,560 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 08:23:35,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 08:23:35,592 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 92 treesize of output 94 [2024-11-14 08:23:35,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 08:23:35,717 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 152 treesize of output 146 [2024-11-14 08:23:38,100 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 31 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 08:23:38,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194012297] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 08:23:38,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 08:23:38,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 37] total 92 [2024-11-14 08:23:38,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308827493] [2024-11-14 08:23:38,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 08:23:38,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2024-11-14 08:23:38,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 08:23:38,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2024-11-14 08:23:38,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=873, Invalid=7133, Unknown=188, NotChecked=178, Total=8372 [2024-11-14 08:23:38,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:23:38,115 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 08:23:38,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 60.19565217391305) internal successors, (5538), 92 states have internal predecessors, (5538), 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 08:23:38,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:23:38,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:23:38,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 08:23:38,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:23:38,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-14 08:23:38,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-14 08:23:38,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-14 08:23:38,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-14 08:23:38,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2024-11-14 08:23:38,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:24:29,397 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 08:24:31,406 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 08:24:40,086 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 08:24:46,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:24:46,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:24:46,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 08:24:46,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:24:46,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 08:24:46,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 08:24:46,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-14 08:24:46,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 08:24:46,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-11-14 08:24:46,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-14 08:24:46,435 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 08:24:46,617 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,SelfDestructingSolverStorable17 [2024-11-14 08:24:46,617 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 08:24:46,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 08:24:46,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1308059833, now seen corresponding path program 1 times [2024-11-14 08:24:46,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 08:24:46,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512144421] [2024-11-14 08:24:46,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 08:24:46,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 08:24:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 08:25:17,038 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 08:25:17,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 08:25:17,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512144421] [2024-11-14 08:25:17,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512144421] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 08:25:17,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875911947] [2024-11-14 08:25:17,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 08:25:17,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 08:25:17,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 08:25:17,041 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 08:25:17,042 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 08:25:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 08:25:17,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 3972 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-11-14 08:25:17,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 08:25:22,054 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 08:25:22,105 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 08:25:22,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 08:25:22,172 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 08:25:22,923 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 08:25:22,952 INFO L349 Elim1Store]: treesize reduction 102, result has 21.5 percent of original size [2024-11-14 08:25:22,952 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 08:25:23,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:25:23,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:25:23,058 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 08:25:23,059 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 43 [2024-11-14 08:25:23,341 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 08:25:23,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:25:23,460 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 08:25:24,009 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 08:25:24,028 INFO L349 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2024-11-14 08:25:24,029 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 08:25:24,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:25:24,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:25:24,135 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 08:25:24,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 08:25:24,438 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 40 treesize of output 27 [2024-11-14 08:25:24,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:25:24,561 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 08:25:24,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:25:24,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:25:24,925 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 08:25:25,171 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 08:25:25,667 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 08:25:25,700 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-11-14 08:25:25,700 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 47 [2024-11-14 08:25:25,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:25:25,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:25:25,807 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 08:25:25,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 08:25:25,986 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 08:25:26,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:25:26,077 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 08:25:26,290 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 08:25:26,302 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 08:25:26,348 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 08:25:26,349 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 08:25:26,477 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1628 (Array Int Int))) (not (= 800 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|))))) is different from false [2024-11-14 08:25:34,202 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| Int) (v_ArrVal_1622 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1628 (Array Int 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|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1622) |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| 1)) (.cse4 (+ |c_~#queue~0.offset| (* (select .cse1 .cse6) 4)))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 .cse3) .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|) .cse2) 800)) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20|) (= 800 (select (store (store (store .cse1 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse3) .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse6))))))) is different from false [2024-11-14 08:25:34,222 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| Int) (v_ArrVal_1622 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1628 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (let ((.cse0 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1622) |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| 1)) (.cse4 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse5)))) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ 3200 |c_~#queue~0.offset|))) (or (= (select (store (store (store .cse0 .cse1 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse3) .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5) 800) (< (select .cse0 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20|) (not (= 800 (select (select (store (store .cse6 |c_~#queue~0.base| (store (store (store (store .cse0 .cse2 .cse3) .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|) .cse2)))))))) is different from false [2024-11-14 08:25:34,243 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| Int) (v_ArrVal_1622 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1628 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 1)))))) (let ((.cse0 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1622) |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| 1)) (.cse4 (+ |c_~#queue~0.offset| (* (select .cse0 .cse5) 4))) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ 3200 |c_~#queue~0.offset|))) (or (= (select (store (store (store .cse0 .cse1 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse3) .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5) 800) (not (= 800 (select (select (store (store .cse6 |c_~#queue~0.base| (store (store (store (store .cse0 .cse2 .cse3) .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|) .cse2))) (< (select .cse0 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20|)))))) is different from false [2024-11-14 08:25:34,277 WARN L851 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 800) (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| Int) (v_ArrVal_1622 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1628 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 1)))))) (let ((.cse0 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1622) |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| 1)) (.cse4 (+ |c_~#queue~0.offset| (* (select .cse0 .cse5) 4))) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ 3200 |c_~#queue~0.offset|))) (or (= (select (store (store (store .cse0 .cse1 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse3) .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5) 800) (not (= 800 (select (select (store (store .cse6 |c_~#queue~0.base| (store (store (store (store .cse0 .cse2 .cse3) .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|) .cse2))) (< (select .cse0 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20|))))))) is different from false [2024-11-14 08:25:34,298 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse8 .cse9))) (or (= 800 .cse0) (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| Int) (v_ArrVal_1622 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1628 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse9 (+ .cse0 1))))) (let ((.cse1 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1622) |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| 1)) (.cse5 (+ |c_~#queue~0.offset| (* (select .cse1 .cse6) 4))) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ 3200 |c_~#queue~0.offset|))) (or (= (select (store (store (store .cse1 .cse2 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse4) .cse5 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse6) 800) (not (= 800 (select (select (store (store .cse7 |c_~#queue~0.base| (store (store (store (store .cse1 .cse3 .cse4) .cse5 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|) .cse3))) (< (select .cse1 .cse3) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20|))))))))) is different from false [2024-11-14 08:25:34,380 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (select .cse7 .cse8))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| Int) (v_ArrVal_1622 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1628 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ .cse9 1))))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1622) |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| 1)) (.cse4 (+ |c_~#queue~0.offset| (* (select .cse1 .cse6) 4))) (.cse2 (+ 3200 |c_~#queue~0.offset|))) (or (not (= 800 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 .cse3) .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|) .cse2))) (= (select (store (store (store .cse1 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse3) .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse6) 800) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20|)))))) (= 800 .cse9)))) is different from false [2024-11-14 08:25:34,866 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int)) (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse7 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse9 (select .cse7 .cse8))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| Int) (v_ArrVal_1622 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1628 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ .cse9 1))))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1622) |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| 1)) (.cse4 (+ |c_~#queue~0.offset| (* (select .cse1 .cse6) 4)))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 .cse3) .cse4 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|) .cse2) 800)) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20|) (= 800 (select (store (store (store .cse1 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse3) .cse4 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse6))))))) (= 800 .cse9))))) (< (select .cse10 .cse8) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)))) is different from false [2024-11-14 08:25:34,951 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| Int) (v_ArrVal_1622 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1628 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse10 (store .cse7 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse9 (select .cse10 .cse8))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse10 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ .cse9 1))))) (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1622) |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| 1)) (.cse4 (+ (* (select .cse0 .cse6) 4) |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 .cse3) .cse4 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|) .cse1) 800)) (< (select .cse7 .cse8) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (= .cse9 800) (= 800 (select (store (store (store .cse0 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse3) .cse4 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse6)))))))))) is different from false [2024-11-14 08:25:36,730 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| Int) (v_ArrVal_1622 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (v_ArrVal_1618 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1628 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse7 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1618) |c_~#queue~0.base|))) (let ((.cse8 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (select .cse8 .cse5))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse8 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse5 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1622) |c_~#queue~0.base|))) (let ((.cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| 1)) (.cse4 (+ (* (select .cse0 .cse5) 4) |c_~#queue~0.offset|)) (.cse2 (+ 3200 |c_~#queue~0.offset|))) (or (= (select (store (store (store .cse0 .cse1 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse3) .cse4 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse5) 800) (= .cse6 800) (not (= (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse0 .cse2 .cse3) .cse4 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|) .cse2) 800)) (< (select .cse0 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20|) (< (select .cse7 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)))))))) is different from false [2024-11-14 08:25:37,456 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| Int)) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| Int) (v_ArrVal_1622 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (v_ArrVal_1618 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1628 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| 1))))) (let ((.cse8 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1618) |c_~#queue~0.base|))) (let ((.cse9 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (select .cse9 .cse5))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse9 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse5 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1622) |c_~#queue~0.base|))) (let ((.cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| 1)) (.cse4 (+ (* (select .cse0 .cse5) 4) |c_~#queue~0.offset|)) (.cse2 (+ 3200 |c_~#queue~0.offset|))) (or (= (select (store (store (store .cse0 .cse1 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse3) .cse4 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse5) 800) (< (select .cse0 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20|) (= 800 .cse6) (not (= (select (select (store (store .cse7 |c_~#queue~0.base| (store (store (store (store .cse0 .cse2 .cse3) .cse4 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|) .cse2) 800)) (< (select .cse8 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|))))))))) (< |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45|))) is different from false [2024-11-14 08:25:37,502 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| Int) (v_ArrVal_1622 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (v_ArrVal_1618 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1628 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| 1))))) (let ((.cse10 (select (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_1618) |c_~#queue~0.base|))) (let ((.cse11 (store .cse10 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse8 (select .cse11 .cse5))) (let ((.cse0 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse11 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse5 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_1622) |c_~#queue~0.base|))) (let ((.cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| 1)) (.cse4 (+ (* (select .cse0 .cse5) 4) |c_~#queue~0.offset|)) (.cse2 (+ 3200 |c_~#queue~0.offset|))) (or (= (select (store (store (store .cse0 .cse1 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse3) .cse4 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse5) 800) (< (select .cse0 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20|) (< (select .cse6 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45|) (= 800 .cse8) (not (= (select (select (store (store .cse9 |c_~#queue~0.base| (store (store (store (store .cse0 .cse2 .cse3) .cse4 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|) .cse2) 800)) (< (select .cse10 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)))))))))) is different from false [2024-11-14 08:25:37,747 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| Int) (v_ArrVal_1622 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_48| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (v_ArrVal_1618 (Array Int Int)) (v_ArrVal_1628 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| 1))))) (let ((.cse10 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1618) |c_~#queue~0.base|))) (let ((.cse11 (store .cse10 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse9 (+ |c_~#queue~0.offset| 3204))) (let ((.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (select .cse11 .cse9))) (let ((.cse4 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse11 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_48| 1)) .cse9 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_1622) |c_~#queue~0.base|))) (let ((.cse5 (+ 3200 |c_~#queue~0.offset|)) (.cse6 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| 1)) (.cse7 (+ |c_~#queue~0.offset| (* (select .cse4 .cse9) 4)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45|) (= 800 .cse2) (not (= (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse4 .cse5 .cse6) .cse7 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|) .cse5) 800)) (< (select .cse4 .cse5) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20|) (< (select .cse10 .cse9) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (= (select (store (store (store .cse4 .cse8 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse5 .cse6) .cse7 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse9) 800)))))))))) is different from false [2024-11-14 08:25:37,937 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| Int) (v_ArrVal_1622 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_48| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (v_ArrVal_1618 (Array Int Int)) (v_ArrVal_1628 (Array Int Int))) (let ((.cse9 (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|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse9 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| 1))))) (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1618) |c_~#queue~0.base|))) (let ((.cse11 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |v_t1Thread1of1ForFork0_enqueue_~x#1_38|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse8 (select .cse11 .cse1))) (let ((.cse3 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse11 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_48| 1)) .cse1 (+ 1 .cse8))) |c_~#stored_elements~0.base| v_ArrVal_1622) |c_~#queue~0.base|))) (let ((.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse5 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| 1)) (.cse6 (+ (* 4 (select .cse3 .cse1)) |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store .cse3 .cse4 .cse5) .cse6 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|) .cse4) 800)) (= 800 .cse8) (< (select .cse3 .cse4) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20|) (< (select .cse9 .cse10) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45|) (= (select (store (store (store .cse3 .cse7 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 .cse5) .cse6 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse1) 800)))))))))) is different from false [2024-11-14 08:25:38,008 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46| Int)) (let ((.cse1 (+ 3204 |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_t1Thread1of1ForFork0_enqueue_~x#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| Int) (v_ArrVal_1622 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_48| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (v_ArrVal_1618 (Array Int Int)) (v_ArrVal_1628 (Array Int Int))) (let ((.cse9 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse9 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| 1))))) (let ((.cse10 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1618) |c_~#queue~0.base|))) (let ((.cse12 (store .cse10 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |v_t1Thread1of1ForFork0_enqueue_~x#1_38|)) (.cse8 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse11 (select .cse12 .cse8))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse12 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_48| 1)) .cse8 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_1622) |c_~#queue~0.base|))) (let ((.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse5 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| 1)) (.cse6 (+ (* 4 (select .cse2 .cse8)) |c_~#queue~0.offset|))) (or (< (select .cse2 .cse3) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20|) (not (= (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse2 .cse3 .cse5) .cse6 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|) .cse3) 800)) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45|) (= (select (store (store (store .cse2 .cse7 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse5) .cse6 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse8) 800) (< (select .cse10 .cse8) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (= 800 .cse11))))))))))))) is different from false [2024-11-14 08:25:38,135 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| Int) (v_ArrVal_1622 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_48| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46| Int) (v_ArrVal_1618 (Array Int Int)) (v_ArrVal_1628 (Array Int Int))) (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| 1))))) (let ((.cse8 (select (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_1618) |c_~#queue~0.base|))) (let ((.cse12 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |v_t1Thread1of1ForFork0_enqueue_~x#1_38|)) (.cse7 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse11 (select .cse12 .cse7))) (let ((.cse2 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse12 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_48| 1)) .cse7 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_1622) |c_~#queue~0.base|))) (let ((.cse5 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20| 1)) (.cse6 (+ (* (select .cse2 .cse7) 4) |c_~#queue~0.offset|)) (.cse4 (+ 3200 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45|) (= (select (store (store (store .cse2 .cse3 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 .cse5) .cse6 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse7) 800) (< (select .cse2 .cse4) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_20|) (< (select .cse8 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (not (= 800 (select (select (store (store .cse9 |c_~#queue~0.base| (store (store (store (store .cse2 .cse4 .cse5) .cse6 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1)) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|) .cse4))) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) (= .cse11 800))))))))))) is different from false [2024-11-14 08:25:45,554 INFO L349 Elim1Store]: treesize reduction 410, result has 38.6 percent of original size [2024-11-14 08:25:45,555 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 1492 treesize of output 825 [2024-11-14 08:25:45,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 08:25:45,607 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 883 treesize of output 881 [2024-11-14 08:25:45,631 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 46 treesize of output 30 [2024-11-14 08:25:45,654 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 38 treesize of output 30 [2024-11-14 08:25:45,677 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 59 treesize of output 55 [2024-11-14 08:25:45,756 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 08:25:45,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 08:25:45,933 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 123 treesize of output 131 [2024-11-14 08:25:46,132 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 08:25:46,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 08:25:46,274 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 307 treesize of output 315 [2024-11-14 08:26:01,497 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 26 not checked. [2024-11-14 08:26:01,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875911947] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 08:26:01,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 08:26:01,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 38, 47] total 121 [2024-11-14 08:26:01,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882488526] [2024-11-14 08:26:01,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 08:26:01,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 121 states [2024-11-14 08:26:01,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 08:26:01,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2024-11-14 08:26:01,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1334, Invalid=9554, Unknown=96, NotChecked=3536, Total=14520 [2024-11-14 08:26:01,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:26:01,510 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 08:26:01,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 121 states, 121 states have (on average 46.29752066115702) internal successors, (5602), 121 states have internal predecessors, (5602), 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 08:26:01,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:26:01,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:26:01,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 08:26:01,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:26:01,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-14 08:26:01,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-14 08:26:01,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-14 08:26:01,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-14 08:26:01,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2024-11-14 08:26:01,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-11-14 08:26:01,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:26:56,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 08:26:56,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:26:56,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 08:26:56,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 08:26:56,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 08:26:56,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 08:26:56,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-14 08:26:56,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 08:26:56,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-11-14 08:26:56,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-14 08:26:56,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-11-14 08:26:56,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 08:26:57,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 08:26:57,148 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 08:26:57,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 08:26:57,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1451431204, now seen corresponding path program 1 times [2024-11-14 08:26:57,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 08:26:57,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877068947] [2024-11-14 08:26:57,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 08:26:57,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 08:26:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 08:27:42,141 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 08:27:42,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 08:27:42,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877068947] [2024-11-14 08:27:42,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877068947] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 08:27:42,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663122536] [2024-11-14 08:27:42,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 08:27:42,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 08:27:42,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 08:27:42,143 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 08:27:42,144 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 08:27:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 08:27:42,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 3975 conjuncts, 150 conjuncts are in the unsatisfiable core [2024-11-14 08:27:42,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 08:27:50,217 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 08:27:50,295 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 08:27:50,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 08:27:50,385 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 08:27:51,319 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 08:27:51,346 INFO L349 Elim1Store]: treesize reduction 102, result has 21.5 percent of original size [2024-11-14 08:27:51,347 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 08:27:51,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:27:51,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:27:51,488 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 08:27:51,488 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 43 [2024-11-14 08:27:51,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 08:27:51,855 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 08:27:52,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:27:52,032 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 08:27:53,149 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 08:27:53,167 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2024-11-14 08:27:53,168 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 39 [2024-11-14 08:27:53,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:27:53,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:27:53,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:27:53,406 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 47 treesize of output 37 [2024-11-14 08:27:54,010 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 08:27:54,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:27:54,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 08:27:54,266 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 41 [2024-11-14 08:27:55,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:27:55,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:27:55,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:27:55,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:27:55,256 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 51 treesize of output 44 [2024-11-14 08:27:55,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:27:55,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 08:27:55,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 44 [2024-11-14 08:27:56,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:27:56,928 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 08:27:56,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:27:56,969 INFO L349 Elim1Store]: treesize reduction 78, result has 33.9 percent of original size [2024-11-14 08:27:56,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 67 treesize of output 78 [2024-11-14 08:27:57,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:27:57,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:27:57,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:27:57,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:27:57,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:27:57,202 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 58 treesize of output 51 [2024-11-14 08:27:57,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:27:57,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 08:27:57,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 47 [2024-11-14 08:27:58,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:27:58,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 08:27:58,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 45 [2024-11-14 08:27:59,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:27:59,230 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 50 treesize of output 37 [2024-11-14 08:27:59,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 08:27:59,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 18 [2024-11-14 08:27:59,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 08:27:59,409 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 16 treesize of output 11 [2024-11-14 08:27:59,730 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 15 treesize of output 7 [2024-11-14 08:27:59,817 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 08:27:59,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 08:28:00,169 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_t2Thread1of1ForFork1_dequeue_~x~0#1| 0)) (.cse1 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|))) (and (or (not .cse0) (forall ((v_ArrVal_1918 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse1) 1)))) (or .cse0 (forall ((v_ArrVal_1918 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse1) 0)))))) is different from false [2024-11-14 08:28:01,792 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (let ((.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse1 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|)) (.cse5 (select .cse4 |c_~#stored_elements~0.base|)) (.cse6 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)))) (and (forall ((v_ArrVal_1916 Int)) (let ((.cse0 (store .cse4 |c_~#stored_elements~0.base| (store .cse5 .cse6 v_ArrVal_1916)))) (or (forall ((v_ArrVal_1918 (Array Int Int))) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse1) 1))) (not (= (let ((.cse2 (select .cse0 |c_~#queue~0.base|))) (select .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)))) 0))))) (forall ((v_ArrVal_1916 Int)) (let ((.cse8 (store .cse4 |c_~#stored_elements~0.base| (store .cse5 .cse6 v_ArrVal_1916)))) (or (= (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (select .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse3) 4)))) 0) (forall ((v_ArrVal_1918 (Array Int Int))) (not (= (select (select (store .cse8 |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse1) 0))))))))) is different from false [2024-11-14 08:30:43,764 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse27 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) (.cse16 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse17 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse7 (select .cse16 .cse17)) (.cse9 (+ |c_~#stored_elements~0.offset| 8 .cse27)) (.cse13 (+ 3208 |c_~#queue~0.offset|)) (.cse14 (+ |c_~#queue~0.offset| 3204)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse15 (+ |c_~#stored_elements~0.offset| 4 .cse27))) (and (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1918 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse16 .cse17 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse8 (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) .cse15 |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (let ((.cse11 (+ (select .cse10 .cse1) 1)) (.cse12 (+ (* (select .cse10 .cse14) 4) |c_~#queue~0.offset|))) (let ((.cse5 (select (store (store (store .cse10 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse11) .cse12 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse14))) (let ((.cse3 (store (store (store (store .cse10 .cse1 .cse11) .cse12 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse14 (+ .cse5 1)))) (let ((.cse4 (store (select (store .cse8 |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (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)) (= 800 .cse5) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse6) 1)) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| .cse7)))))))))) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1918 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse19 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse16 .cse17 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse23 (store .cse19 |c_~#stored_elements~0.base| (store (select .cse19 |c_~#stored_elements~0.base|) .cse15 |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse24 (select .cse23 |c_~#queue~0.base|))) (let ((.cse25 (+ (select .cse24 .cse1) 1)) (.cse26 (+ (* (select .cse24 .cse14) 4) |c_~#queue~0.offset|))) (let ((.cse18 (select (store (store (store .cse24 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse25) .cse26 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse14))) (let ((.cse22 (store (store (store (store .cse24 .cse1 .cse25) .cse26 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse14 (+ .cse18 1)))) (let ((.cse20 (store (select (store .cse23 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (= 800 .cse18) (not (= (select (select (store (store .cse19 |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse6) 0)) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| .cse7) (= (let ((.cse21 (select (store (store .cse19 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base|))) (select .cse21 (+ (* (select .cse21 .cse1) 4) |c_~#queue~0.offset|))) 0))))))))))))) is different from false [2024-11-14 08:30:44,661 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse28 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) (.cse16 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse18 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (select .cse16 .cse18)) (.cse7 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse9 (+ |c_~#stored_elements~0.offset| 8 .cse28)) (.cse13 (+ 3208 |c_~#queue~0.offset|)) (.cse14 (+ |c_~#queue~0.offset| 3204)) (.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse15 (+ |c_~#stored_elements~0.offset| 4 .cse28)) (.cse17 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse16 .cse17 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse18 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse8 (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) .cse15 |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (let ((.cse11 (+ (select .cse10 .cse2) 1)) (.cse12 (+ (* (select .cse10 .cse14) 4) |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store (store .cse10 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse11) .cse12 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse14))) (let ((.cse4 (store (store (store (store .cse10 .cse2 .cse11) .cse12 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse13 (+ v_subst_1 1)) .cse14 (+ .cse0 1)))) (let ((.cse5 (store (select (store .cse8 |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (= .cse0 800) (= (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) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| .cse6) (not (= (select (select (store (store .cse3 |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse7) 0))))))))))) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_2 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse21 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse16 .cse17 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse18 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse24 (store .cse21 |c_~#stored_elements~0.base| (store (select .cse21 |c_~#stored_elements~0.base|) .cse15 |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse25 (select .cse24 |c_~#queue~0.base|))) (let ((.cse26 (+ (select .cse25 .cse2) 1)) (.cse27 (+ (* (select .cse25 .cse14) 4) |c_~#queue~0.offset|))) (let ((.cse19 (select (store (store (store .cse25 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse26) .cse27 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse14))) (let ((.cse22 (store (store (store (store .cse25 .cse2 .cse26) .cse27 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse13 (+ v_subst_2 1)) .cse14 (+ .cse19 1)))) (let ((.cse23 (store (select (store .cse24 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (= .cse19 800) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| .cse6) (not (= (let ((.cse20 (select (store (store .cse21 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base|))) (select .cse20 (+ |c_~#queue~0.offset| (* (select .cse20 .cse2) 4)))) 0)) (not (= (select (select (store (store .cse21 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse7) 1)))))))))))))) is different from false [2024-11-14 08:30:45,477 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse28 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) (.cse16 (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|)) (.cse18 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse5 (select .cse16 .cse18)) (.cse9 (+ |c_~#stored_elements~0.offset| 8 .cse28)) (.cse13 (+ 3208 |c_~#queue~0.offset|)) (.cse14 (+ |c_~#queue~0.offset| 3204)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse15 (+ |c_~#stored_elements~0.offset| 4 .cse28)) (.cse17 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse16 .cse17 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse18 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse8 (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) .cse15 |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (let ((.cse11 (+ (select .cse10 .cse1) 1)) (.cse12 (+ |c_~#queue~0.offset| (* (select .cse10 .cse14) 4)))) (let ((.cse7 (select (store (store (store .cse10 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse11) .cse12 v_subst_3) .cse14))) (let ((.cse3 (store (store (store (store .cse10 .cse1 .cse11) .cse12 v_subst_3) .cse13 (+ v_subst_1 1)) .cse14 (+ .cse7 1)))) (let ((.cse4 (store (select (store .cse8 |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (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) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| .cse5) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse6) 0)) (= .cse7 800)))))))))) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse19 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse16 .cse17 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse18 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse24 (store .cse19 |c_~#stored_elements~0.base| (store (select .cse19 |c_~#stored_elements~0.base|) .cse15 |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse25 (select .cse24 |c_~#queue~0.base|))) (let ((.cse26 (+ (select .cse25 .cse1) 1)) (.cse27 (+ |c_~#queue~0.offset| (* (select .cse25 .cse14) 4)))) (let ((.cse23 (select (store (store (store .cse25 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse26) .cse27 v_subst_4) .cse14))) (let ((.cse22 (store (store (store (store .cse25 .cse1 .cse26) .cse27 v_subst_4) .cse13 (+ v_subst_2 1)) .cse14 (+ .cse23 1)))) (let ((.cse20 (store (select (store .cse24 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (not (= (select (select (store (store .cse19 |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse6) 1)) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| .cse5) (not (= (let ((.cse21 (select (store (store .cse19 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base|))) (select .cse21 (+ |c_~#queue~0.offset| (* (select .cse21 .cse1) 4)))) 0)) (= .cse23 800))))))))))))) is different from false [2024-11-14 08:30:45,811 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse18 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse28 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) (.cse16 (let ((.cse29 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse29 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* (select .cse29 .cse18) 4)) |c_t1Thread1of1ForFork0_enqueue_~x#1|)))) (let ((.cse7 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse6 (select .cse16 .cse18)) (.cse9 (+ |c_~#stored_elements~0.offset| 8 .cse28)) (.cse13 (+ 3208 |c_~#queue~0.offset|)) (.cse14 (+ |c_~#queue~0.offset| 3204)) (.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse15 (+ |c_~#stored_elements~0.offset| 4 .cse28)) (.cse17 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse16 .cse17 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse18 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse8 (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) .cse15 |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (let ((.cse11 (+ (select .cse10 .cse2) 1)) (.cse12 (+ |c_~#queue~0.offset| (* (select .cse10 .cse14) 4)))) (let ((.cse0 (select (store (store (store .cse10 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse11) .cse12 v_subst_3) .cse14))) (let ((.cse4 (store (store (store (store .cse10 .cse2 .cse11) .cse12 v_subst_3) .cse13 (+ v_subst_1 1)) .cse14 (+ .cse0 1)))) (let ((.cse5 (store (select (store .cse8 |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (= 800 .cse0) (= (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) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| .cse6) (not (= (select (select (store (store .cse3 |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse7) 0))))))))))) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse21 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse16 .cse17 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse18 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse24 (store .cse21 |c_~#stored_elements~0.base| (store (select .cse21 |c_~#stored_elements~0.base|) .cse15 |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse25 (select .cse24 |c_~#queue~0.base|))) (let ((.cse26 (+ (select .cse25 .cse2) 1)) (.cse27 (+ |c_~#queue~0.offset| (* (select .cse25 .cse14) 4)))) (let ((.cse19 (select (store (store (store .cse25 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse26) .cse27 v_subst_4) .cse14))) (let ((.cse22 (store (store (store (store .cse25 .cse2 .cse26) .cse27 v_subst_4) .cse13 (+ v_subst_2 1)) .cse14 (+ .cse19 1)))) (let ((.cse23 (store (select (store .cse24 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (= 800 .cse19) (not (= (let ((.cse20 (select (store (store .cse21 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base|))) (select .cse20 (+ (* (select .cse20 .cse2) 4) |c_~#queue~0.offset|))) 0)) (not (= (select (select (store (store .cse21 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse7) 1)) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| .cse6)))))))))))))) is different from false [2024-11-14 08:30:46,048 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse18 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse28 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) (.cse16 (let ((.cse29 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse29 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* (select .cse29 .cse18) 4)) |c_t1Thread1of1ForFork0_enqueue_#in~x#1|)))) (let ((.cse4 (select .cse16 .cse18)) (.cse2 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse9 (+ |c_~#stored_elements~0.offset| 8 .cse28)) (.cse13 (+ 3208 |c_~#queue~0.offset|)) (.cse14 (+ |c_~#queue~0.offset| 3204)) (.cse6 (+ 3200 |c_~#queue~0.offset|)) (.cse15 (+ |c_~#stored_elements~0.offset| 4 .cse28)) (.cse17 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse16 .cse17 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse18 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse8 (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) .cse15 |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (let ((.cse11 (+ (select .cse10 .cse6) 1)) (.cse12 (+ (* (select .cse10 .cse14) 4) |c_~#queue~0.offset|))) (let ((.cse3 (select (store (store (store .cse10 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse6 .cse11) .cse12 v_subst_4) .cse14))) (let ((.cse7 (store (store (store (store .cse10 .cse6 .cse11) .cse12 v_subst_4) .cse13 (+ v_subst_2 1)) .cse14 (+ .cse3 1)))) (let ((.cse1 (store (select (store .cse8 |c_~#queue~0.base| .cse7) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse2) 1)) (= .cse3 800) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| .cse4) (not (= (let ((.cse5 (select (store (store .cse0 |c_~#queue~0.base| .cse7) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse6) 4)))) 0))))))))))) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse20 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse16 .cse17 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse18 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse24 (store .cse20 |c_~#stored_elements~0.base| (store (select .cse20 |c_~#stored_elements~0.base|) .cse15 |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse25 (select .cse24 |c_~#queue~0.base|))) (let ((.cse26 (+ (select .cse25 .cse6) 1)) (.cse27 (+ (* (select .cse25 .cse14) 4) |c_~#queue~0.offset|))) (let ((.cse19 (select (store (store (store .cse25 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse6 .cse26) .cse27 v_subst_3) .cse14))) (let ((.cse23 (store (store (store (store .cse25 .cse6 .cse26) .cse27 v_subst_3) .cse13 (+ v_subst_1 1)) .cse14 (+ .cse19 1)))) (let ((.cse21 (store (select (store .cse24 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| .cse4) (= .cse19 800) (not (= (select (select (store (store .cse20 |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse2) 0)) (= (let ((.cse22 (select (store (store .cse20 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base|))) (select .cse22 (+ (* (select .cse22 .cse6) 4) |c_~#queue~0.offset|))) 0)))))))))))))) is different from false [2024-11-14 08:30:46,369 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse18 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse28 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) (.cse16 (let ((.cse29 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse29 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 (select .cse29 .cse18))) |c_t1Thread1of1ForFork0_enqueue_#in~x#1|)))) (let ((.cse6 (select .cse16 .cse18)) (.cse2 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse9 (+ |c_~#stored_elements~0.offset| 8 .cse28)) (.cse13 (+ 3208 |c_~#queue~0.offset|)) (.cse14 (+ |c_~#queue~0.offset| 3204)) (.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse15 (+ |c_~#stored_elements~0.offset| 4 .cse28)) (.cse17 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (and (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse16 .cse17 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse18 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse8 (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) .cse15 |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (let ((.cse11 (+ (select .cse10 .cse4) 1)) (.cse12 (+ (* (select .cse10 .cse14) 4) |c_~#queue~0.offset|))) (let ((.cse7 (select (store (store (store .cse10 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 .cse11) .cse12 v_subst_4) .cse14))) (let ((.cse5 (store (store (store (store .cse10 .cse4 .cse11) .cse12 v_subst_4) .cse13 (+ v_subst_2 1)) .cse14 (+ .cse7 1)))) (let ((.cse1 (store (select (store .cse8 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1918) |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 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)))) 0)) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| .cse6) (= 800 .cse7)))))))))) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse21 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse16 .cse17 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse18 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse24 (store .cse21 |c_~#stored_elements~0.base| (store (select .cse21 |c_~#stored_elements~0.base|) .cse15 |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse25 (select .cse24 |c_~#queue~0.base|))) (let ((.cse26 (+ (select .cse25 .cse4) 1)) (.cse27 (+ (* (select .cse25 .cse14) 4) |c_~#queue~0.offset|))) (let ((.cse19 (select (store (store (store .cse25 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 .cse26) .cse27 v_subst_3) .cse14))) (let ((.cse22 (store (store (store (store .cse25 .cse4 .cse26) .cse27 v_subst_3) .cse13 (+ v_subst_1 1)) .cse14 (+ .cse19 1)))) (let ((.cse23 (store (select (store .cse24 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (= .cse19 800) (= (let ((.cse20 (select (store (store .cse21 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base|))) (select .cse20 (+ (* (select .cse20 .cse4) 4) |c_~#queue~0.offset|))) 0) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| .cse6) (not (= (select (select (store (store .cse21 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse2) 0))))))))))))))) is different from false [2024-11-14 08:30:46,996 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse28 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (let ((.cse3 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse9 (+ |c_~#stored_elements~0.offset| 8 .cse28)) (.cse5 (+ 3200 |c_~#queue~0.offset|)) (.cse15 (+ |c_~#stored_elements~0.offset| 4 .cse28)) (.cse13 (+ 3208 |c_~#queue~0.offset|)) (.cse17 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse0 (store .cse16 .cse17 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse14 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse8 (store (select .cse14 |c_~#stored_elements~0.base|) .cse15 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse10 (select (store .cse14 |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base|))) (let ((.cse11 (+ (select .cse10 .cse5) 1)) (.cse12 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|))) (let ((.cse7 (select (store (store (store .cse10 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse5 .cse11) .cse12 v_subst_3) .cse1))) (let ((.cse6 (store (store (store (store .cse10 .cse5 .cse11) .cse12 v_subst_3) .cse13 (+ v_subst_1 1)) .cse1 (+ .cse7 1)))) (let ((.cse2 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse0 .cse1)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse3) 0)) (= 0 (let ((.cse4 (select (store (store |c_#memory_int| |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))))) (= 800 .cse7))))))))))) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse19 (store .cse16 .cse17 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse27 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse19 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse23 (store (select .cse27 |c_~#stored_elements~0.base|) .cse15 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse24 (select (store .cse27 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base|))) (let ((.cse25 (+ (select .cse24 .cse5) 1)) (.cse26 (+ (* (select .cse24 .cse1) 4) |c_~#queue~0.offset|))) (let ((.cse18 (select (store (store (store .cse24 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse5 .cse25) .cse26 v_subst_4) .cse1))) (let ((.cse21 (store (store (store (store .cse24 .cse5 .cse25) .cse26 v_subst_4) .cse13 (+ v_subst_2 1)) .cse1 (+ .cse18 1)))) (let ((.cse22 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (= 800 .cse18) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse19 .cse1)) (not (= (let ((.cse20 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base|))) (select .cse20 (+ (* (select .cse20 .cse5) 4) |c_~#queue~0.offset|))) 0)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse3) 1))))))))))))))) is different from false [2024-11-14 08:30:49,076 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse28 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (let ((.cse3 (+ |c_~#stored_elements~0.offset| 4)) (.cse9 (+ |c_~#stored_elements~0.offset| 8 .cse28)) (.cse5 (+ 3200 |c_~#queue~0.offset|)) (.cse15 (+ |c_~#stored_elements~0.offset| 4 .cse28)) (.cse13 (+ 3208 |c_~#queue~0.offset|)) (.cse17 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse0 (store .cse16 .cse17 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse14 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse8 (store (select .cse14 |c_~#stored_elements~0.base|) .cse15 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse10 (select (store .cse14 |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base|))) (let ((.cse11 (+ (select .cse10 .cse5) 1)) (.cse12 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|))) (let ((.cse7 (select (store (store (store .cse10 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse5 .cse11) .cse12 v_subst_3) .cse1))) (let ((.cse6 (store (store (store (store .cse10 .cse5 .cse11) .cse12 v_subst_3) .cse13 (+ v_subst_1 1)) .cse1 (+ .cse7 1)))) (let ((.cse2 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse0 .cse1)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse3) 0)) (= 0 (let ((.cse4 (select (store (store |c_#memory_int| |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))))) (= 800 .cse7))))))))))) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse19 (store .cse16 .cse17 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse27 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse19 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse23 (store (select .cse27 |c_~#stored_elements~0.base|) .cse15 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse24 (select (store .cse27 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base|))) (let ((.cse25 (+ (select .cse24 .cse5) 1)) (.cse26 (+ (* (select .cse24 .cse1) 4) |c_~#queue~0.offset|))) (let ((.cse18 (select (store (store (store .cse24 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse5 .cse25) .cse26 v_subst_4) .cse1))) (let ((.cse21 (store (store (store (store .cse24 .cse5 .cse25) .cse26 v_subst_4) .cse13 (+ v_subst_2 1)) .cse1 (+ .cse18 1)))) (let ((.cse22 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (= 800 .cse18) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse19 .cse1)) (not (= (let ((.cse20 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base|))) (select .cse20 (+ (* (select .cse20 .cse5) 4) |c_~#queue~0.offset|))) 0)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse3) 1))))))))))))))) is different from false [2024-11-14 08:30:50,558 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse9 (+ |c_~#stored_elements~0.offset| 8)) (.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#stored_elements~0.offset| 4)) (.cse13 (+ 3208 |c_~#queue~0.offset|)) (.cse16 (+ (* (select .cse15 .cse1) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse0 (store .cse15 .cse16 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse14 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse8 (store (select .cse14 |c_~#stored_elements~0.base|) .cse7 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse10 (select (store .cse14 |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base|))) (let ((.cse11 (+ (select .cse10 .cse3) 1)) (.cse12 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|))) (let ((.cse6 (select (store (store (store .cse10 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse11) .cse12 v_subst_4) .cse1))) (let ((.cse4 (store (store (store (store .cse10 .cse3 .cse11) .cse12 v_subst_4) .cse13 (+ v_subst_2 1)) .cse1 (+ .cse6 1)))) (let ((.cse5 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse0 .cse1)) (not (= (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base|))) (select .cse2 (+ |c_~#queue~0.offset| (* 4 (select .cse2 .cse3))))) 0)) (= .cse6 800) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse7) 1)))))))))))) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse17 (store .cse15 .cse16 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse26 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse17 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1))))) (let ((.cse22 (store (select .cse26 |c_~#stored_elements~0.base|) .cse7 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse23 (select (store .cse26 |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base|))) (let ((.cse24 (+ (select .cse23 .cse3) 1)) (.cse25 (+ (* (select .cse23 .cse1) 4) |c_~#queue~0.offset|))) (let ((.cse18 (select (store (store (store .cse23 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse24) .cse25 v_subst_3) .cse1))) (let ((.cse21 (store (store (store (store .cse23 .cse3 .cse24) .cse25 v_subst_3) .cse13 (+ v_subst_1 1)) .cse1 (+ .cse18 1)))) (let ((.cse19 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse17 .cse1)) (= .cse18 800) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse7) 0)) (= (let ((.cse20 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (select .cse20 (+ (* 4 (select .cse20 .cse3)) |c_~#queue~0.offset|))) 0)))))))))))))) is different from false [2024-11-14 08:30:53,516 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_~#stored_elements~0.offset| 8)) (.cse6 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#stored_elements~0.offset| 4)) (.cse13 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_ArrVal_1904 (Array Int Int)) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse15 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1904))) (let ((.cse0 (let ((.cse16 (select .cse15 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse14 (store (store .cse0 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse8 (store (select (store .cse15 |c_~#queue~0.base| .cse14) |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse10 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse14) |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base|))) (let ((.cse11 (+ (select .cse10 .cse6) 1)) (.cse12 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store (store .cse10 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse6 .cse11) .cse12 v_subst_3) .cse1))) (let ((.cse7 (store (store (store (store .cse10 .cse6 .cse11) .cse12 v_subst_3) .cse13 (+ v_subst_1 1)) .cse1 (+ .cse4 1)))) (let ((.cse2 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base| .cse7) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse0 .cse1)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse3) 0)) (= .cse4 800) (= (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse7) |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base|))) (select .cse5 (+ (* (select .cse5 .cse6) 4) |c_~#queue~0.offset|))) 0)))))))))))) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_1904 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse27 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1904))) (let ((.cse21 (let ((.cse28 (select .cse27 |c_~#queue~0.base|))) (store .cse28 (+ (* (select .cse28 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse26 (store (store .cse21 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse22 (store (select (store .cse27 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse23 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base|))) (let ((.cse24 (+ (select .cse23 .cse6) 1)) (.cse25 (+ (* (select .cse23 .cse1) 4) |c_~#queue~0.offset|))) (let ((.cse17 (select (store (store (store .cse23 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse6 .cse24) .cse25 v_subst_4) .cse1))) (let ((.cse19 (store (store (store (store .cse23 .cse6 .cse24) .cse25 v_subst_4) .cse13 (+ v_subst_2 1)) .cse1 (+ .cse17 1)))) (let ((.cse20 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (= .cse17 800) (not (= (let ((.cse18 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base|))) (select .cse18 (+ (* (select .cse18 .cse6) 4) |c_~#queue~0.offset|))) 0)) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse21 .cse1)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse3) 1))))))))))))))) is different from false [2024-11-14 08:30:56,617 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_~#stored_elements~0.offset| 8)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#stored_elements~0.offset| 4)) (.cse14 (+ 3208 |c_~#queue~0.offset|)) (.cse8 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_1904 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse16 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1904))) (let ((.cse7 (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse15 (store (store .cse7 .cse14 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse9 (store (select (store .cse16 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse11 (select (store (store .cse2 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base|))) (let ((.cse12 (+ (select .cse11 .cse1) 1)) (.cse13 (+ (* (select .cse11 .cse8) 4) |c_~#queue~0.offset|))) (let ((.cse5 (select (store (store (store .cse11 .cse14 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse12) .cse13 v_subst_4) .cse8))) (let ((.cse3 (store (store (store (store .cse11 .cse1 .cse12) .cse13 v_subst_4) .cse14 (+ v_subst_2 1)) .cse8 (+ .cse5 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_1916))) (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 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)))) 0)) (= .cse5 800) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse6) 1)) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse7 .cse8))))))))))))) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_ArrVal_1904 (Array Int Int)) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse28 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1904))) (let ((.cse19 (let ((.cse29 (select .cse28 |c_~#queue~0.base|))) (store .cse29 (+ (* (select .cse29 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse27 (store (store .cse19 .cse14 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse23 (store (select (store .cse28 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse24 (select (store (store .cse2 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base|))) (let ((.cse25 (+ (select .cse24 .cse1) 1)) (.cse26 (+ (* (select .cse24 .cse8) 4) |c_~#queue~0.offset|))) (let ((.cse18 (select (store (store (store .cse24 .cse14 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse25) .cse26 v_subst_3) .cse8))) (let ((.cse22 (store (store (store (store .cse24 .cse1 .cse25) .cse26 v_subst_3) .cse14 (+ v_subst_1 1)) .cse8 (+ .cse18 1)))) (let ((.cse20 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_1916))) (or (= 800 .cse18) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse19 .cse8)) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse6) 0)) (= (let ((.cse21 (select (store (store .cse2 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base|))) (select .cse21 (+ (* (select .cse21 .cse1) 4) |c_~#queue~0.offset|))) 0)))))))))))))) is different from false [2024-11-14 08:30:56,938 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_~#stored_elements~0.offset| 8)) (.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse8 (+ |c_~#stored_elements~0.offset| 4)) (.cse14 (+ 3208 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#queue~0.offset| 3204)) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (and (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_1904 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse16 (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1904))) (let ((.cse6 (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store .cse17 (+ |c_~#queue~0.offset| (* (select .cse17 .cse7) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse15 (store (store .cse6 .cse14 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse9 (store (select (store .cse16 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base|) .cse8 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse11 (select (store (store .cse3 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base|))) (let ((.cse12 (+ (select .cse11 .cse2) 1)) (.cse13 (+ (* (select .cse11 .cse7) 4) |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store (store .cse11 .cse14 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse12) .cse13 v_subst_4) .cse7))) (let ((.cse4 (store (store (store (store .cse11 .cse2 .cse12) .cse13 v_subst_4) .cse14 (+ v_subst_2 1)) .cse7 (+ .cse0 1)))) (let ((.cse5 (store (select (store (store .cse3 |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_1916))) (or (= .cse0 800) (not (= (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)) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse6 .cse7)) (not (= (select (select (store (store .cse3 |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse8) 1))))))))))))) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_ArrVal_1904 (Array Int Int)) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse28 (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1904))) (let ((.cse18 (let ((.cse29 (select .cse28 |c_~#queue~0.base|))) (store .cse29 (+ |c_~#queue~0.offset| (* (select .cse29 .cse7) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse27 (store (store .cse18 .cse14 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse23 (store (select (store .cse28 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base|) .cse8 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse24 (select (store (store .cse3 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base|))) (let ((.cse25 (+ (select .cse24 .cse2) 1)) (.cse26 (+ (* (select .cse24 .cse7) 4) |c_~#queue~0.offset|))) (let ((.cse19 (select (store (store (store .cse24 .cse14 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse25) .cse26 v_subst_3) .cse7))) (let ((.cse21 (store (store (store (store .cse24 .cse2 .cse25) .cse26 v_subst_3) .cse14 (+ v_subst_1 1)) .cse7 (+ .cse19 1)))) (let ((.cse22 (store (select (store (store .cse3 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_1916))) (or (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse18 .cse7)) (= .cse19 800) (= (let ((.cse20 (select (store (store .cse3 |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base|))) (select .cse20 (+ (* 4 (select .cse20 .cse2)) |c_~#queue~0.offset|))) 0) (not (= (select (select (store (store .cse3 |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse8) 0))))))))))))))) is different from false [2024-11-14 08:30:57,268 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_~#stored_elements~0.offset| 8)) (.cse5 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#stored_elements~0.offset| 4)) (.cse14 (+ 3208 |c_~#queue~0.offset|)) (.cse8 (+ |c_~#queue~0.offset| 3204)) (.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse30 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse31 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse30 .cse31 (+ (select .cse30 .cse31) 1)))))) (and (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_ArrVal_1904 (Array Int Int)) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse16 (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_1904))) (let ((.cse7 (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse15 (store (store .cse7 .cse14 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse9 (store (select (store .cse16 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse11 (select (store (store .cse1 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base|))) (let ((.cse12 (+ (select .cse11 .cse5) 1)) (.cse13 (+ |c_~#queue~0.offset| (* 4 (select .cse11 .cse8))))) (let ((.cse0 (select (store (store (store .cse11 .cse14 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse5 .cse12) .cse13 v_subst_3) .cse8))) (let ((.cse6 (store (store (store (store .cse11 .cse5 .cse12) .cse13 v_subst_3) .cse14 (+ v_subst_1 1)) .cse8 (+ .cse0 1)))) (let ((.cse2 (store (select (store (store .cse1 |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_1916))) (or (= .cse0 800) (not (= (select (select (store (store .cse1 |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base| v_ArrVal_1918) |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 (+ (* (select .cse4 .cse5) 4) |c_~#queue~0.offset|))) 0) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse7 .cse8))))))))))))) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_1904 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse28 (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_1904))) (let ((.cse21 (let ((.cse29 (select .cse28 |c_~#queue~0.base|))) (store .cse29 (+ (* (select .cse29 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse27 (store (store .cse21 .cse14 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse23 (store (select (store .cse28 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse24 (select (store (store .cse1 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base|))) (let ((.cse25 (+ (select .cse24 .cse5) 1)) (.cse26 (+ |c_~#queue~0.offset| (* 4 (select .cse24 .cse8))))) (let ((.cse22 (select (store (store (store .cse24 .cse14 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse5 .cse25) .cse26 v_subst_4) .cse8))) (let ((.cse20 (store (store (store (store .cse24 .cse5 .cse25) .cse26 v_subst_4) .cse14 (+ v_subst_2 1)) .cse8 (+ .cse22 1)))) (let ((.cse18 (store (select (store (store .cse1 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_1916))) (or (not (= (select (select (store (store .cse1 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse3) 1)) (not (= (let ((.cse19 (select (store (store .cse1 |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base|))) (select .cse19 (+ (* (select .cse19 .cse5) 4) |c_~#queue~0.offset|))) 0)) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse21 .cse8)) (= .cse22 800)))))))))))))) is different from false [2024-11-14 08:30:59,952 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse20 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (+ |c_~#stored_elements~0.offset| 8)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#stored_elements~0.offset| 4)) (.cse14 (+ 3208 |c_~#queue~0.offset|)) (.cse8 (+ |c_~#queue~0.offset| 3204)) (.cse19 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse21 (+ (select .cse18 .cse20) 1))) (and (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_6 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_1904 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse18 .cse19 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse20 .cse21)))) (let ((.cse16 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1904))) (let ((.cse7 (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store .cse17 (+ |c_~#queue~0.offset| (* (select .cse17 .cse8) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse15 (store (store .cse7 .cse14 (+ v_subst_6 1)) .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse9 (store (select (store .cse16 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse11 (select (store (store .cse2 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base|))) (let ((.cse12 (+ (select .cse11 .cse1) 1)) (.cse13 (+ (* (select .cse11 .cse8) 4) |c_~#queue~0.offset|))) (let ((.cse6 (select (store (store (store .cse11 .cse14 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse12) .cse13 v_subst_4) .cse8))) (let ((.cse3 (store (store (store (store .cse11 .cse1 .cse12) .cse13 v_subst_4) .cse14 (+ v_subst_2 1)) .cse8 (+ .cse6 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_1916))) (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 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)))) 0)) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse5) 1)) (= 800 .cse6) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse7 .cse8)))))))))))))) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_5 Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_ArrVal_1904 (Array Int Int)) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse23 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse18 .cse19 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse20 .cse21)))) (let ((.cse33 (store .cse23 |c_~#stored_elements~0.base| v_ArrVal_1904))) (let ((.cse27 (let ((.cse34 (select .cse33 |c_~#queue~0.base|))) (store .cse34 (+ |c_~#queue~0.offset| (* (select .cse34 .cse8) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse32 (store (store .cse27 .cse14 (+ v_subst_5 1)) .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse28 (store (select (store .cse33 |c_~#queue~0.base| .cse32) |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse29 (select (store (store .cse23 |c_~#queue~0.base| .cse32) |c_~#stored_elements~0.base| .cse28) |c_~#queue~0.base|))) (let ((.cse30 (+ (select .cse29 .cse1) 1)) (.cse31 (+ (* (select .cse29 .cse8) 4) |c_~#queue~0.offset|))) (let ((.cse26 (select (store (store (store .cse29 .cse14 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse30) .cse31 v_subst_3) .cse8))) (let ((.cse24 (store (store (store (store .cse29 .cse1 .cse30) .cse31 v_subst_3) .cse14 (+ v_subst_1 1)) .cse8 (+ .cse26 1)))) (let ((.cse25 (store (select (store (store .cse23 |c_~#stored_elements~0.base| .cse28) |c_~#queue~0.base| .cse24) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_1916))) (or (= (let ((.cse22 (select (store (store .cse23 |c_~#queue~0.base| .cse24) |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base|))) (select .cse22 (+ |c_~#queue~0.offset| (* 4 (select .cse22 .cse1))))) 0) (= 800 .cse26) (not (= (select (select (store (store .cse23 |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse5) 0)) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse27 .cse8))))))))))))))))) is different from false [2024-11-14 08:31:02,310 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_~#stored_elements~0.offset| 8)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#stored_elements~0.offset| 4)) (.cse14 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 3204)) (.cse19 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse20 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse21 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse22 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_5 Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_ArrVal_1904 (Array Int Int)) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse18 (store .cse21 .cse22 |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse18 .cse19 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse20 (+ (select .cse18 .cse20) 1)))))) (let ((.cse16 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1904))) (let ((.cse5 (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse6) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse15 (store (store .cse5 .cse14 (+ v_subst_5 1)) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse9 (store (select (store .cse16 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base|) .cse7 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse11 (select (store (store .cse2 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base|))) (let ((.cse12 (+ (select .cse11 .cse1) 1)) (.cse13 (+ (* (select .cse11 .cse6) 4) |c_~#queue~0.offset|))) (let ((.cse8 (select (store (store (store .cse11 .cse14 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse12) .cse13 v_subst_3) .cse6))) (let ((.cse3 (store (store (store (store .cse11 .cse1 .cse12) .cse13 v_subst_3) .cse14 (+ v_subst_1 1)) .cse6 (+ .cse8 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_1916))) (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| (* 4 (select .cse0 .cse1))))) 0) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse5 .cse6)) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse7) 0)) (= .cse8 800))))))))))))) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_6 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_1904 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse24 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse36 (store .cse21 .cse22 |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse36 .cse19 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse20 (+ (select .cse36 .cse20) 1)))))) (let ((.cse34 (store .cse24 |c_~#stored_elements~0.base| v_ArrVal_1904))) (let ((.cse28 (let ((.cse35 (select .cse34 |c_~#queue~0.base|))) (store .cse35 (+ (* (select .cse35 .cse6) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse33 (store (store .cse28 .cse14 (+ v_subst_6 1)) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse29 (store (select (store .cse34 |c_~#queue~0.base| .cse33) |c_~#stored_elements~0.base|) .cse7 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse30 (select (store (store .cse24 |c_~#queue~0.base| .cse33) |c_~#stored_elements~0.base| .cse29) |c_~#queue~0.base|))) (let ((.cse31 (+ (select .cse30 .cse1) 1)) (.cse32 (+ (* (select .cse30 .cse6) 4) |c_~#queue~0.offset|))) (let ((.cse27 (select (store (store (store .cse30 .cse14 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse31) .cse32 v_subst_4) .cse6))) (let ((.cse25 (store (store (store (store .cse30 .cse1 .cse31) .cse32 v_subst_4) .cse14 (+ v_subst_2 1)) .cse6 (+ .cse27 1)))) (let ((.cse26 (store (select (store (store .cse24 |c_~#stored_elements~0.base| .cse29) |c_~#queue~0.base| .cse25) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_1916))) (or (not (= (let ((.cse23 (select (store (store .cse24 |c_~#queue~0.base| .cse25) |c_~#stored_elements~0.base| .cse26) |c_~#queue~0.base|))) (select .cse23 (+ (* 4 (select .cse23 .cse1)) |c_~#queue~0.offset|))) 0)) (= 800 .cse27) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse28 .cse6)) (not (= (select (select (store (store .cse24 |c_~#stored_elements~0.base| .cse26) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse7) 1)))))))))))))))) is different from false [2024-11-14 08:31:02,981 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse21 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse20 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse22 (select .cse21 .cse20)) (.cse10 (+ |c_~#stored_elements~0.offset| 8)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse8 (+ |c_~#stored_elements~0.offset| 4)) (.cse14 (+ 3208 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#queue~0.offset| 3204)) (.cse19 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_6 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_1904 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse18 (store .cse21 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse18 .cse19 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse20 (+ (select .cse18 .cse20) 1)))))) (let ((.cse16 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1904))) (let ((.cse6 (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store .cse17 (+ |c_~#queue~0.offset| (* (select .cse17 .cse7) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse15 (store (store .cse6 .cse14 (+ v_subst_6 1)) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse9 (store (select (store .cse16 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base|) .cse8 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse11 (select (store (store .cse2 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base|))) (let ((.cse12 (+ (select .cse11 .cse1) 1)) (.cse13 (+ |c_~#queue~0.offset| (* (select .cse11 .cse7) 4)))) (let ((.cse5 (select (store (store (store .cse11 .cse14 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse12) .cse13 v_subst_4) .cse7))) (let ((.cse3 (store (store (store (store .cse11 .cse1 .cse12) .cse13 v_subst_4) .cse14 (+ v_subst_2 1)) .cse7 (+ .cse5 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_1916))) (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)) (= .cse5 800) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse6 .cse7)) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse8) 1)))))))))))))) (< .cse22 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (< .cse22 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_5 Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_ArrVal_1904 (Array Int Int)) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse24 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse36 (store .cse21 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse36 .cse19 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse20 (+ (select .cse36 .cse20) 1)))))) (let ((.cse34 (store .cse24 |c_~#stored_elements~0.base| v_ArrVal_1904))) (let ((.cse23 (let ((.cse35 (select .cse34 |c_~#queue~0.base|))) (store .cse35 (+ |c_~#queue~0.offset| (* (select .cse35 .cse7) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse33 (store (store .cse23 .cse14 (+ v_subst_5 1)) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse29 (store (select (store .cse34 |c_~#queue~0.base| .cse33) |c_~#stored_elements~0.base|) .cse8 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse30 (select (store (store .cse24 |c_~#queue~0.base| .cse33) |c_~#stored_elements~0.base| .cse29) |c_~#queue~0.base|))) (let ((.cse31 (+ (select .cse30 .cse1) 1)) (.cse32 (+ (* (select .cse30 .cse7) 4) |c_~#queue~0.offset|))) (let ((.cse28 (select (store (store (store .cse30 .cse14 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse31) .cse32 v_subst_3) .cse7))) (let ((.cse27 (store (store (store (store .cse30 .cse1 .cse31) .cse32 v_subst_3) .cse14 (+ v_subst_1 1)) .cse7 (+ 1 .cse28)))) (let ((.cse25 (store (select (store (store .cse24 |c_~#stored_elements~0.base| .cse29) |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_1916))) (or (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse23 .cse7)) (not (= (select (select (store (store .cse24 |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse8) 0)) (= (let ((.cse26 (select (store (store .cse24 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base|))) (select .cse26 (+ |c_~#queue~0.offset| (* (select .cse26 .cse1) 4)))) 0) (= 800 .cse28)))))))))))))))))) is different from false [2024-11-14 08:31:04,565 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse22 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse21 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse0 (select .cse22 .cse21)) (.cse11 (+ |c_~#stored_elements~0.offset| 8)) (.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse8 (+ |c_~#stored_elements~0.offset| 4)) (.cse15 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse20 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_5 Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_ArrVal_1904 (Array Int Int)) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse19 (store .cse22 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse19 .cse20 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse21 (+ (select .cse19 .cse21) 1)))))) (let ((.cse17 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1904))) (let ((.cse1 (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse2) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse16 (store (store .cse1 .cse15 (+ v_subst_5 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse10 (store (select (store .cse17 |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base|) .cse8 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse12 (select (store (store .cse5 |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base| .cse10) |c_~#queue~0.base|))) (let ((.cse13 (+ (select .cse12 .cse4) 1)) (.cse14 (+ |c_~#queue~0.offset| (* (select .cse12 .cse2) 4)))) (let ((.cse9 (select (store (store (store .cse12 .cse15 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 .cse13) .cse14 v_subst_3) .cse2))) (let ((.cse6 (store (store (store (store .cse12 .cse4 .cse13) .cse14 v_subst_3) .cse15 (+ v_subst_1 1)) .cse2 (+ .cse9 1)))) (let ((.cse7 (store (select (store (store .cse5 |c_~#stored_elements~0.base| .cse10) |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) .cse11 v_ArrVal_1916))) (or (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse1 .cse2)) (= (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base|))) (select .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|))) 0) (not (= (select (select (store (store .cse5 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse8) 0)) (= 800 .cse9))))))))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_6 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_1904 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse26 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse36 (store .cse22 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse36 .cse20 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse21 (+ (select .cse36 .cse21) 1)))))) (let ((.cse34 (store .cse26 |c_~#stored_elements~0.base| v_ArrVal_1904))) (let ((.cse23 (let ((.cse35 (select .cse34 |c_~#queue~0.base|))) (store .cse35 (+ (* (select .cse35 .cse2) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse33 (store (store .cse23 .cse15 (+ v_subst_6 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse29 (store (select (store .cse34 |c_~#queue~0.base| .cse33) |c_~#stored_elements~0.base|) .cse8 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse30 (select (store (store .cse26 |c_~#queue~0.base| .cse33) |c_~#stored_elements~0.base| .cse29) |c_~#queue~0.base|))) (let ((.cse31 (+ (select .cse30 .cse4) 1)) (.cse32 (+ (* (select .cse30 .cse2) 4) |c_~#queue~0.offset|))) (let ((.cse24 (select (store (store (store .cse30 .cse15 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 .cse31) .cse32 v_subst_4) .cse2))) (let ((.cse27 (store (store (store (store .cse30 .cse4 .cse31) .cse32 v_subst_4) .cse15 (+ v_subst_2 1)) .cse2 (+ .cse24 1)))) (let ((.cse28 (store (select (store (store .cse26 |c_~#stored_elements~0.base| .cse29) |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base|) .cse11 v_ArrVal_1916))) (or (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse23 .cse2)) (= .cse24 800) (not (= (let ((.cse25 (select (store (store .cse26 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base| .cse28) |c_~#queue~0.base|))) (select .cse25 (+ (* (select .cse25 .cse4) 4) |c_~#queue~0.offset|))) 0)) (not (= (select (select (store (store .cse26 |c_~#stored_elements~0.base| .cse28) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse8) 1))))))))))))))))))) is different from false [2024-11-14 08:31:07,655 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse9 (+ |c_~#stored_elements~0.offset| 8)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#stored_elements~0.offset| 4)) (.cse13 (+ 3208 |c_~#queue~0.offset|)) (.cse18 (select .cse17 .cse6))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_5 Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_ArrVal_1904 (Array Int Int)) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse5 (let ((.cse15 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse16 (store .cse17 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse16 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse6 (+ (select .cse16 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse6) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse14 (store (store .cse5 .cse13 (+ v_subst_5 1)) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse8 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base| .cse14) |c_~#stored_elements~0.base|) .cse7 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse10 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse14) |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base|))) (let ((.cse11 (+ (select .cse10 .cse1) 1)) (.cse12 (+ (* 4 (select .cse10 .cse6)) |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store (store .cse10 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse11) .cse12 v_subst_3) .cse6))) (let ((.cse2 (store (store (store (store .cse10 .cse1 .cse11) .cse12 v_subst_3) .cse13 (+ v_subst_1 1)) .cse6 (+ .cse4 1)))) (let ((.cse3 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base| .cse2) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (= (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 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|))) 0) (= 800 .cse4) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse5 .cse6)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse7) 0)))))))))))) (< .cse18 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_6 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_1904 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse23 (let ((.cse29 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse30 (store .cse17 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse30 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse6 (+ (select .cse30 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base|))) (store .cse29 (+ (* (select .cse29 .cse6) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse28 (store (store .cse23 .cse13 (+ v_subst_6 1)) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse24 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base| .cse28) |c_~#stored_elements~0.base|) .cse7 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse25 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse28) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (let ((.cse26 (+ (select .cse25 .cse1) 1)) (.cse27 (+ (* 4 (select .cse25 .cse6)) |c_~#queue~0.offset|))) (let ((.cse22 (select (store (store (store .cse25 .cse13 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse26) .cse27 v_subst_4) .cse6))) (let ((.cse20 (store (store (store (store .cse25 .cse1 .cse26) .cse27 v_subst_4) .cse13 (+ v_subst_2 1)) .cse6 (+ .cse22 1)))) (let ((.cse21 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1916))) (or (not (= (let ((.cse19 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base|))) (select .cse19 (+ |c_~#queue~0.offset| (* (select .cse19 .cse1) 4)))) 0)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse7) 1)) (= 800 .cse22) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse23 .cse6)))))))))))) (< .cse18 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|)))))) is different from false [2024-11-14 08:31:23,458 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) 0)))) (let ((.cse19 (select .cse4 |c_~#queue~0.base|)) (.cse9 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse19 .cse9)) (.cse11 (+ |c_~#stored_elements~0.offset| 8)) (.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#stored_elements~0.offset| 4)) (.cse15 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_5 Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_ArrVal_1904 (Array Int Int)) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse8 (let ((.cse17 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse18 (store .cse19 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse18 .cse15 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ (select .cse18 .cse9) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse16 (store (store .cse8 .cse15 (+ v_subst_5 1)) .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse10 (store (select (store (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base|) .cse7 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse12 (select (store (store .cse4 |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base| .cse10) |c_~#queue~0.base|))) (let ((.cse13 (+ (select .cse12 .cse3) 1)) (.cse14 (+ (* (select .cse12 .cse9) 4) |c_~#queue~0.offset|))) (let ((.cse1 (select (store (store (store .cse12 .cse15 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse13) .cse14 v_subst_3) .cse9))) (let ((.cse5 (store (store (store (store .cse12 .cse3 .cse13) .cse14 v_subst_3) .cse15 (+ v_subst_1 1)) .cse9 (+ .cse1 1)))) (let ((.cse6 (store (select (store (store .cse4 |c_~#stored_elements~0.base| .cse10) |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) .cse11 v_ArrVal_1916))) (or (= 800 .cse1) (= (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (select .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)))) 0) (not (= (select (select (store (store .cse4 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse7) 0)) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse8 .cse9)))))))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_6 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_1904 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse24 (let ((.cse30 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse31 (store .cse19 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse31 .cse15 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ (select .cse31 .cse9) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base|))) (store .cse30 (+ (* (select .cse30 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse29 (store (store .cse24 .cse15 (+ v_subst_6 1)) .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse25 (store (select (store (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base| .cse29) |c_~#stored_elements~0.base|) .cse7 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse26 (select (store (store .cse4 |c_~#queue~0.base| .cse29) |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base|))) (let ((.cse27 (+ (select .cse26 .cse3) 1)) (.cse28 (+ (* (select .cse26 .cse9) 4) |c_~#queue~0.offset|))) (let ((.cse20 (select (store (store (store .cse26 .cse15 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse27) .cse28 v_subst_4) .cse9))) (let ((.cse22 (store (store (store (store .cse26 .cse3 .cse27) .cse28 v_subst_4) .cse15 (+ v_subst_2 1)) .cse9 (+ .cse20 1)))) (let ((.cse23 (store (select (store (store .cse4 |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base|) .cse11 v_ArrVal_1916))) (or (= .cse20 800) (not (= (let ((.cse21 (select (store (store .cse4 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base|))) (select .cse21 (+ |c_~#queue~0.offset| (* (select .cse21 .cse3) 4)))) 0)) (not (= (select (select (store (store .cse4 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse7) 1)) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse24 .cse9)))))))))))))))))) is different from false [2024-11-14 08:31:23,900 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (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| 3204) 0) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) 0)))) (let ((.cse19 (select .cse3 |c_~#queue~0.base|)) (.cse7 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse19 .cse7)) (.cse11 (+ |c_~#stored_elements~0.offset| 8)) (.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#stored_elements~0.offset| 4)) (.cse15 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_subst_5 Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_3 Int) (v_ArrVal_1904 (Array Int Int)) (v_subst_1 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse6 (let ((.cse17 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse18 (store .cse19 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse18 .cse15 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse18 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base|))) (store .cse17 (+ |c_~#queue~0.offset| (* (select .cse17 .cse7) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse16 (store (store .cse6 .cse15 (+ v_subst_5 1)) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse10 (store (select (store (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base|) .cse9 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse12 (select (store (store .cse3 |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base| .cse10) |c_~#queue~0.base|))) (let ((.cse13 (+ (select .cse12 .cse2) 1)) (.cse14 (+ |c_~#queue~0.offset| (* (select .cse12 .cse7) 4)))) (let ((.cse8 (select (store (store (store .cse12 .cse15 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse13) .cse14 v_subst_3) .cse7))) (let ((.cse4 (store (store (store (store .cse12 .cse2 .cse13) .cse14 v_subst_3) .cse15 (+ v_subst_1 1)) .cse7 (+ .cse8 1)))) (let ((.cse5 (store (select (store (store .cse3 |c_~#stored_elements~0.base| .cse10) |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base|) .cse11 v_ArrVal_1916))) (or (= (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base|))) (select .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|))) 0) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse6 .cse7)) (= 800 .cse8) (not (= (select (select (store (store .cse3 |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse9) 0)))))))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_1916 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_6 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1918 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_1904 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse23 (let ((.cse30 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse31 (store .cse19 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse31 .cse15 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse31 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base|))) (store .cse30 (+ |c_~#queue~0.offset| (* (select .cse30 .cse7) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse29 (store (store .cse23 .cse15 (+ v_subst_6 1)) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| 1)))) (let ((.cse25 (store (select (store (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base| .cse29) |c_~#stored_elements~0.base|) .cse9 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse26 (select (store (store .cse3 |c_~#queue~0.base| .cse29) |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base|))) (let ((.cse27 (+ 1 (select .cse26 .cse2))) (.cse28 (+ |c_~#queue~0.offset| (* (select .cse26 .cse7) 4)))) (let ((.cse24 (select (store (store (store .cse26 .cse15 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse27) .cse28 v_subst_4) .cse7))) (let ((.cse21 (store (store (store (store .cse26 .cse2 .cse27) .cse28 v_subst_4) .cse15 (+ v_subst_2 1)) .cse7 (+ .cse24 1)))) (let ((.cse22 (store (select (store (store .cse3 |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base|) .cse11 v_ArrVal_1916))) (or (not (= (let ((.cse20 (select (store (store .cse3 |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base|))) (select .cse20 (+ (* (select .cse20 .cse2) 4) |c_~#queue~0.offset|))) 0)) (< |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_54| (select .cse23 .cse7)) (not (= (select (select (store (store .cse3 |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base| v_ArrVal_1918) |c_~#stored_elements~0.base|) .cse9) 1)) (= 800 .cse24))))))))))))))))) is different from false [2024-11-14 08:31:26,945 INFO L349 Elim1Store]: treesize reduction 462, result has 37.0 percent of original size [2024-11-14 08:31:26,946 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 19177 treesize of output 4095 [2024-11-14 08:31:27,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 08:31:27,035 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 8062 treesize of output 8060 [2024-11-14 08:31:27,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 08:31:27,468 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 9376639 treesize of output 8584097 Received shutdown request... [2024-11-14 08:33:06,930 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 08:33:06,955 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-11-14 08:33:06,955 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-11-14 08:33:06,955 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-11-14 08:33:06,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-14 08:33:07,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 08:33:07,135 WARN L596 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 1893 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-34-5-2-3-3-3-3-2-3-2-3-2-3-2-3-3-3-2-3-3-3-2-3-2-3-2-2-3-3-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-66-5-3-5-4-3-4-5-4-5-4-5-4-5-3-5-4-3-4-3-4-3-3-3-3-3-3-3-2-2-2-3-1 context. [2024-11-14 08:33:07,136 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 08:33:07,136 INFO L320 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork1 was TIMEOUT (3/3) [2024-11-14 08:33:07,138 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-14 08:33:07,138 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 08:33:07,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-11-14 08:33:07,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 08:33:07 BasicIcfg [2024-11-14 08:33:07,157 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 08:33:07,158 INFO L158 Benchmark]: Toolchain (without parser) took 805413.05ms. Allocated memory was 100.7MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 70.6MB in the beginning and 997.4MB in the end (delta: -926.8MB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2024-11-14 08:33:07,158 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 100.7MB. Free memory is still 51.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-14 08:33:07,158 INFO L158 Benchmark]: CACSL2BoogieTranslator took 648.63ms. Allocated memory is still 100.7MB. Free memory was 70.6MB in the beginning and 23.8MB in the end (delta: 46.8MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2024-11-14 08:33:07,158 INFO L158 Benchmark]: Boogie Procedure Inliner took 164.28ms. Allocated memory is still 100.7MB. Free memory was 23.8MB in the beginning and 55.5MB in the end (delta: -31.7MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. [2024-11-14 08:33:07,159 INFO L158 Benchmark]: Boogie Preprocessor took 118.99ms. Allocated memory is still 100.7MB. Free memory was 55.5MB in the beginning and 44.9MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2024-11-14 08:33:07,159 INFO L158 Benchmark]: RCFGBuilder took 2232.18ms. Allocated memory was 100.7MB in the beginning and 146.8MB in the end (delta: 46.1MB). Free memory was 44.9MB in the beginning and 67.2MB in the end (delta: -22.4MB). Peak memory consumption was 69.5MB. Max. memory is 8.0GB. [2024-11-14 08:33:07,159 INFO L158 Benchmark]: TraceAbstraction took 802241.22ms. Allocated memory was 146.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 66.6MB in the beginning and 997.4MB in the end (delta: -930.8MB). Peak memory consumption was 994.4MB. Max. memory is 8.0GB. [2024-11-14 08:33:07,161 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.20ms. Allocated memory is still 100.7MB. Free memory is still 51.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 648.63ms. Allocated memory is still 100.7MB. Free memory was 70.6MB in the beginning and 23.8MB in the end (delta: 46.8MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 164.28ms. Allocated memory is still 100.7MB. Free memory was 23.8MB in the beginning and 55.5MB in the end (delta: -31.7MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 118.99ms. Allocated memory is still 100.7MB. Free memory was 55.5MB in the beginning and 44.9MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 2232.18ms. Allocated memory was 100.7MB in the beginning and 146.8MB in the end (delta: 46.1MB). Free memory was 44.9MB in the beginning and 67.2MB in the end (delta: -22.4MB). Peak memory consumption was 69.5MB. Max. memory is 8.0GB. * TraceAbstraction took 802241.22ms. Allocated memory was 146.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 66.6MB in the beginning and 997.4MB in the end (delta: -930.8MB). Peak memory consumption was 994.4MB. 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: 14648, independent: 14467, independent conditional: 1873, independent unconditional: 12594, dependent: 181, dependent conditional: 150, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14503, independent: 14467, independent conditional: 1873, 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: 14503, independent: 14467, independent conditional: 1873, 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: 14521, independent: 14467, independent conditional: 1873, 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: 14521, independent: 14467, independent conditional: 0, independent unconditional: 14467, 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: 14521, independent: 14467, independent conditional: 0, independent unconditional: 14467, 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: 500, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 443, dependent conditional: 24, dependent unconditional: 418, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 14521, independent: 2739, independent conditional: 0, independent unconditional: 2739, 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: 1891, Maximal queried relation: 4, Independence queries for same thread: 145, Persistent sets #1 benchmarks: Persistent set computation time: 0.7s, Number of persistent set computation: 2245, Number of trivial persistent sets: 1990, 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: 14648, independent: 14467, independent conditional: 1873, independent unconditional: 12594, dependent: 181, dependent conditional: 150, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14503, independent: 14467, independent conditional: 1873, 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: 14503, independent: 14467, independent conditional: 1873, 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: 14521, independent: 14467, independent conditional: 1873, 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: 14521, independent: 14467, independent conditional: 0, independent unconditional: 14467, 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: 14521, independent: 14467, independent conditional: 0, independent unconditional: 14467, 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: 500, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 443, dependent conditional: 24, dependent unconditional: 418, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 14521, independent: 2739, independent conditional: 0, independent unconditional: 2739, 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: 1891, Maximal queried relation: 4, Independence queries for same thread: 145 - 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: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, 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: 2081, Number of trivial persistent sets: 2075, 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: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, 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 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 18363, independent: 17684, independent conditional: 5499, independent unconditional: 12185, dependent: 679, dependent conditional: 635, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17728, independent: 17684, independent conditional: 5499, independent unconditional: 12185, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17728, independent: 17684, independent conditional: 5499, independent unconditional: 12185, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17728, independent: 17684, independent conditional: 5499, independent unconditional: 12185, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17728, independent: 17684, independent conditional: 0, independent unconditional: 17684, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17728, independent: 17684, independent conditional: 0, independent unconditional: 17684, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2465, independent: 2443, independent conditional: 0, independent unconditional: 2443, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2465, independent: 2440, independent conditional: 0, independent unconditional: 2440, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 25, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 25, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 243, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 235, dependent conditional: 0, dependent unconditional: 235, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 17728, independent: 15241, independent conditional: 0, independent unconditional: 15241, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 2465, unknown conditional: 0, unknown unconditional: 2465] , Statistics on independence cache: Total cache size (in pairs): 14686, Positive cache size: 14632, Positive conditional cache size: 0, Positive unconditional cache size: 14632, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5499, Maximal queried relation: 0, Independence queries for same thread: 635, Persistent sets #1 benchmarks: Persistent set computation time: 0.3s, Number of persistent set computation: 2048, Number of trivial persistent sets: 1968, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12229, independent: 12185, independent conditional: 0, independent unconditional: 12185, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 18363, independent: 17684, independent conditional: 5499, independent unconditional: 12185, dependent: 679, dependent conditional: 635, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17728, independent: 17684, independent conditional: 5499, independent unconditional: 12185, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17728, independent: 17684, independent conditional: 5499, independent unconditional: 12185, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17728, independent: 17684, independent conditional: 5499, independent unconditional: 12185, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17728, independent: 17684, independent conditional: 0, independent unconditional: 17684, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17728, independent: 17684, independent conditional: 0, independent unconditional: 17684, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2465, independent: 2443, independent conditional: 0, independent unconditional: 2443, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2465, independent: 2440, independent conditional: 0, independent unconditional: 2440, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 25, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 25, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 243, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 235, dependent conditional: 0, dependent unconditional: 235, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 17728, independent: 15241, independent conditional: 0, independent unconditional: 15241, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 2465, unknown conditional: 0, unknown unconditional: 2465] , Statistics on independence cache: Total cache size (in pairs): 14686, Positive cache size: 14632, Positive conditional cache size: 0, Positive unconditional cache size: 14632, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5499, Maximal queried relation: 0, Independence queries for same thread: 635 - PositiveResult [Line: 1032]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1059]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 1893 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-34-5-2-3-3-3-3-2-3-2-3-2-3-2-3-3-3-2-3-3-3-2-3-2-3-2-2-3-3-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-66-5-3-5-4-3-4-5-4-5-4-5-4-5-3-5-4-3-4-3-4-3-3-3-3-3-3-3-2-2-2-3-1 context. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 2028 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 44.6s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 14.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 28.5s InterpolantComputationTime, 12053 NumberOfCodeBlocks, 12053 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 12046 ConstructedInterpolants, 0 QuantifiedInterpolants, 23474 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: CheckTime: 0.0s, ConditionCalculationTime: 0.0s, CommutingCounterexamples: 0, ConditionCalculations: 0, TraceChecks: 0, UnknownTraceChecks: 0, ImperfectProofs: 0, QuantifiedConditions: 0, FalseConditions: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 2028 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 1658 NumberOfCodeBlocks, 1658 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 1657 ConstructedInterpolants, 0 QuantifiedInterpolants, 1657 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: CheckTime: 0.0s, ConditionCalculationTime: 0.0s, CommutingCounterexamples: 0, ConditionCalculations: 0, TraceChecks: 0, UnknownTraceChecks: 0, ImperfectProofs: 0, QuantifiedConditions: 0, FalseConditions: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t2Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 2028 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 756.8s, OverallIterations: 12, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 171.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 258, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 211.8s InterpolantComputationTime, 23609 NumberOfCodeBlocks, 23609 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 27370 ConstructedInterpolants, 366 QuantifiedInterpolants, 227150 SizeOfPredicates, 111 NumberOfNonLiveVariables, 7939 ConjunctsInSsa, 212 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 136/408 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: CheckTime: 0.0s, ConditionCalculationTime: 0.0s, CommutingCounterexamples: 0, ConditionCalculations: 0, TraceChecks: 0, UnknownTraceChecks: 0, ImperfectProofs: 0, QuantifiedConditions: 0, FalseConditions: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown