/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 546 --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_longer.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-06 00:36:06,413 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-06 00:36:06,469 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-06 00:36:06,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-06 00:36:06,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-06 00:36:06,497 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-06 00:36:06,498 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-06 00:36:06,498 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-06 00:36:06,499 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-06 00:36:06,501 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-06 00:36:06,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-06 00:36:06,502 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-06 00:36:06,502 INFO L153 SettingsManager]: * Use SBE=true [2024-04-06 00:36:06,503 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-06 00:36:06,504 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-06 00:36:06,504 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-06 00:36:06,504 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-06 00:36:06,504 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-06 00:36:06,504 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-06 00:36:06,505 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-06 00:36:06,505 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-06 00:36:06,505 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-06 00:36:06,505 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-06 00:36:06,505 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-06 00:36:06,506 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-06 00:36:06,506 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-06 00:36:06,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-06 00:36:06,506 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-06 00:36:06,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-06 00:36:06,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-06 00:36:06,507 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-06 00:36:06,507 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-06 00:36:06,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-06 00:36:06,508 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-06 00:36:06,508 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-06 00:36:06,508 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-06 00:36:06,508 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-06 00:36:06,508 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-06 00:36:06,508 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-06 00:36:06,509 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 20 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 546 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-04-06 00:36:06,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-06 00:36:06,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-06 00:36:06,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-06 00:36:06,767 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-06 00:36:06,767 INFO L274 PluginConnector]: CDTParser initialized [2024-04-06 00:36:06,768 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/queue_longer.i [2024-04-06 00:36:07,941 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-06 00:36:08,116 INFO L384 CDTParser]: Found 1 translation units. [2024-04-06 00:36:08,116 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i [2024-04-06 00:36:08,129 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/00a1419fc/8f910eb60db94a7ea2df69b67a924877/FLAG74ee8e827 [2024-04-06 00:36:08,140 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/00a1419fc/8f910eb60db94a7ea2df69b67a924877 [2024-04-06 00:36:08,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-06 00:36:08,143 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-06 00:36:08,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-06 00:36:08,146 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-06 00:36:08,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-06 00:36:08,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 12:36:08" (1/1) ... [2024-04-06 00:36:08,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1031603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:36:08, skipping insertion in model container [2024-04-06 00:36:08,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 12:36:08" (1/1) ... [2024-04-06 00:36:08,185 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-06 00:36:08,566 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43296,43309] [2024-04-06 00:36:08,573 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43503,43516] [2024-04-06 00:36:08,578 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43783,43796] [2024-04-06 00:36:08,583 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-06 00:36:08,594 INFO L202 MainTranslator]: Completed pre-run [2024-04-06 00:36:08,629 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43296,43309] [2024-04-06 00:36:08,630 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43503,43516] [2024-04-06 00:36:08,632 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43783,43796] [2024-04-06 00:36:08,634 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-06 00:36:08,681 INFO L206 MainTranslator]: Completed translation [2024-04-06 00:36:08,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:36:08 WrapperNode [2024-04-06 00:36:08,681 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-06 00:36:08,683 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-06 00:36:08,683 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-06 00:36:08,683 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-06 00:36:08,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:36:08" (1/1) ... [2024-04-06 00:36:08,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:36:08" (1/1) ... [2024-04-06 00:36:08,753 INFO L138 Inliner]: procedures = 275, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 251 [2024-04-06 00:36:08,754 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-06 00:36:08,754 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-06 00:36:08,754 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-06 00:36:08,754 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-06 00:36:08,762 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:36:08" (1/1) ... [2024-04-06 00:36:08,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:36:08" (1/1) ... [2024-04-06 00:36:08,776 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:36:08" (1/1) ... [2024-04-06 00:36:08,776 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:36:08" (1/1) ... [2024-04-06 00:36:08,782 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:36:08" (1/1) ... [2024-04-06 00:36:08,785 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:36:08" (1/1) ... [2024-04-06 00:36:08,786 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:36:08" (1/1) ... [2024-04-06 00:36:08,788 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:36:08" (1/1) ... [2024-04-06 00:36:08,804 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-06 00:36:08,804 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-06 00:36:08,804 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-06 00:36:08,805 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-06 00:36:08,805 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:36:08" (1/1) ... [2024-04-06 00:36:08,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-06 00:36:08,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 00:36:08,837 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-04-06 00:36:08,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-04-06 00:36:08,878 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-04-06 00:36:08,879 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-04-06 00:36:08,879 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-04-06 00:36:08,879 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-04-06 00:36:08,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-06 00:36:08,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-06 00:36:08,880 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-04-06 00:36:08,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-06 00:36:08,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-06 00:36:08,880 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-04-06 00:36:08,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-06 00:36:08,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-06 00:36:08,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-06 00:36:08,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-06 00:36:08,882 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-06 00:36:09,018 INFO L241 CfgBuilder]: Building ICFG [2024-04-06 00:36:09,020 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-06 00:36:09,254 INFO L282 CfgBuilder]: Performing block encoding [2024-04-06 00:36:09,293 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-06 00:36:09,294 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2024-04-06 00:36:09,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 12:36:09 BoogieIcfgContainer [2024-04-06 00:36:09,295 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-06 00:36:09,297 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-06 00:36:09,297 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-06 00:36:09,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-06 00:36:09,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 12:36:08" (1/3) ... [2024-04-06 00:36:09,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7791ac9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 12:36:09, skipping insertion in model container [2024-04-06 00:36:09,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:36:08" (2/3) ... [2024-04-06 00:36:09,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7791ac9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 12:36:09, skipping insertion in model container [2024-04-06 00:36:09,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 12:36:09" (3/3) ... [2024-04-06 00:36:09,304 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2024-04-06 00:36:09,310 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-06 00:36:09,317 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-06 00:36:09,318 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-04-06 00:36:09,318 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-06 00:36:09,390 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-04-06 00:36:09,424 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-06 00:36:09,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-06 00:36:09,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 00:36:09,427 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-06 00:36:09,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-04-06 00:36:09,462 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-06 00:36:09,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 00:36:09,473 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-06 00:36:09,484 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6f945c87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546 [2024-04-06 00:36:09,484 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-04-06 00:36:09,509 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-06 00:36:09,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 00:36:09,511 INFO L85 PathProgramCache]: Analyzing trace with hash 354382951, now seen corresponding path program 1 times [2024-04-06 00:36:09,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 00:36:09,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302793805] [2024-04-06 00:36:09,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:36:09,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:36:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:36:09,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 00:36:09,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 00:36:09,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302793805] [2024-04-06 00:36:09,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302793805] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 00:36:09,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 00:36:09,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-06 00:36:09,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044114636] [2024-04-06 00:36:09,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 00:36:09,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-06 00:36:09,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 00:36:09,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-06 00:36:09,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-06 00:36:09,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:09,799 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 00:36:09,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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-04-06 00:36:09,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:09,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:09,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-06 00:36:09,839 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-06 00:36:09,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 00:36:09,840 INFO L85 PathProgramCache]: Analyzing trace with hash 988144468, now seen corresponding path program 1 times [2024-04-06 00:36:09,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 00:36:09,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076990759] [2024-04-06 00:36:09,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:36:09,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:36:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:36:10,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 00:36:10,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 00:36:10,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076990759] [2024-04-06 00:36:10,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076990759] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 00:36:10,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 00:36:10,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-04-06 00:36:10,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501478028] [2024-04-06 00:36:10,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 00:36:10,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-06 00:36:10,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 00:36:10,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-06 00:36:10,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-06 00:36:10,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:10,036 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 00:36:10,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-04-06 00:36:10,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:10,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:10,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:10,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-06 00:36:10,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-04-06 00:36:10,109 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-06 00:36:10,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 00:36:10,110 INFO L85 PathProgramCache]: Analyzing trace with hash 2145678791, now seen corresponding path program 1 times [2024-04-06 00:36:10,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 00:36:10,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758146078] [2024-04-06 00:36:10,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:36:10,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:36:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:36:11,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 00:36:11,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 00:36:11,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758146078] [2024-04-06 00:36:11,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758146078] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 00:36:11,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 00:36:11,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-04-06 00:36:11,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797086957] [2024-04-06 00:36:11,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 00:36:11,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-04-06 00:36:11,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 00:36:11,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-04-06 00:36:11,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-04-06 00:36:11,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:11,465 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 00:36:11,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-06 00:36:11,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:11,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-06 00:36:11,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:11,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:11,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-06 00:36:11,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-06 00:36:11,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-04-06 00:36:11,866 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-06 00:36:11,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 00:36:11,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1468984428, now seen corresponding path program 1 times [2024-04-06 00:36:11,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 00:36:11,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273728432] [2024-04-06 00:36:11,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:36:11,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:36:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:36:13,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 00:36:13,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 00:36:13,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273728432] [2024-04-06 00:36:13,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273728432] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 00:36:13,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 00:36:13,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2024-04-06 00:36:13,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86104558] [2024-04-06 00:36:13,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 00:36:13,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-04-06 00:36:13,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 00:36:13,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-04-06 00:36:13,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2024-04-06 00:36:13,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:13,635 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 00:36:13,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.185185185185185) internal successors, (113), 27 states have internal predecessors, (113), 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-04-06 00:36:13,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:13,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-06 00:36:13,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-06 00:36:13,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:14,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:14,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-06 00:36:14,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-06 00:36:14,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-04-06 00:36:14,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-04-06 00:36:14,524 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-06 00:36:14,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 00:36:14,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1786371939, now seen corresponding path program 1 times [2024-04-06 00:36:14,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 00:36:14,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166994024] [2024-04-06 00:36:14,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:36:14,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:36:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:36:14,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 00:36:14,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 00:36:14,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166994024] [2024-04-06 00:36:14,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166994024] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 00:36:14,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 00:36:14,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-04-06 00:36:14,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905249186] [2024-04-06 00:36:14,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 00:36:14,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-06 00:36:14,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 00:36:14,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-06 00:36:14,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-06 00:36:14,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:14,587 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 00:36:14,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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-04-06 00:36:14,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:14,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-06 00:36:14,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-06 00:36:14,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-04-06 00:36:14,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:14,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:14,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-06 00:36:14,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-06 00:36:14,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-04-06 00:36:14,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-06 00:36:14,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-04-06 00:36:14,945 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-06 00:36:14,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 00:36:14,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1917543094, now seen corresponding path program 1 times [2024-04-06 00:36:14,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 00:36:14,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95540248] [2024-04-06 00:36:14,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:36:14,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:36:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:36:19,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 00:36:19,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 00:36:19,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95540248] [2024-04-06 00:36:19,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95540248] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 00:36:19,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 00:36:19,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2024-04-06 00:36:19,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196665686] [2024-04-06 00:36:19,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 00:36:19,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-04-06 00:36:19,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 00:36:19,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-04-06 00:36:19,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1453, Unknown=0, NotChecked=0, Total=1640 [2024-04-06 00:36:19,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:19,349 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 00:36:19,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.829268292682927) internal successors, (198), 41 states have internal predecessors, (198), 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-04-06 00:36:19,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:19,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-06 00:36:19,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-06 00:36:19,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-04-06 00:36:19,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-06 00:36:19,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:21,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:21,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-06 00:36:21,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-06 00:36:21,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-04-06 00:36:21,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-06 00:36:21,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-04-06 00:36:21,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-04-06 00:36:21,483 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-06 00:36:21,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 00:36:21,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1457605787, now seen corresponding path program 1 times [2024-04-06 00:36:21,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 00:36:21,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885639750] [2024-04-06 00:36:21,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:36:21,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:36:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:36:23,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 00:36:23,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 00:36:23,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885639750] [2024-04-06 00:36:23,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885639750] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 00:36:23,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 00:36:23,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2024-04-06 00:36:23,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061262778] [2024-04-06 00:36:23,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 00:36:23,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-04-06 00:36:23,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 00:36:23,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-04-06 00:36:23,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2024-04-06 00:36:23,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:23,542 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 00:36:23,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 6.516129032258065) internal successors, (202), 31 states have internal predecessors, (202), 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-04-06 00:36:23,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:23,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-06 00:36:23,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-06 00:36:23,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-04-06 00:36:23,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-06 00:36:23,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-04-06 00:36:23,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:24,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:24,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-06 00:36:24,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-06 00:36:24,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-04-06 00:36:24,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-06 00:36:24,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-04-06 00:36:24,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-04-06 00:36:24,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-04-06 00:36:24,889 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-06 00:36:24,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 00:36:24,890 INFO L85 PathProgramCache]: Analyzing trace with hash 145069809, now seen corresponding path program 1 times [2024-04-06 00:36:24,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 00:36:24,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614630403] [2024-04-06 00:36:24,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:36:24,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:36:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:36:27,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-04-06 00:36:27,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 00:36:27,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614630403] [2024-04-06 00:36:27,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614630403] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 00:36:27,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 00:36:27,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2024-04-06 00:36:27,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109311882] [2024-04-06 00:36:27,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 00:36:27,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-04-06 00:36:27,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 00:36:27,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-04-06 00:36:27,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1180, Unknown=0, NotChecked=0, Total=1332 [2024-04-06 00:36:27,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:27,748 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 00:36:27,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 5.45945945945946) internal successors, (202), 37 states have internal predecessors, (202), 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-04-06 00:36:27,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:27,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-06 00:36:27,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-06 00:36:27,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-04-06 00:36:27,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-06 00:36:27,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-04-06 00:36:27,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-04-06 00:36:27,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:29,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:29,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-06 00:36:29,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-06 00:36:29,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-04-06 00:36:29,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-06 00:36:29,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-04-06 00:36:29,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-04-06 00:36:29,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-04-06 00:36:29,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-04-06 00:36:29,584 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-06 00:36:29,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 00:36:29,585 INFO L85 PathProgramCache]: Analyzing trace with hash 272690006, now seen corresponding path program 1 times [2024-04-06 00:36:29,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 00:36:29,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853863269] [2024-04-06 00:36:29,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:36:29,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:36:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:36:34,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 00:36:34,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 00:36:34,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853863269] [2024-04-06 00:36:34,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853863269] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 00:36:34,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 00:36:34,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2024-04-06 00:36:34,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692779096] [2024-04-06 00:36:34,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 00:36:34,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-04-06 00:36:34,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 00:36:34,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-04-06 00:36:34,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2294, Unknown=0, NotChecked=0, Total=2450 [2024-04-06 00:36:34,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:34,004 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 00:36:34,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.12) internal successors, (206), 50 states have internal predecessors, (206), 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-04-06 00:36:34,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:34,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-06 00:36:34,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-06 00:36:34,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-04-06 00:36:34,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-06 00:36:34,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-04-06 00:36:34,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-04-06 00:36:34,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-04-06 00:36:34,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:38,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:36:38,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-06 00:36:38,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-06 00:36:38,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-04-06 00:36:38,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-06 00:36:38,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-04-06 00:36:38,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-04-06 00:36:38,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-04-06 00:36:38,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-04-06 00:36:38,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-04-06 00:36:38,054 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-06 00:36:38,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 00:36:38,055 INFO L85 PathProgramCache]: Analyzing trace with hash -680365112, now seen corresponding path program 1 times [2024-04-06 00:36:38,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 00:36:38,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410242858] [2024-04-06 00:36:38,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:36:38,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:36:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:36:41,323 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 00:36:41,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 00:36:41,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410242858] [2024-04-06 00:36:41,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410242858] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-06 00:36:41,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52318797] [2024-04-06 00:36:41,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:36:41,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 00:36:41,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 00:36:41,326 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-06 00:36:41,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-04-06 00:36:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:36:41,515 INFO L262 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 119 conjunts are in the unsatisfiable core [2024-04-06 00:36:41,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-06 00:36:41,662 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-06 00:36:41,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-04-06 00:36:41,707 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 00:36:41,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-04-06 00:36:41,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-04-06 00:36:41,946 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 11 [2024-04-06 00:36:42,243 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-04-06 00:36:42,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-06 00:36:42,495 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 11 [2024-04-06 00:36:42,540 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 11 [2024-04-06 00:36:42,741 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 19 treesize of output 11 [2024-04-06 00:36:42,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-06 00:36:42,839 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-04-06 00:36:43,028 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-04-06 00:36:43,294 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 11 [2024-04-06 00:36:43,334 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 11 [2024-04-06 00:36:43,511 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 19 treesize of output 11 [2024-04-06 00:36:43,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-06 00:36:43,582 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-04-06 00:36:43,787 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 11 [2024-04-06 00:36:43,879 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 11 [2024-04-06 00:36:44,093 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 11 [2024-04-06 00:36:44,108 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 11 [2024-04-06 00:36:44,147 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 00:36:44,147 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-06 00:36:44,832 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_~x#1| Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_458) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1))))) is different from false [2024-04-06 00:36:44,872 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_~x#1| Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_458) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1))))) is different from false [2024-04-06 00:36:44,878 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_~x#1| Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_458) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1))))) is different from false [2024-04-06 00:36:44,885 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_~x#1| Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_458) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1))))) is different from false [2024-04-06 00:36:44,893 WARN L854 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1|) (forall ((v_ArrVal_458 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_~x#1| Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_458) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1)))))) is different from false [2024-04-06 00:36:44,902 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (forall ((v_ArrVal_458 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_~x#1| Int)) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_458) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse2)))))))) is different from false [2024-04-06 00:36:45,040 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_455 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_455) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_458) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|)) .cse1))))) (= 400 .cse4))))) is different from false [2024-04-06 00:36:45,053 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_458 (Array Int Int)) (v_ArrVal_455 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int)) (let ((.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse5 (+ (* (select .cse5 .cse3) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_455) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_458) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|)) .cse1)))) (= 400 .cse4)))))) is different from false [2024-04-06 00:36:45,073 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_458 (Array Int Int)) (v_ArrVal_455 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int)) (let ((.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse3 (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (store .cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* (select .cse5 .cse4) 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_455) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_458) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|)) .cse2))))))))) is different from false [2024-04-06 00:36:45,503 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_458 (Array Int Int)) (v_ArrVal_455 Int) (v_ArrVal_452 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int) (v_ArrVal_453 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (let ((.cse4 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_452) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_453) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)))) (let ((.cse3 (select .cse2 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_453) |c_~#queue~0.base| (store (store .cse2 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_455) .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_458) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|)) .cse1))) (= 400 .cse3)))))) is different from false [2024-04-06 00:36:45,569 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_458 (Array Int Int)) (v_ArrVal_455 Int) (v_ArrVal_452 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int) (v_ArrVal_453 (Array Int Int))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse4 (let ((.cse5 (select (store (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_452) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_453) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)))) (let ((.cse0 (select .cse4 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_453) |c_~#queue~0.base| (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_455) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_458) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|)) .cse2)))))))) is different from false [2024-04-06 00:36:45,579 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_458 (Array Int Int)) (v_ArrVal_455 Int) (v_ArrVal_452 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int) (v_ArrVal_453 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))) (let ((.cse3 (let ((.cse5 (select (store (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_452) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_453) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store (store .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_453) |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_455) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_458) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|)) .cse1))) (= 400 .cse4)))))) is different from false [2024-04-06 00:36:45,589 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_458 (Array Int Int)) (v_ArrVal_455 Int) (v_ArrVal_452 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int) (v_ArrVal_453 (Array Int Int))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))))) (let ((.cse4 (let ((.cse5 (select (store (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_452) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_453) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)))) (let ((.cse0 (select .cse4 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_453) |c_~#queue~0.base| (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_455) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_458) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|)) .cse2)))))))) is different from false [2024-04-06 00:36:45,746 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse7 .cse8))) (or (= 400 .cse0) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_458 (Array Int Int)) (v_ArrVal_455 Int) (v_ArrVal_452 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int) (v_ArrVal_453 (Array Int Int))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 (+ .cse0 1))))) (let ((.cse5 (let ((.cse6 (select (store (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_452) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_453) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)))) (let ((.cse1 (select .cse5 .cse3))) (or (= 400 .cse1) (not (= 400 (select (let ((.cse2 (select (store (store (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_453) |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_455) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_458) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|)) .cse3))))))))))) is different from false [2024-04-06 00:37:01,171 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_447 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_458 (Array Int Int)) (v_ArrVal_455 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int) (v_ArrVal_452 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int) (v_ArrVal_449 Int) (v_ArrVal_453 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_27| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_447))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse9 (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse7 (select .cse9 .cse2))) (let ((.cse5 (let ((.cse8 (select (store (store (store .cse4 |c_~#queue~0.base| (store (store .cse9 .cse6 v_ArrVal_449) .cse2 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_452) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_453) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_27|)))) (let ((.cse0 (select .cse5 .cse2))) (or (= 400 .cse0) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33|) (not (= 400 (select (let ((.cse3 (select (store (store (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_453) |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_455) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_458) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|)) .cse2))) (= 400 .cse7))))))))) is different from false [2024-04-06 00:37:01,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-06 00:37:01,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1223 treesize of output 733 [2024-04-06 00:37:01,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-06 00:37:01,820 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 1335 treesize of output 1315 [2024-04-06 00:37:01,833 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 899 treesize of output 811 [2024-04-06 00:37:01,849 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 546 treesize of output 510 [2024-04-06 00:37:01,866 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 666 treesize of output 610 [2024-04-06 00:37:01,888 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 258 treesize of output 234 [2024-04-06 00:37:02,023 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 8 treesize of output 4 [2024-04-06 00:37:02,277 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-06 00:37:02,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 321 treesize of output 269 [2024-04-06 00:37:02,829 INFO L349 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2024-04-06 00:37:02,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 90 [2024-04-06 00:37:02,893 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2024-04-06 00:37:02,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52318797] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-06 00:37:02,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-06 00:37:02,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36, 43] total 113 [2024-04-06 00:37:02,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14754304] [2024-04-06 00:37:02,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-06 00:37:02,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 113 states [2024-04-06 00:37:02,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 00:37:02,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2024-04-06 00:37:02,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=890, Invalid=8593, Unknown=83, NotChecked=3090, Total=12656 [2024-04-06 00:37:02,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:37:02,898 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 00:37:02,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 113 states, 113 states have (on average 6.424778761061947) internal successors, (726), 113 states have internal predecessors, (726), 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-04-06 00:37:02,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:37:02,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-06 00:37:02,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-06 00:37:02,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-04-06 00:37:02,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-06 00:37:02,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-04-06 00:37:02,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-04-06 00:37:02,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-04-06 00:37:02,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-04-06 00:37:02,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:37:12,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:37:12,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-06 00:37:12,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-06 00:37:12,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-04-06 00:37:12,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-06 00:37:12,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-04-06 00:37:12,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-04-06 00:37:12,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-04-06 00:37:12,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-04-06 00:37:12,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-04-06 00:37:12,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-04-06 00:37:12,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-04-06 00:37:12,467 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-06 00:37:12,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 00:37:12,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1926876931, now seen corresponding path program 1 times [2024-04-06 00:37:12,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 00:37:12,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186430311] [2024-04-06 00:37:12,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:37:12,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:37:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:37:16,914 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 00:37:16,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 00:37:16,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186430311] [2024-04-06 00:37:16,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186430311] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-06 00:37:16,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607637652] [2024-04-06 00:37:16,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:37:16,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 00:37:16,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 00:37:16,916 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-06 00:37:16,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-04-06 00:37:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:37:17,100 INFO L262 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 126 conjunts are in the unsatisfiable core [2024-04-06 00:37:17,127 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-06 00:37:17,236 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-06 00:37:17,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-04-06 00:37:17,279 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 00:37:17,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-04-06 00:37:17,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-04-06 00:37:17,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-04-06 00:37:17,576 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 30 treesize of output 21 [2024-04-06 00:37:17,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-04-06 00:37:18,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-06 00:37:18,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-06 00:37:18,148 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 34 treesize of output 21 [2024-04-06 00:37:18,246 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 30 treesize of output 21 [2024-04-06 00:37:18,435 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 30 treesize of output 14 [2024-04-06 00:37:18,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-06 00:37:18,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-04-06 00:37:18,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-04-06 00:37:19,210 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-04-06 00:37:19,210 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 2 case distinctions, treesize of input 41 treesize of output 24 [2024-04-06 00:37:19,251 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 30 treesize of output 21 [2024-04-06 00:37:19,475 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 43 treesize of output 23 [2024-04-06 00:37:19,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-06 00:37:19,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-04-06 00:37:19,842 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 30 treesize of output 21 [2024-04-06 00:37:20,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-04-06 00:37:20,413 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-04-06 00:37:20,414 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 2 case distinctions, treesize of input 41 treesize of output 24 [2024-04-06 00:37:20,453 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 30 treesize of output 21 [2024-04-06 00:37:20,524 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 30 treesize of output 14 [2024-04-06 00:37:20,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-06 00:37:20,602 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-04-06 00:37:20,798 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 11 [2024-04-06 00:37:20,841 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 00:37:20,841 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-06 00:37:21,009 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_628 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)) 400))) is different from false [2024-04-06 00:37:23,436 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| Int)) (or (< |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41|) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (v_ArrVal_625 Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| 1))))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (let ((.cse2 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_625) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) .cse2)))) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|))))))) is different from false [2024-04-06 00:37:23,448 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (v_ArrVal_625 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| 1))))) (let ((.cse3 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41|) (not (= 400 (let ((.cse4 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store .cse3 .cse4 (+ (select .cse3 .cse4) 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_625) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) .cse4)))) (< (select .cse3 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|)))))) is different from false [2024-04-06 00:37:23,519 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_617 Int) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (v_ArrVal_625 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_617) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| 1))))) (let ((.cse2 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (not (= 400 (let ((.cse5 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse2 .cse5 (+ (select .cse2 .cse5) 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_625) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) .cse5))))))))) is different from false [2024-04-06 00:37:23,564 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_617 Int) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (v_ArrVal_625 Int)) (let ((.cse4 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_617) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| 1))))) (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (not (= 400 (let ((.cse3 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store .cse0 .cse3 (+ (select .cse0 .cse3) 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_35|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_625) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) .cse3)))) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41|)))))) is different from false [2024-04-06 00:37:23,584 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_617 Int) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (v_ArrVal_625 Int)) (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_617) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| 1))))) (let ((.cse2 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41|) (not (= 400 (let ((.cse6 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse5 |c_~#queue~0.base| (store (store (store (store .cse2 .cse6 (+ (select .cse2 .cse6) 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_35|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_625) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) .cse6)))))))))))) is different from false [2024-04-06 00:37:23,621 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_617 Int) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (v_ArrVal_625 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_617) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| 1))))) (let ((.cse0 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (not (= 400 (let ((.cse6 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse5 |c_~#queue~0.base| (store (store (store (store .cse0 .cse6 (+ (select .cse0 .cse6) 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_35|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_625) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) .cse6)))))))))) is different from false [2024-04-06 00:37:24,672 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_617 Int) (v_ArrVal_625 Int) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_613) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614) |c_~#queue~0.base|))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614)) (.cse6 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_617) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (not (= 400 (let ((.cse4 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store .cse3 .cse4 (+ (select .cse3 .cse4) 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_35|) .cse5 v_ArrVal_625) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) .cse4)))) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41|)))))) is different from false [2024-04-06 00:37:24,835 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_617 Int) (v_ArrVal_625 Int) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int)) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse0 (select (store (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_613) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614) |c_~#queue~0.base|))) (let ((.cse3 (store .cse7 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614)) (.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse2 .cse6 v_ArrVal_617) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41|) (not (= (let ((.cse5 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse4 .cse5 (+ (select .cse4 .cse5) 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_35|) .cse6 v_ArrVal_625) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) .cse5)) 400)) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|))))))) is different from false [2024-04-06 00:37:24,861 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45| Int)) (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_617 Int) (v_ArrVal_625 Int) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int)) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45| 1))))) (let ((.cse0 (select (store (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_613) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614) |c_~#queue~0.base|))) (let ((.cse3 (store .cse7 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614)) (.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse2 .cse6 v_ArrVal_617) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41|) (not (= 400 (let ((.cse5 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse4 .cse5 (+ (select .cse4 .cse5) 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_35|) .cse6 v_ArrVal_625) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) .cse5)))) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|))))))) (< |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45|))) is different from false [2024-04-06 00:37:24,885 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_617 Int) (v_ArrVal_625 Int) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45| 1))))) (let ((.cse0 (select (store (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_613) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614) |c_~#queue~0.base|))) (let ((.cse3 (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614)) (.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse2 .cse6 v_ArrVal_617) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41|) (not (= 400 (let ((.cse5 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse4 .cse5 (+ (select .cse4 .cse5) 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_35|) .cse6 v_ArrVal_625) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) .cse5)))) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (< (select .cse7 .cse8) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45|)))))))) is different from false [2024-04-06 00:37:25,023 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_617 Int) (v_ArrVal_625 Int) (v_ArrVal_610 Int) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_610) .cse7 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45| 1))))) (let ((.cse0 (select (store (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_613) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614) |c_~#queue~0.base|))) (let ((.cse2 (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614)) (.cse8 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse8 .cse5 v_ArrVal_617) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (not (= 400 (let ((.cse4 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store .cse3 .cse4 (+ (select .cse3 .cse4) 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_35|) .cse5 v_ArrVal_625) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) .cse4)))) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (< (select .cse6 .cse7) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45|) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41|)))))))) is different from false [2024-04-06 00:37:25,122 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_617 Int) (v_ArrVal_625 Int) (v_ArrVal_610 Int) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_39| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45| Int)) (let ((.cse6 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_610) .cse7 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45| 1))))) (let ((.cse8 (select (store (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_613) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614) |c_~#queue~0.base|))) (let ((.cse2 (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614)) (.cse5 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_39|)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_617) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (not (= 400 (let ((.cse3 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store .cse0 .cse3 (+ (select .cse0 .cse3) 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_35|) .cse4 v_ArrVal_625) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) .cse3)))) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41|) (< (select .cse6 .cse7) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45|) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|)))))))) is different from false [2024-04-06 00:37:25,159 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46|) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_617 Int) (v_ArrVal_625 Int) (v_ArrVal_610 Int) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_39| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45| Int)) (let ((.cse9 (store .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|))) (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse9 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_610) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45| 1))))) (let ((.cse8 (select (store (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_613) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614) |c_~#queue~0.base|))) (let ((.cse4 (store .cse10 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614)) (.cse2 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_39|)) (.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_617) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (or (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41|) (not (= 400 (let ((.cse6 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_35|) .cse7 v_ArrVal_625) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) .cse6)))) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45|))))))))))) is different from false [2024-04-06 00:37:25,222 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| Int) (v_ArrVal_617 Int) (v_ArrVal_625 Int) (v_ArrVal_610 Int) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_39| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45| Int)) (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse8 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_610) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45| 1))))) (let ((.cse9 (select (store (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_613) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614) |c_~#queue~0.base|))) (let ((.cse4 (store .cse10 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614)) (.cse2 (store .cse9 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_39|)) (.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_617) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41|) (not (= 400 (let ((.cse6 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_35|) .cse7 v_ArrVal_625) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) .cse6)))) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46|) (< (select .cse9 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|))))))))) is different from false [2024-04-06 00:37:29,336 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| Int) (v_ArrVal_617 Int) (v_ArrVal_625 Int) (v_ArrVal_610 Int) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_39| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45| Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_608))) (let ((.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select (store (store (store .cse9 |c_~#queue~0.base| (store (store .cse2 .cse8 v_ArrVal_610) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45| 1))) |c_~#stored_elements~0.base| v_ArrVal_613) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614) |c_~#queue~0.base|))) (let ((.cse6 (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614)) (.cse0 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_39|))) (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse8 v_ArrVal_617) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46|) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (not (= 400 (let ((.cse7 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse6 |c_~#queue~0.base| (store (store (store (store .cse5 .cse7 (+ (select .cse5 .cse7) 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_35|) .cse8 v_ArrVal_625) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) .cse7)))))))))))) is different from false [2024-04-06 00:37:30,006 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| Int) (v_ArrVal_606 Int) (v_ArrVal_617 Int) (v_ArrVal_625 Int) (v_ArrVal_610 Int) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_39| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45| Int)) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_606)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_608))) (let ((.cse5 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse8 (select (store (store (store .cse9 |c_~#queue~0.base| (store (store .cse7 .cse3 v_ArrVal_610) .cse4 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45| 1))) |c_~#stored_elements~0.base| v_ArrVal_613) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614) |c_~#queue~0.base|))) (let ((.cse0 (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614)) (.cse6 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_39|))) (let ((.cse1 (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse6 .cse3 v_ArrVal_617) .cse4 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (or (not (= 400 (let ((.cse2 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_35|) .cse3 v_ArrVal_625) .cse4 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) .cse2)))) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46|) (< (select .cse1 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (< (select .cse6 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41|) (< (select .cse7 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45|) (< (select .cse8 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|))))))))) is different from false [2024-04-06 00:37:30,044 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| Int) (v_ArrVal_606 Int) (v_ArrVal_617 Int) (v_ArrVal_625 Int) (v_ArrVal_610 Int) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_39| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45| Int)) (let ((.cse9 (store (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| 1604) 0) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_606)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_608))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (select (store (store (store .cse9 |c_~#queue~0.base| (store (store .cse7 .cse5 v_ArrVal_610) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45| 1))) |c_~#stored_elements~0.base| v_ArrVal_613) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614) |c_~#queue~0.base|))) (let ((.cse2 (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614)) (.cse0 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_39|))) (let ((.cse3 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_617) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41|) (not (= 400 (let ((.cse4 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store .cse3 .cse4 (+ (select .cse3 .cse4) 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_35|) .cse5 v_ArrVal_625) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) .cse4)))) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45|) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46|))))))))) is different from false [2024-04-06 00:37:30,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-06 00:37:30,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 721 treesize of output 431 [2024-04-06 00:37:30,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-06 00:37:30,113 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 2624 treesize of output 2612 [2024-04-06 00:37:30,146 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 462 treesize of output 450 [2024-04-06 00:37:30,170 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 668 treesize of output 628 [2024-04-06 00:37:30,189 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 274 treesize of output 262 [2024-04-06 00:37:30,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 370 treesize of output 354 [2024-04-06 00:37:30,230 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 92 treesize of output 80 [2024-04-06 00:37:30,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-06 00:37:30,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 9 [2024-04-06 00:37:30,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-06 00:37:30,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 453 treesize of output 465 [2024-04-06 00:37:32,924 INFO L349 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2024-04-06 00:37:32,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 90 [2024-04-06 00:37:32,980 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 26 not checked. [2024-04-06 00:37:32,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607637652] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-06 00:37:32,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-06 00:37:32,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 41, 48] total 134 [2024-04-06 00:37:32,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580793675] [2024-04-06 00:37:32,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-06 00:37:32,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 134 states [2024-04-06 00:37:32,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 00:37:32,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2024-04-06 00:37:32,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1293, Invalid=12041, Unknown=78, NotChecked=4410, Total=17822 [2024-04-06 00:37:32,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:37:32,986 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 00:37:32,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 134 states, 134 states have (on average 6.059701492537314) internal successors, (812), 134 states have internal predecessors, (812), 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-04-06 00:37:32,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:37:32,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-06 00:37:32,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-06 00:37:32,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-04-06 00:37:32,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-06 00:37:32,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-04-06 00:37:32,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-04-06 00:37:32,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-04-06 00:37:32,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-04-06 00:37:32,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-04-06 00:37:32,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:37:45,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 00:37:45,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-06 00:37:45,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-06 00:37:45,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-04-06 00:37:45,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-06 00:37:45,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-04-06 00:37:45,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-04-06 00:37:45,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-04-06 00:37:45,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-04-06 00:37:45,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-04-06 00:37:45,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-04-06 00:37:45,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-04-06 00:37:45,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 00:37:45,843 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-06 00:37:45,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 00:37:45,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1452722792, now seen corresponding path program 1 times [2024-04-06 00:37:45,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 00:37:45,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847518336] [2024-04-06 00:37:45,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:37:45,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 00:37:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:37:56,491 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 00:37:56,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 00:37:56,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847518336] [2024-04-06 00:37:56,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847518336] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-06 00:37:56,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066391204] [2024-04-06 00:37:56,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 00:37:56,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 00:37:56,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 00:37:56,493 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-06 00:37:56,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-04-06 00:37:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 00:37:56,712 INFO L262 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 164 conjunts are in the unsatisfiable core [2024-04-06 00:37:56,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-06 00:37:56,918 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-06 00:37:56,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-04-06 00:37:56,991 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 00:37:56,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-04-06 00:37:57,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-04-06 00:37:57,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-04-06 00:37:57,417 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 30 treesize of output 21 [2024-04-06 00:37:57,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-04-06 00:37:58,234 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 30 treesize of output 21 [2024-04-06 00:37:58,295 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 30 treesize of output 21 [2024-04-06 00:37:58,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-04-06 00:37:58,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-06 00:37:58,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-04-06 00:37:59,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-04-06 00:38:00,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-04-06 00:38:00,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-04-06 00:38:00,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2024-04-06 00:38:00,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-06 00:38:00,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2024-04-06 00:38:01,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-06 00:38:01,524 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 41 treesize of output 38 [2024-04-06 00:38:01,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-06 00:38:01,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2024-04-06 00:38:02,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-06 00:38:02,925 INFO L349 Elim1Store]: treesize reduction 58, result has 34.1 percent of original size [2024-04-06 00:38:02,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 64 [2024-04-06 00:38:03,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-06 00:38:03,141 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 42 treesize of output 39 [2024-04-06 00:38:03,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-06 00:38:03,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2024-04-06 00:38:03,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-06 00:38:03,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-06 00:38:03,677 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 42 treesize of output 28 [2024-04-06 00:38:04,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-06 00:38:04,437 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 34 treesize of output 23 [2024-04-06 00:38:04,439 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 20 treesize of output 14 [2024-04-06 00:38:04,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-06 00:38:04,610 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-04-06 00:38:04,887 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-04-06 00:38:04,956 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 00:38:04,956 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-06 00:38:05,170 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset|)) (.cse1 (= |c_t2Thread1of1ForFork0_dequeue_~x~0#1| 0))) (and (or (forall ((v_ArrVal_795 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_~q#1.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse0) 0))) .cse1) (or (forall ((v_ArrVal_795 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_~q#1.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse0) 1))) (not .cse1)))) is different from false [2024-04-06 00:38:05,253 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_t2Thread1of1ForFork0_dequeue_#t~mem43#1| 0)) (.cse1 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset|))) (and (or .cse0 (forall ((v_ArrVal_795 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_~q#1.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse1) 0)))) (or (not .cse0) (forall ((v_ArrVal_795 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_~q#1.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse1) 1)))))) is different from false [2024-04-06 00:38:05,847 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset|)) (.cse4 (select |c_#memory_int| |c_~#stored_elements~0.base|)) (.cse5 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork1_~i~0#1| 4)))) (and (forall ((|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| (store .cse4 .cse5 |t1Thread1of1ForFork1_~value~0#1|)))) (or (= (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|))) 0) (forall ((v_ArrVal_795 (Array Int Int))) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse3) 0)))))) (forall ((|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| (store .cse4 .cse5 |t1Thread1of1ForFork1_~value~0#1|)))) (or (not (= (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (select .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_795 (Array Int Int))) (not (= (select (select (store .cse7 |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse3) 1)))))))) is different from false [2024-04-06 00:38:54,209 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_~q#1.base|)) (.cse13 (+ |c_t2Thread1of1ForFork0_dequeue_~q#1.offset| 1600))) (let ((.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse2 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset| 4)) (.cse6 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#queue~0.offset| 1604)) (.cse12 (+ 1608 |c_t2Thread1of1ForFork0_dequeue_~q#1.offset|)) (.cse14 (+ (select .cse11 .cse13) 1))) (and (forall ((v_ArrVal_786 Int) (|t1Thread1of1ForFork1_enqueue_~x#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_~q#1.base| (store (store .cse11 .cse12 v_ArrVal_786) .cse13 .cse14)))) (let ((.cse7 (let ((.cse10 (select .cse0 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)))) (or (forall ((|t1Thread1of1ForFork1_enqueue_#t~post41#1| Int) (v_ArrVal_790 Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse5 (store .cse0 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_790) .cse9 (+ |t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse1 (store (select .cse5 |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork1_~value~0#1|))) (or (forall ((v_ArrVal_795 (Array Int Int))) (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse2) 0))) (= (let ((.cse3 (select (store .cse5 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|))) 0))))) (= 400 (select .cse7 .cse9)))))) (forall ((v_ArrVal_786 Int) (|t1Thread1of1ForFork1_enqueue_~x#1| Int)) (let ((.cse18 (store |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_~q#1.base| (store (store .cse11 .cse12 v_ArrVal_786) .cse13 .cse14)))) (let ((.cse19 (let ((.cse20 (select .cse18 |c_~#queue~0.base|))) (store .cse20 (+ (* (select .cse20 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)))) (or (forall ((|t1Thread1of1ForFork1_enqueue_#t~post41#1| Int) (v_ArrVal_790 Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse16 (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse8 v_ArrVal_790) .cse9 (+ |t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse17 (store (select .cse16 |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork1_~value~0#1|))) (or (not (= (let ((.cse15 (select (store .cse16 |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base|))) (select .cse15 (+ (* (select .cse15 .cse4) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_795 (Array Int Int))) (not (= (select (select (store (store .cse18 |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse2) 1))))))) (= 400 (select .cse19 .cse9))))))))) is different from false [2024-04-06 00:39:42,614 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ 1600 |c_~#queue~0.offset|))) (let ((.cse9 (+ |c_~#queue~0.offset| 1604)) (.cse7 (+ (select .cse5 .cse3) 1))) (let ((.cse1 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset| 4)) (.cse10 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse11 (store .cse5 .cse3 .cse7)) (.cse8 (+ (* (select .cse5 .cse9) 4) |c_~#queue~0.offset|)) (.cse6 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_786 Int) (|t1Thread1of1ForFork1_enqueue_#t~post41#1| Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_ArrVal_795 (Array Int Int)) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse4 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse11 .cse8 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse6 v_ArrVal_790) .cse9 (+ |t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse0 (store (select .cse4 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) |t1Thread1of1ForFork1_~value~0#1|))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse1) 0)) (= (let ((.cse2 (select (store .cse4 |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|))) (select .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|))) 0) (= (select (store (store (store .cse5 .cse6 v_ArrVal_786) .cse3 .cse7) .cse8 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse9) 400) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse10))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_786 Int) (|t1Thread1of1ForFork1_enqueue_#t~post41#1| Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_ArrVal_795 (Array Int Int)) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse14 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse11 .cse8 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse6 v_ArrVal_790) .cse9 (+ |t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse12 (store (select .cse14 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) |t1Thread1of1ForFork1_~value~0#1|))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse1) 1)) (= (select (store (store (store .cse5 .cse6 v_ArrVal_786) .cse3 .cse7) .cse8 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse9) 400) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse10) (not (= (let ((.cse13 (select (store .cse14 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (select .cse13 (+ (* (select .cse13 .cse3) 4) |c_~#queue~0.offset|))) 0)))))))))) is different from false [2024-04-06 00:39:42,898 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork1_~i~0#1| 4)) |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse6 (select .cse11 |c_~#queue~0.base|)) (.cse1 (+ 1600 |c_~#queue~0.offset|))) (let ((.cse10 (+ |c_~#queue~0.offset| 1604)) (.cse8 (+ (select .cse6 .cse1) 1))) (let ((.cse5 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse4 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset| 4)) (.cse12 (store .cse6 .cse1 .cse8)) (.cse9 (+ (* 4 (select .cse6 .cse10)) |c_~#queue~0.offset|)) (.cse7 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_786 Int) (|t1Thread1of1ForFork1_enqueue_#t~post41#1| Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_3 Int) (v_ArrVal_795 (Array Int Int))) (let ((.cse2 (store (store (store .cse12 .cse9 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse7 v_ArrVal_790) .cse10 (+ |t1Thread1of1ForFork1_enqueue_#t~post41#1| 1)))) (let ((.cse3 (store (select (store .cse11 |c_~#queue~0.base| .cse2) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (not (= (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse2) |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base|))) (select .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|))) 0)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse4) 1)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse5) (= 400 (select (store (store (store .cse6 .cse7 v_ArrVal_786) .cse1 .cse8) .cse9 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse10)))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_786 Int) (|t1Thread1of1ForFork1_enqueue_#t~post41#1| Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_ArrVal_795 (Array Int Int)) (v_subst_2 Int)) (let ((.cse14 (store (store (store .cse12 .cse9 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse7 v_ArrVal_790) .cse10 (+ |t1Thread1of1ForFork1_enqueue_#t~post41#1| 1)))) (let ((.cse15 (store (select (store .cse11 |c_~#queue~0.base| .cse14) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse5) (= (let ((.cse13 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse14) |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base|))) (select .cse13 (+ (* 4 (select .cse13 .cse1)) |c_~#queue~0.offset|))) 0) (= 400 (select (store (store (store .cse6 .cse7 v_ArrVal_786) .cse1 .cse8) .cse9 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse10)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse4) 0))))))))))) is different from false [2024-04-06 00:39:43,640 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse12 (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork1_~i~0#1| 4)) |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse3 (select .cse12 |c_~#queue~0.base|)) (.cse5 (+ 1600 |c_~#queue~0.offset|))) (let ((.cse8 (+ |c_~#queue~0.offset| 1604)) (.cse6 (+ (select .cse3 .cse5) 1))) (let ((.cse2 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset| 4)) (.cse11 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse13 (store .cse3 .cse5 .cse6)) (.cse7 (+ (* (select .cse3 .cse8) 4) |c_~#queue~0.offset|)) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_786 Int) (v_ArrVal_790 Int) (v_subst_5 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_3 Int) (v_ArrVal_795 (Array Int Int))) (let ((.cse10 (store (store (store .cse13 .cse7 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse4 v_ArrVal_790) .cse8 (+ v_subst_5 1)))) (let ((.cse1 (store (select (store .cse12 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse2) 1)) (= 400 (select (store (store (store .cse3 .cse4 v_ArrVal_786) .cse5 .cse6) .cse7 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse8)) (not (= 0 (let ((.cse9 (select (store (store .cse0 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse5) 4)))))) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse11))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_786 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_4 Int) (v_ArrVal_795 (Array Int Int)) (v_subst_2 Int)) (let ((.cse16 (store (store (store .cse13 .cse7 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse4 v_ArrVal_790) .cse8 (+ v_subst_4 1)))) (let ((.cse14 (store (select (store .cse12 |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse14) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse2) 0)) (= 400 (select (store (store (store .cse3 .cse4 v_ArrVal_786) .cse5 .cse6) .cse7 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse8)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse11) (= (let ((.cse15 (select (store (store .cse0 |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base| .cse14) |c_~#queue~0.base|))) (select .cse15 (+ (* (select .cse15 .cse5) 4) |c_~#queue~0.offset|))) 0))))))))))) is different from false [2024-04-06 00:39:43,799 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset| 4)) (.cse6 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse13 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (.cse14 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse15 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int)) (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_786 Int) (v_ArrVal_790 Int) (v_subst_5 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_3 Int) (v_ArrVal_795 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse14 .cse15 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse12 (store .cse7 |c_~#stored_elements~0.base| (store (select .cse7 |c_~#stored_elements~0.base|) .cse13 |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse0 (select .cse12 |c_~#queue~0.base|))) (let ((.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ (* (select .cse0 .cse5) 4) |c_~#queue~0.offset|))) (let ((.cse11 (store (store (store (store .cse0 .cse2 .cse3) .cse4 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1 v_ArrVal_790) .cse5 (+ v_subst_5 1)))) (let ((.cse8 (store (select (store .cse12 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (= 400 (select (store (store (store .cse0 .cse1 v_ArrVal_786) .cse2 .cse3) .cse4 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse5)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse6) (not (= (select (select (store (store .cse7 |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse9) 1)) (not (= (let ((.cse10 (select (store (store .cse7 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base|))) (select .cse10 (+ |c_~#queue~0.offset| (* 4 (select .cse10 .cse2))))) 0)))))))))) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1|))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int)) (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_786 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_4 Int) (v_ArrVal_795 (Array Int Int)) (v_subst_2 Int)) (let ((.cse20 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse14 .cse15 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse23 (store .cse20 |c_~#stored_elements~0.base| (store (select .cse20 |c_~#stored_elements~0.base|) .cse13 |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse16 (select .cse23 |c_~#queue~0.base|))) (let ((.cse17 (+ (select .cse16 .cse2) 1)) (.cse18 (+ (* (select .cse16 .cse5) 4) |c_~#queue~0.offset|))) (let ((.cse21 (store (store (store (store .cse16 .cse2 .cse17) .cse18 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1 v_ArrVal_790) .cse5 (+ v_subst_4 1)))) (let ((.cse22 (store (select (store .cse23 |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (= 400 (select (store (store (store .cse16 .cse1 v_ArrVal_786) .cse2 .cse17) .cse18 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse5)) (= (let ((.cse19 (select (store (store .cse20 |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base|))) (select .cse19 (+ |c_~#queue~0.offset| (* (select .cse19 .cse2) 4)))) 0) (not (= (select (select (store (store .cse20 |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse9) 0)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse6))))))))) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1|))))) is different from false [2024-04-06 00:39:44,006 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse16 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse9 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset| 4)) (.cse6 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse10 (select .cse15 .cse16)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse14 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork1_~i~0#1| 4)))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_786 Int) (v_ArrVal_790 Int) (v_subst_5 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_ArrVal_795 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse15 .cse16 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse13 (store .cse7 |c_~#stored_elements~0.base| (store (select .cse7 |c_~#stored_elements~0.base|) .cse14 |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse0 (select .cse13 |c_~#queue~0.base|))) (let ((.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ (* (select .cse0 .cse5) 4) |c_~#queue~0.offset|))) (let ((.cse12 (store (store (store (store .cse0 .cse2 .cse3) .cse4 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1 v_ArrVal_790) .cse5 (+ v_subst_5 1)))) (let ((.cse8 (store (select (store .cse13 |c_~#queue~0.base| .cse12) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (= 400 (select (store (store (store .cse0 .cse1 v_ArrVal_786) .cse2 .cse3) .cse4 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse5)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse6) (not (= (select (select (store (store .cse7 |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse9) 1)) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| .cse10) (not (= (let ((.cse11 (select (store (store .cse7 |c_~#queue~0.base| .cse12) |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base|))) (select .cse11 (+ |c_~#queue~0.offset| (* 4 (select .cse11 .cse2))))) 0)))))))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_786 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse15 .cse16 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse24 (store .cse21 |c_~#stored_elements~0.base| (store (select .cse21 |c_~#stored_elements~0.base|) .cse14 |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse17 (select .cse24 |c_~#queue~0.base|))) (let ((.cse18 (+ (select .cse17 .cse2) 1)) (.cse19 (+ (* (select .cse17 .cse5) 4) |c_~#queue~0.offset|))) (let ((.cse22 (store (store (store (store .cse17 .cse2 .cse18) .cse19 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1 v_ArrVal_790) .cse5 (+ v_subst_4 1)))) (let ((.cse23 (store (select (store .cse24 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (= 400 (select (store (store (store .cse17 .cse1 v_ArrVal_786) .cse2 .cse18) .cse19 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse5)) (= (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_795) |c_~#stored_elements~0.base|) .cse9) 0)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse6) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| .cse10)))))))))))) is different from false [2024-04-06 00:39:45,078 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse17 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse8 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset| 4)) (.cse9 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse12 (select .cse15 .cse17)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse14 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (.cse16 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_786 Int) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (v_subst_5 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_ArrVal_795 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse15 .cse16 v_ArrVal_782) .cse17 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse13 (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) .cse14 |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse0 (select .cse13 |c_~#queue~0.base|))) (let ((.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ (* (select .cse0 .cse5) 4) |c_~#queue~0.offset|))) (let ((.cse11 (store (store (store (store .cse0 .cse2 .cse3) .cse4 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1 v_ArrVal_790) .cse5 (+ v_subst_5 1)))) (let ((.cse7 (store (select (store .cse13 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (= 400 (select (store (store (store .cse0 .cse1 v_ArrVal_786) .cse2 .cse3) .cse4 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse5)) (not (= (select (select (store (store .cse6 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse8) 1)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse9) (not (= (let ((.cse10 (select (store (store .cse6 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base|))) (select .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse2) 4)))) 0)) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| .cse12))))))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_786 Int) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse15 .cse16 v_ArrVal_782) .cse17 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse25 (store .cse18 |c_~#stored_elements~0.base| (store (select .cse18 |c_~#stored_elements~0.base|) .cse14 |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse20 (select .cse25 |c_~#queue~0.base|))) (let ((.cse21 (+ (select .cse20 .cse2) 1)) (.cse22 (+ (* (select .cse20 .cse5) 4) |c_~#queue~0.offset|))) (let ((.cse24 (store (store (store (store .cse20 .cse2 .cse21) .cse22 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1 v_ArrVal_790) .cse5 (+ v_subst_4 1)))) (let ((.cse19 (store (select (store .cse25 |c_~#queue~0.base| .cse24) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (not (= (select (select (store (store .cse18 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse8) 0)) (= 400 (select (store (store (store .cse20 .cse1 v_ArrVal_786) .cse2 .cse21) .cse22 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse5)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse9) (= (let ((.cse23 (select (store (store .cse18 |c_~#queue~0.base| .cse24) |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (select .cse23 (+ (* (select .cse23 .cse2) 4) |c_~#queue~0.offset|))) 0) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| .cse12)))))))))))) is different from false [2024-04-06 00:39:45,919 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse17 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse15 .cse17)) (.cse9 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset| 4)) (.cse10 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 1604)) (.cse3 (+ 1600 |c_~#queue~0.offset|)) (.cse14 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (.cse16 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_786 Int) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse15 .cse16 v_ArrVal_782) .cse17 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse13 (store .cse7 |c_~#stored_elements~0.base| (store (select .cse7 |c_~#stored_elements~0.base|) .cse14 |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse1 (select .cse13 |c_~#queue~0.base|))) (let ((.cse4 (+ (select .cse1 .cse3) 1)) (.cse5 (+ (* (select .cse1 .cse6) 4) |c_~#queue~0.offset|))) (let ((.cse12 (store (store (store (store .cse1 .cse3 .cse4) .cse5 v_subst_7) .cse2 v_ArrVal_790) .cse6 (+ v_subst_4 1)))) (let ((.cse8 (store (select (store .cse13 |c_~#queue~0.base| .cse12) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| .cse0) (= (select (store (store (store .cse1 .cse2 v_ArrVal_786) .cse3 .cse4) .cse5 v_subst_7) .cse6) 400) (not (= (select (select (store (store .cse7 |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse9) 0)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse10) (= (let ((.cse11 (select (store (store .cse7 |c_~#queue~0.base| .cse12) |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base|))) (select .cse11 (+ |c_~#queue~0.offset| (* 4 (select .cse11 .cse3))))) 0))))))))) (forall ((v_ArrVal_786 Int) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (v_subst_6 Int) (v_subst_5 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_ArrVal_795 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse15 .cse16 v_ArrVal_782) .cse17 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse25 (store .cse18 |c_~#stored_elements~0.base| (store (select .cse18 |c_~#stored_elements~0.base|) .cse14 |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse20 (select .cse25 |c_~#queue~0.base|))) (let ((.cse21 (+ (select .cse20 .cse3) 1)) (.cse22 (+ (* (select .cse20 .cse6) 4) |c_~#queue~0.offset|))) (let ((.cse24 (store (store (store (store .cse20 .cse3 .cse21) .cse22 v_subst_6) .cse2 v_ArrVal_790) .cse6 (+ v_subst_5 1)))) (let ((.cse19 (store (select (store .cse25 |c_~#queue~0.base| .cse24) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| .cse0) (not (= (select (select (store (store .cse18 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse9) 1)) (= 400 (select (store (store (store .cse20 .cse2 v_ArrVal_786) .cse3 .cse21) .cse22 v_subst_6) .cse6)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse10) (not (= (let ((.cse23 (select (store (store .cse18 |c_~#queue~0.base| .cse24) |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (select .cse23 (+ (* (select .cse23 .cse3) 4) |c_~#queue~0.offset|))) 0))))))))))))) is different from false [2024-04-06 00:39:46,207 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse17 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse15 (let ((.cse26 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse26 (+ (* (select .cse26 .cse17) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_enqueue_~x#1|)))) (let ((.cse11 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset| 4)) (.cse10 (select .cse15 .cse17)) (.cse12 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse14 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (.cse16 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_786 Int) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse15 .cse16 v_ArrVal_782) .cse17 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse13 (store .cse7 |c_~#stored_elements~0.base| (store (select .cse7 |c_~#stored_elements~0.base|) .cse14 |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse0 (select .cse13 |c_~#queue~0.base|))) (let ((.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ (* (select .cse0 .cse5) 4) |c_~#queue~0.offset|))) (let ((.cse8 (store (store (store (store .cse0 .cse2 .cse3) .cse4 v_subst_7) .cse1 v_ArrVal_790) .cse5 (+ v_subst_4 1)))) (let ((.cse9 (store (select (store .cse13 |c_~#queue~0.base| .cse8) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (= 400 (select (store (store (store .cse0 .cse1 v_ArrVal_786) .cse2 .cse3) .cse4 v_subst_7) .cse5)) (= (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| .cse8) |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base|))) (select .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse2) 4)))) 0) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| .cse10) (not (= (select (select (store (store .cse7 |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse11) 0)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse12))))))))) (forall ((v_ArrVal_786 Int) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (v_subst_6 Int) (v_subst_5 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_ArrVal_795 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse15 .cse16 v_ArrVal_782) .cse17 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse25 (store .cse18 |c_~#stored_elements~0.base| (store (select .cse18 |c_~#stored_elements~0.base|) .cse14 |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse22 (select .cse25 |c_~#queue~0.base|))) (let ((.cse23 (+ (select .cse22 .cse2) 1)) (.cse24 (+ (* (select .cse22 .cse5) 4) |c_~#queue~0.offset|))) (let ((.cse21 (store (store (store (store .cse22 .cse2 .cse23) .cse24 v_subst_6) .cse1 v_ArrVal_790) .cse5 (+ v_subst_5 1)))) (let ((.cse19 (store (select (store .cse25 |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (not (= (select (select (store (store .cse18 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse11) 1)) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| .cse10) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse12) (not (= (let ((.cse20 (select (store (store .cse18 |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (select .cse20 (+ (* (select .cse20 .cse2) 4) |c_~#queue~0.offset|))) 0)) (= 400 (select (store (store (store .cse22 .cse1 v_ArrVal_786) .cse2 .cse23) .cse24 v_subst_6) .cse5)))))))))))))) is different from false [2024-04-06 00:39:46,500 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse17 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse15 (let ((.cse26 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse26 (+ (* (select .cse26 .cse17) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_enqueue_#in~x#1|)))) (let ((.cse0 (select .cse15 .cse17)) (.cse9 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset| 4)) (.cse12 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 1604)) (.cse3 (+ 1600 |c_~#queue~0.offset|)) (.cse14 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (.cse16 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_786 Int) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse15 .cse16 v_ArrVal_782) .cse17 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse13 (store .cse7 |c_~#stored_elements~0.base| (store (select .cse7 |c_~#stored_elements~0.base|) .cse14 |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse1 (select .cse13 |c_~#queue~0.base|))) (let ((.cse4 (+ (select .cse1 .cse3) 1)) (.cse5 (+ (* 4 (select .cse1 .cse6)) |c_~#queue~0.offset|))) (let ((.cse11 (store (store (store (store .cse1 .cse3 .cse4) .cse5 v_subst_7) .cse2 v_ArrVal_790) .cse6 (+ v_subst_4 1)))) (let ((.cse8 (store (select (store .cse13 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| .cse0) (= 400 (select (store (store (store .cse1 .cse2 v_ArrVal_786) .cse3 .cse4) .cse5 v_subst_7) .cse6)) (not (= (select (select (store (store .cse7 |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse9) 0)) (= (let ((.cse10 (select (store (store .cse7 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base|))) (select .cse10 (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|))) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse12))))))))) (forall ((v_ArrVal_786 Int) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (v_subst_6 Int) (v_subst_5 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_ArrVal_795 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse15 .cse16 v_ArrVal_782) .cse17 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse25 (store .cse18 |c_~#stored_elements~0.base| (store (select .cse18 |c_~#stored_elements~0.base|) .cse14 |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse22 (select .cse25 |c_~#queue~0.base|))) (let ((.cse23 (+ (select .cse22 .cse3) 1)) (.cse24 (+ (* 4 (select .cse22 .cse6)) |c_~#queue~0.offset|))) (let ((.cse21 (store (store (store (store .cse22 .cse3 .cse23) .cse24 v_subst_6) .cse2 v_ArrVal_790) .cse6 (+ v_subst_5 1)))) (let ((.cse19 (store (select (store .cse25 |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| .cse0) (not (= (select (select (store (store .cse18 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse9) 1)) (not (= 0 (let ((.cse20 (select (store (store .cse18 |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (select .cse20 (+ (* (select .cse20 .cse3) 4) |c_~#queue~0.offset|))))) (= (select (store (store (store .cse22 .cse2 v_ArrVal_786) .cse3 .cse23) .cse24 v_subst_6) .cse6) 400) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse12))))))))))))) is different from false [2024-04-06 00:39:46,792 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse17 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse15 (let ((.cse26 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (store .cse26 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* (select .cse26 .cse17) 4)) |c_t1Thread1of1ForFork1_enqueue_#in~x#1|)))) (let ((.cse0 (select .cse15 .cse17)) (.cse12 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse6 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse11 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse14 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (.cse16 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|))) (and (forall ((v_ArrVal_786 Int) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (v_subst_6 Int) (v_subst_5 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_ArrVal_795 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse15 .cse16 v_ArrVal_782) .cse17 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse13 (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) .cse14 |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse7 (select .cse13 |c_~#queue~0.base|))) (let ((.cse9 (+ (select .cse7 .cse2) 1)) (.cse10 (+ (* (select .cse7 .cse11) 4) |c_~#queue~0.offset|))) (let ((.cse4 (store (store (store (store .cse7 .cse2 .cse9) .cse10 v_subst_6) .cse8 v_ArrVal_790) .cse11 (+ v_subst_5 1)))) (let ((.cse5 (store (select (store .cse13 |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| .cse0) (not (= (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base|))) (select .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|))) 0)) (not (= (select (select (store (store .cse3 |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse6) 1)) (= 400 (select (store (store (store .cse7 .cse8 v_ArrVal_786) .cse2 .cse9) .cse10 v_subst_6) .cse11)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse12))))))))) (forall ((v_ArrVal_786 Int) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse15 .cse16 v_ArrVal_782) .cse17 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse25 (store .cse22 |c_~#stored_elements~0.base| (store (select .cse22 |c_~#stored_elements~0.base|) .cse14 |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse18 (select .cse25 |c_~#queue~0.base|))) (let ((.cse19 (+ (select .cse18 .cse2) 1)) (.cse20 (+ (* (select .cse18 .cse11) 4) |c_~#queue~0.offset|))) (let ((.cse23 (store (store (store (store .cse18 .cse2 .cse19) .cse20 v_subst_7) .cse8 v_ArrVal_790) .cse11 (+ v_subst_4 1)))) (let ((.cse24 (store (select (store .cse25 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| .cse0) (= 400 (select (store (store (store .cse18 .cse8 v_ArrVal_786) .cse2 .cse19) .cse20 v_subst_7) .cse11)) (= (let ((.cse21 (select (store (store .cse22 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (select .cse21 (+ (* (select .cse21 .cse2) 4) |c_~#queue~0.offset|))) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse12) (not (= (select (select (store (store .cse22 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse6) 0)))))))))))))) is different from false [2024-04-06 00:39:47,506 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset| 4)) (.cse11 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse3 (+ 1600 |c_~#queue~0.offset|)) (.cse14 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse16 (+ (* (select .cse15 .cse6) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_786 Int) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (v_subst_6 Int) (v_subst_5 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_ArrVal_795 (Array Int Int)) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse5 (store .cse15 .cse16 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse13 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse5 .cse8 v_ArrVal_782) .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse12 (store (select .cse13 |c_~#stored_elements~0.base|) .cse14 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse7 (select (store .cse13 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (let ((.cse9 (+ (select .cse7 .cse3) 1)) (.cse10 (+ |c_~#queue~0.offset| (* (select .cse7 .cse6) 4)))) (let ((.cse4 (store (store (store (store .cse7 .cse3 .cse9) .cse10 v_subst_6) .cse8 v_ArrVal_790) .cse6 (+ v_subst_5 1)))) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse1) 1)) (not (= (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|))) (select .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|))) 0)) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse5 .cse6)) (= 400 (select (store (store (store .cse7 .cse8 v_ArrVal_786) .cse3 .cse9) .cse10 v_subst_6) .cse6)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse11)))))))))) (forall ((v_ArrVal_786 Int) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int)) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse20 (store .cse15 .cse16 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse25 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse20 .cse8 v_ArrVal_782) .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse24 (store (select .cse25 |c_~#stored_elements~0.base|) .cse14 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse17 (select (store .cse25 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (let ((.cse18 (+ (select .cse17 .cse3) 1)) (.cse19 (+ |c_~#queue~0.offset| (* (select .cse17 .cse6) 4)))) (let ((.cse23 (store (store (store (store .cse17 .cse3 .cse18) .cse19 v_subst_7) .cse8 v_ArrVal_790) .cse6 (+ v_subst_4 1)))) (let ((.cse21 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (= (select (store (store (store .cse17 .cse8 v_ArrVal_786) .cse3 .cse18) .cse19 v_subst_7) .cse6) 400) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse20 .cse6)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse1) 0)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse11) (= (let ((.cse22 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base|))) (select .cse22 (+ (* (select .cse22 .cse3) 4) |c_~#queue~0.offset|))) 0))))))))))))) is different from false [2024-04-06 00:39:49,653 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse9 (+ |c_~#stored_elements~0.offset| 4)) (.cse7 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse14 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse16 (+ (* (select .cse15 .cse5) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_786 Int) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int)) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse6 (store .cse15 .cse16 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse13 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_782) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse12 (store (select .cse13 |c_~#stored_elements~0.base|) .cse14 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse0 (select (store .cse13 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (let ((.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| (* (select .cse0 .cse5) 4)))) (let ((.cse11 (store (store (store (store .cse0 .cse2 .cse3) .cse4 v_subst_7) .cse1 v_ArrVal_790) .cse5 (+ v_subst_4 1)))) (let ((.cse8 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (= (select (store (store (store .cse0 .cse1 v_ArrVal_786) .cse2 .cse3) .cse4 v_subst_7) .cse5) 400) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse6 .cse5)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse7) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse9) 0)) (= (let ((.cse10 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base|))) (select .cse10 (+ (* (select .cse10 .cse2) 4) |c_~#queue~0.offset|))) 0)))))))))) (forall ((v_ArrVal_786 Int) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (v_subst_6 Int) (v_subst_5 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_ArrVal_795 (Array Int Int)) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse20 (store .cse15 .cse16 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse25 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse20 .cse1 v_ArrVal_782) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse24 (store (select .cse25 |c_~#stored_elements~0.base|) .cse14 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse21 (select (store .cse25 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (let ((.cse22 (+ (select .cse21 .cse2) 1)) (.cse23 (+ |c_~#queue~0.offset| (* (select .cse21 .cse5) 4)))) (let ((.cse18 (store (store (store (store .cse21 .cse2 .cse22) .cse23 v_subst_6) .cse1 v_ArrVal_790) .cse5 (+ v_subst_5 1)))) (let ((.cse19 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (not (= (let ((.cse17 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (select .cse17 (+ (* (select .cse17 .cse2) 4) |c_~#queue~0.offset|))) 0)) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse20 .cse5)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse9) 1)) (= 400 (select (store (store (store .cse21 .cse1 v_ArrVal_786) .cse2 .cse22) .cse23 v_subst_6) .cse5)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse7))))))))))))) is different from false [2024-04-06 00:39:50,517 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#stored_elements~0.offset| 4)) (.cse3 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse7 (+ 1600 |c_~#queue~0.offset|)) (.cse15 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (.cse10 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (v_subst_6 Int) (v_subst_5 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_ArrVal_795 (Array Int Int)) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse4 (let ((.cse16 (select .cse0 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse5) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse14 (store .cse0 |c_~#queue~0.base| (store (store .cse4 .cse10 v_ArrVal_782) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse13 (store (select .cse14 |c_~#stored_elements~0.base|) .cse15 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse9 (select (store .cse14 |c_~#stored_elements~0.base| .cse13) |c_~#queue~0.base|))) (let ((.cse11 (+ (select .cse9 .cse7) 1)) (.cse12 (+ |c_~#queue~0.offset| (* (select .cse9 .cse5) 4)))) (let ((.cse8 (store (store (store (store .cse9 .cse7 .cse11) .cse12 v_subst_6) .cse10 v_ArrVal_790) .cse5 (+ v_subst_5 1)))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| .cse13) |c_~#queue~0.base| .cse8) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse2) 1)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse3) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse4 .cse5)) (not (= (let ((.cse6 (select (store (store .cse0 |c_~#queue~0.base| .cse8) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse6 (+ (* (select .cse6 .cse7) 4) |c_~#queue~0.offset|))) 0)) (= 400 (select (store (store (store .cse9 .cse10 v_ArrVal_786) .cse7 .cse11) .cse12 v_subst_6) .cse5)))))))))))) (forall ((v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int)) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse24 (let ((.cse27 (select .cse18 |c_~#queue~0.base|))) (store .cse27 (+ (* (select .cse27 .cse5) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse26 (store .cse18 |c_~#queue~0.base| (store (store .cse24 .cse10 v_ArrVal_782) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse25 (store (select .cse26 |c_~#stored_elements~0.base|) .cse15 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse21 (select (store .cse26 |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base|))) (let ((.cse22 (+ (select .cse21 .cse7) 1)) (.cse23 (+ |c_~#queue~0.offset| (* (select .cse21 .cse5) 4)))) (let ((.cse19 (store (store (store (store .cse21 .cse7 .cse22) .cse23 v_subst_7) .cse10 v_ArrVal_790) .cse5 (+ v_subst_4 1)))) (let ((.cse20 (store (select (store (store .cse18 |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (= (let ((.cse17 (select (store (store .cse18 |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base|))) (select .cse17 (+ (* (select .cse17 .cse7) 4) |c_~#queue~0.offset|))) 0) (not (= (select (select (store (store .cse18 |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse2) 0)) (= 400 (select (store (store (store .cse21 .cse10 v_ArrVal_786) .cse7 .cse22) .cse23 v_subst_7) .cse5)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse3) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse24 .cse5)))))))))))))) is different from false [2024-04-06 00:39:51,433 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 1600 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#stored_elements~0.offset| 4)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse8 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (v_subst_6 Int) (v_subst_5 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_ArrVal_795 (Array Int Int)) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse9 (let ((.cse14 (select .cse0 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse13 (store .cse0 |c_~#queue~0.base| (store (store .cse9 .cse4 v_ArrVal_782) .cse8 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse12 (store (select .cse13 |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse3 (select (store .cse13 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (let ((.cse6 (+ (select .cse3 .cse5) 1)) (.cse7 (+ (* (select .cse3 .cse8) 4) |c_~#queue~0.offset|))) (let ((.cse11 (store (store (store (store .cse3 .cse5 .cse6) .cse7 v_subst_6) .cse4 v_ArrVal_790) .cse8 (+ v_subst_5 1)))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse2) 1)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (= (select (store (store (store .cse3 .cse4 v_ArrVal_786) .cse5 .cse6) .cse7 v_subst_6) .cse8) 400) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse9 .cse8)) (not (= (let ((.cse10 (select (store (store .cse0 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse5) 4)))) 0)))))))))))) (forall ((v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int)) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse22 (let ((.cse25 (select .cse15 |c_~#queue~0.base|))) (store .cse25 (+ (* (select .cse25 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse24 (store .cse15 |c_~#queue~0.base| (store (store .cse22 .cse4 v_ArrVal_782) .cse8 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse23 (store (select .cse24 |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse19 (select (store .cse24 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base|))) (let ((.cse20 (+ (select .cse19 .cse5) 1)) (.cse21 (+ (* (select .cse19 .cse8) 4) |c_~#queue~0.offset|))) (let ((.cse18 (store (store (store (store .cse19 .cse5 .cse20) .cse21 v_subst_7) .cse4 v_ArrVal_790) .cse8 (+ v_subst_4 1)))) (let ((.cse16 (store (select (store (store .cse15 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (not (= (select (select (store (store .cse15 |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse2) 0)) (= (let ((.cse17 (select (store (store .cse15 |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base|))) (select .cse17 (+ (* (select .cse17 .cse5) 4) |c_~#queue~0.offset|))) 0) (= 400 (select (store (store (store .cse19 .cse4 v_ArrVal_786) .cse5 .cse20) .cse21 v_subst_7) .cse8)) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse22 .cse8)))))))))))))) is different from false [2024-04-06 00:39:54,457 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse8 (+ |c_~#stored_elements~0.offset| 4)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse14 (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse9 (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse5) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse13 (store (store .cse9 .cse1 v_ArrVal_782) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse12 (store (select (store .cse14 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base|) .cse8 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (let ((.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ (* (select .cse0 .cse5) 4) |c_~#queue~0.offset|))) (let ((.cse11 (store (store (store (store .cse0 .cse2 .cse3) .cse4 v_subst_7) .cse1 v_ArrVal_790) .cse5 (+ v_subst_4 1)))) (let ((.cse7 (store (select (store (store .cse6 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (= 400 (select (store (store (store .cse0 .cse1 v_ArrVal_786) .cse2 .cse3) .cse4 v_subst_7) .cse5)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (not (= (select (select (store (store .cse6 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse8) 0)) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse9 .cse5)) (= (let ((.cse10 (select (store (store .cse6 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base|))) (select .cse10 (+ (* 4 (select .cse10 .cse2)) |c_~#queue~0.offset|))) 0))))))))))) (forall ((v_subst_6 Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse26 (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse23 (let ((.cse27 (select .cse26 |c_~#queue~0.base|))) (store .cse27 (+ (* (select .cse27 .cse5) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse25 (store (store .cse23 .cse1 v_ArrVal_782) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse24 (store (select (store .cse26 |c_~#queue~0.base| .cse25) |c_~#stored_elements~0.base|) .cse8 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse18 (select (store (store .cse16 |c_~#queue~0.base| .cse25) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (let ((.cse19 (+ (select .cse18 .cse2) 1)) (.cse20 (+ (* (select .cse18 .cse5) 4) |c_~#queue~0.offset|))) (let ((.cse22 (store (store (store (store .cse18 .cse2 .cse19) .cse20 v_subst_6) .cse1 v_ArrVal_790) .cse5 (+ v_subst_5 1)))) (let ((.cse17 (store (select (store (store .cse16 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (not (= (select (select (store (store .cse16 |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse8) 1)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (= 400 (select (store (store (store .cse18 .cse1 v_ArrVal_786) .cse2 .cse19) .cse20 v_subst_6) .cse5)) (not (= (let ((.cse21 (select (store (store .cse16 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base|))) (select .cse21 (+ (* (select .cse21 .cse2) 4) |c_~#queue~0.offset|))) 0)) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse23 .cse5)))))))))))))) is different from false [2024-04-06 00:39:56,152 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse11 (+ |c_~#stored_elements~0.offset| 4)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#queue~0.offset| 1604)) (.cse15 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (and (forall ((v_subst_6 Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse14 (store (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse10 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse13 (store (store .cse10 .cse6 v_ArrVal_782) .cse9 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse2 (store .cse15 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse12 (store (select (store .cse14 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base|) .cse11 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse5 (select (store (store .cse2 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (let ((.cse7 (+ (select .cse5 .cse1) 1)) (.cse8 (+ (* (select .cse5 .cse9) 4) |c_~#queue~0.offset|))) (let ((.cse3 (store (store (store (store .cse5 .cse1 .cse7) .cse8 v_subst_6) .cse6 v_ArrVal_790) .cse9 (+ v_subst_5 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (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)) (= 400 (select (store (store (store .cse5 .cse6 v_ArrVal_786) .cse1 .cse7) .cse8 v_subst_6) .cse9)) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse10 .cse9)) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse11) 1)))))))))))) (forall ((v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse27 (store (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse17 (let ((.cse28 (select .cse27 |c_~#queue~0.base|))) (store .cse28 (+ (* (select .cse28 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse26 (store (store .cse17 .cse6 v_ArrVal_782) .cse9 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse22 (store .cse15 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse25 (store (select (store .cse27 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base|) .cse11 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse18 (select (store (store .cse22 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base|))) (let ((.cse19 (+ (select .cse18 .cse1) 1)) (.cse20 (+ (* (select .cse18 .cse9) 4) |c_~#queue~0.offset|))) (let ((.cse23 (store (store (store (store .cse18 .cse1 .cse19) .cse20 v_subst_7) .cse6 v_ArrVal_790) .cse9 (+ v_subst_4 1)))) (let ((.cse24 (store (select (store (store .cse22 |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse17 .cse9)) (= 400 (select (store (store (store .cse18 .cse6 v_ArrVal_786) .cse1 .cse19) .cse20 v_subst_7) .cse9)) (= 0 (let ((.cse21 (select (store (store .cse22 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (select .cse21 (+ (* (select .cse21 .cse1) 4) |c_~#queue~0.offset|)))) (not (= (select (select (store (store .cse22 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse11) 0)))))))))))))) is different from false [2024-04-06 00:39:56,492 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse11 (+ |c_~#stored_elements~0.offset| 4)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse15 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))) (and (forall ((v_subst_6 Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse14 (store (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse6 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* 4 (select .cse16 .cse5))) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse13 (store (store .cse6 .cse1 v_ArrVal_782) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse8 (store .cse15 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse12 (store (select (store .cse14 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base|) .cse11 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (let ((.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ (* (select .cse0 .cse5) 4) |c_~#queue~0.offset|))) (let ((.cse9 (store (store (store (store .cse0 .cse2 .cse3) .cse4 v_subst_6) .cse1 v_ArrVal_790) .cse5 (+ v_subst_5 1)))) (let ((.cse10 (store (select (store (store .cse8 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (= (select (store (store (store .cse0 .cse1 v_ArrVal_786) .cse2 .cse3) .cse4 v_subst_6) .cse5) 400) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse6 .cse5)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (not (= (let ((.cse7 (select (store (store .cse8 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base| .cse10) |c_~#queue~0.base|))) (select .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse2) 4)))) 0)) (not (= (select (select (store (store .cse8 |c_~#stored_elements~0.base| .cse10) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse11) 1)))))))))))) (forall ((v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse27 (store (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse20 (let ((.cse28 (select .cse27 |c_~#queue~0.base|))) (store .cse28 (+ |c_~#queue~0.offset| (* 4 (select .cse28 .cse5))) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse26 (store (store .cse20 .cse1 v_ArrVal_782) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse22 (store .cse15 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse25 (store (select (store .cse27 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base|) .cse11 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse17 (select (store (store .cse22 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base|))) (let ((.cse18 (+ (select .cse17 .cse2) 1)) (.cse19 (+ (* (select .cse17 .cse5) 4) |c_~#queue~0.offset|))) (let ((.cse23 (store (store (store (store .cse17 .cse2 .cse18) .cse19 v_subst_7) .cse1 v_ArrVal_790) .cse5 (+ v_subst_4 1)))) (let ((.cse24 (store (select (store (store .cse22 |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (= 400 (select (store (store (store .cse17 .cse1 v_ArrVal_786) .cse2 .cse18) .cse19 v_subst_7) .cse5)) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse20 .cse5)) (= (let ((.cse21 (select (store (store .cse22 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (select .cse21 (+ (* (select .cse21 .cse2) 4) |c_~#queue~0.offset|))) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (not (= (select (select (store (store .cse22 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse11) 0)))))))))))))) is different from false [2024-04-06 00:39:56,759 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1600 |c_~#queue~0.offset|)) (.cse11 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse15 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse29 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse30 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse29 .cse30 (+ (select .cse29 .cse30) 1)))))) (and (forall ((v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse14 (store (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse0 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse13 (store (store .cse0 .cse8 v_ArrVal_782) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse4 (store .cse15 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse12 (store (select (store .cse14 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base|) .cse11 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse7 (select (store (store .cse4 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (let ((.cse9 (+ (select .cse7 .cse3) 1)) (.cse10 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|))) (let ((.cse5 (store (store (store (store .cse7 .cse3 .cse9) .cse10 v_subst_7) .cse8 v_ArrVal_790) .cse1 (+ v_subst_4 1)))) (let ((.cse6 (store (select (store (store .cse4 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse0 .cse1)) (= (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (select .cse2 (+ (* 4 (select .cse2 .cse3)) |c_~#queue~0.offset|))) 0) (= 400 (select (store (store (store .cse7 .cse8 v_ArrVal_786) .cse3 .cse9) .cse10 v_subst_7) .cse1)) (not (= (select (select (store (store .cse4 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse11) 0)))))))))))) (forall ((v_subst_6 Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse27 (store (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse17 (let ((.cse28 (select .cse27 |c_~#queue~0.base|))) (store .cse28 (+ (* (select .cse28 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse26 (store (store .cse17 .cse8 v_ArrVal_782) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse19 (store .cse15 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse25 (store (select (store .cse27 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base|) .cse11 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse22 (select (store (store .cse19 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base|))) (let ((.cse23 (+ (select .cse22 .cse3) 1)) (.cse24 (+ (* (select .cse22 .cse1) 4) |c_~#queue~0.offset|))) (let ((.cse20 (store (store (store (store .cse22 .cse3 .cse23) .cse24 v_subst_6) .cse8 v_ArrVal_790) .cse1 (+ v_subst_5 1)))) (let ((.cse21 (store (select (store (store .cse19 |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse17 .cse1)) (not (= (let ((.cse18 (select (store (store .cse19 |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base|))) (select .cse18 (+ (* (select .cse18 .cse3) 4) |c_~#queue~0.offset|))) 0)) (not (= (select (select (store (store .cse19 |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse11) 1)) (= 400 (select (store (store (store .cse22 .cse8 v_ArrVal_786) .cse3 .cse23) .cse24 v_subst_6) .cse1)))))))))))))) is different from false [2024-04-06 00:39:58,244 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse19 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse10 (+ |c_~#stored_elements~0.offset| 4)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#queue~0.offset| 1604)) (.cse18 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse20 (+ (select .cse17 .cse19) 1))) (and (forall ((v_subst_6 Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_775 Int) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse15 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse17 .cse18 v_ArrVal_775) .cse19 .cse20)))) (let ((.cse14 (store (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse11 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* 4 (select .cse16 .cse9))) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse13 (store (store .cse11 .cse6 v_ArrVal_782) .cse9 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse2 (store .cse15 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse12 (store (select (store .cse14 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base|) .cse10 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse5 (select (store (store .cse2 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (let ((.cse7 (+ (select .cse5 .cse1) 1)) (.cse8 (+ |c_~#queue~0.offset| (* (select .cse5 .cse9) 4)))) (let ((.cse3 (store (store (store (store .cse5 .cse1 .cse7) .cse8 v_subst_6) .cse6 v_ArrVal_790) .cse9 (+ v_subst_5 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (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)) (= (select (store (store (store .cse5 .cse6 v_ArrVal_786) .cse1 .cse7) .cse8 v_subst_6) .cse9) 400) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse10) 1)) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse11 .cse9))))))))))))) (forall ((v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_775 Int) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse32 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse17 .cse18 v_ArrVal_775) .cse19 .cse20)))) (let ((.cse31 (store (store .cse32 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse28 (let ((.cse33 (select .cse31 |c_~#queue~0.base|))) (store .cse33 (+ |c_~#queue~0.offset| (* 4 (select .cse33 .cse9))) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse30 (store (store .cse28 .cse6 v_ArrVal_782) .cse9 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse21 (store .cse32 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse29 (store (select (store .cse31 |c_~#queue~0.base| .cse30) |c_~#stored_elements~0.base|) .cse10 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse23 (select (store (store .cse21 |c_~#queue~0.base| .cse30) |c_~#stored_elements~0.base| .cse29) |c_~#queue~0.base|))) (let ((.cse24 (+ (select .cse23 .cse1) 1)) (.cse25 (+ |c_~#queue~0.offset| (* (select .cse23 .cse9) 4)))) (let ((.cse27 (store (store (store (store .cse23 .cse1 .cse24) .cse25 v_subst_7) .cse6 v_ArrVal_790) .cse9 (+ v_subst_4 1)))) (let ((.cse22 (store (select (store (store .cse21 |c_~#stored_elements~0.base| .cse29) |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (not (= (select (select (store (store .cse21 |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse10) 0)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (= 400 (select (store (store (store .cse23 .cse6 v_ArrVal_786) .cse1 .cse24) .cse25 v_subst_7) .cse9)) (= (let ((.cse26 (select (store (store .cse21 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base|))) (select .cse26 (+ (* (select .cse26 .cse1) 4) |c_~#queue~0.offset|))) 0) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse28 .cse9)))))))))))))))) is different from false [2024-04-06 00:39:59,689 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse8 (+ |c_~#stored_elements~0.offset| 4)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse18 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse19 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse20 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse21 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_subst_6 Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_775 Int) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse15 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse17 (store .cse20 .cse21 |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse17 .cse18 v_ArrVal_775) .cse19 (+ (select .cse17 .cse19) 1)))))) (let ((.cse14 (store (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse11 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse5) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse13 (store (store .cse11 .cse1 v_ArrVal_782) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse6 (store .cse15 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse12 (store (select (store .cse14 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base|) .cse8 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (let ((.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| (* (select .cse0 .cse5) 4)))) (let ((.cse10 (store (store (store (store .cse0 .cse2 .cse3) .cse4 v_subst_6) .cse1 v_ArrVal_790) .cse5 (+ v_subst_5 1)))) (let ((.cse7 (store (select (store (store .cse6 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (= 400 (select (store (store (store .cse0 .cse1 v_ArrVal_786) .cse2 .cse3) .cse4 v_subst_6) .cse5)) (not (= (select (select (store (store .cse6 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse8) 1)) (not (= (let ((.cse9 (select (store (store .cse6 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base|))) (select .cse9 (+ (* (select .cse9 .cse2) 4) |c_~#queue~0.offset|))) 0)) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse11 .cse5))))))))))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_775 Int) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse33 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse35 (store .cse20 .cse21 |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse35 .cse18 v_ArrVal_775) .cse19 (+ (select .cse35 .cse19) 1)))))) (let ((.cse32 (store (store .cse33 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse29 (let ((.cse34 (select .cse32 |c_~#queue~0.base|))) (store .cse34 (+ (* (select .cse34 .cse5) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse31 (store (store .cse29 .cse1 v_ArrVal_782) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse22 (store .cse33 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse30 (store (select (store .cse32 |c_~#queue~0.base| .cse31) |c_~#stored_elements~0.base|) .cse8 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse24 (select (store (store .cse22 |c_~#queue~0.base| .cse31) |c_~#stored_elements~0.base| .cse30) |c_~#queue~0.base|))) (let ((.cse25 (+ (select .cse24 .cse2) 1)) (.cse26 (+ |c_~#queue~0.offset| (* (select .cse24 .cse5) 4)))) (let ((.cse28 (store (store (store (store .cse24 .cse2 .cse25) .cse26 v_subst_7) .cse1 v_ArrVal_790) .cse5 (+ v_subst_4 1)))) (let ((.cse23 (store (select (store (store .cse22 |c_~#stored_elements~0.base| .cse30) |c_~#queue~0.base| .cse28) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (not (= (select (select (store (store .cse22 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse8) 0)) (= (select (store (store (store .cse24 .cse1 v_ArrVal_786) .cse2 .cse25) .cse26 v_subst_7) .cse5) 400) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (= (let ((.cse27 (select (store (store .cse22 |c_~#queue~0.base| .cse28) |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base|))) (select .cse27 (+ (* (select .cse27 .cse2) 4) |c_~#queue~0.offset|))) 0) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse29 .cse5))))))))))))))) is different from false [2024-04-06 00:40:00,082 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse20 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse19 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse7 (+ 1600 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#stored_elements~0.offset| 4)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse18 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse21 (+ (* (select .cse20 .cse19) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_subst_6 Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_775 Int) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse15 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse17 (store .cse20 .cse21 |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse17 .cse18 v_ArrVal_775) .cse19 (+ (select .cse17 .cse19) 1)))))) (let ((.cse14 (store (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse0 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse13 (store (store .cse0 .cse6 v_ArrVal_782) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse2 (store .cse15 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse12 (store (select (store .cse14 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base|) .cse4 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse5 (select (store (store .cse2 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (let ((.cse8 (+ (select .cse5 .cse7) 1)) (.cse9 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)))) (let ((.cse11 (store (store (store (store .cse5 .cse7 .cse8) .cse9 v_subst_6) .cse6 v_ArrVal_790) .cse1 (+ v_subst_5 1)))) (let ((.cse3 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse0 .cse1)) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse4) 1)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (= 400 (select (store (store (store .cse5 .cse6 v_ArrVal_786) .cse7 .cse8) .cse9 v_subst_6) .cse1)) (not (= (let ((.cse10 (select (store (store .cse2 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base|))) (select .cse10 (+ (* (select .cse10 .cse7) 4) |c_~#queue~0.offset|))) 0))))))))))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_775 Int) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse33 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse35 (store .cse20 .cse21 |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse35 .cse18 v_ArrVal_775) .cse19 (+ (select .cse35 .cse19) 1)))))) (let ((.cse32 (store (store .cse33 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse22 (let ((.cse34 (select .cse32 |c_~#queue~0.base|))) (store .cse34 (+ (* (select .cse34 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse31 (store (store .cse22 .cse6 v_ArrVal_782) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse23 (store .cse33 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse30 (store (select (store .cse32 |c_~#queue~0.base| .cse31) |c_~#stored_elements~0.base|) .cse4 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse27 (select (store (store .cse23 |c_~#queue~0.base| .cse31) |c_~#stored_elements~0.base| .cse30) |c_~#queue~0.base|))) (let ((.cse28 (+ (select .cse27 .cse7) 1)) (.cse29 (+ |c_~#queue~0.offset| (* (select .cse27 .cse1) 4)))) (let ((.cse26 (store (store (store (store .cse27 .cse7 .cse28) .cse29 v_subst_7) .cse6 v_ArrVal_790) .cse1 (+ v_subst_4 1)))) (let ((.cse24 (store (select (store (store .cse23 |c_~#stored_elements~0.base| .cse30) |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse22 .cse1)) (not (= (select (select (store (store .cse23 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse4) 0)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (= (let ((.cse25 (select (store (store .cse23 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (select .cse25 (+ (* (select .cse25 .cse7) 4) |c_~#queue~0.offset|))) 0) (= 400 (select (store (store (store .cse27 .cse6 v_ArrVal_786) .cse7 .cse28) .cse29 v_subst_7) .cse1)))))))))))))))) is different from false [2024-04-06 00:40:00,969 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse20 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (.cse19 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse11 (+ |c_~#stored_elements~0.offset| 4)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse18 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse21 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* (select .cse20 .cse19) 4)))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_775 Int) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse15 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse17 (store .cse20 .cse21 |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse17 .cse18 v_ArrVal_775) .cse19 (+ (select .cse17 .cse19) 1)))))) (let ((.cse14 (store (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse0 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse13 (store (store .cse0 .cse3 v_ArrVal_782) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse8 (store .cse15 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse12 (store (select (store .cse14 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base|) .cse11 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse2 (select (store (store .cse8 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (let ((.cse5 (+ (select .cse2 .cse4) 1)) (.cse6 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|))) (let ((.cse9 (store (store (store (store .cse2 .cse4 .cse5) .cse6 v_subst_7) .cse3 v_ArrVal_790) .cse1 (+ v_subst_4 1)))) (let ((.cse10 (store (select (store (store .cse8 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse0 .cse1)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (= 400 (select (store (store (store .cse2 .cse3 v_ArrVal_786) .cse4 .cse5) .cse6 v_subst_7) .cse1)) (= (let ((.cse7 (select (store (store .cse8 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base| .cse10) |c_~#queue~0.base|))) (select .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse4) 4)))) 0) (not (= (select (select (store (store .cse8 |c_~#stored_elements~0.base| .cse10) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse11) 0))))))))))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_subst_6 Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_775 Int) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse33 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse35 (store .cse20 .cse21 |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse35 .cse18 v_ArrVal_775) .cse19 (+ (select .cse35 .cse19) 1)))))) (let ((.cse32 (store (store .cse33 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse22 (let ((.cse34 (select .cse32 |c_~#queue~0.base|))) (store .cse34 (+ (* (select .cse34 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse31 (store (store .cse22 .cse3 v_ArrVal_782) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse23 (store .cse33 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse30 (store (select (store .cse32 |c_~#queue~0.base| .cse31) |c_~#stored_elements~0.base|) .cse11 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse27 (select (store (store .cse23 |c_~#queue~0.base| .cse31) |c_~#stored_elements~0.base| .cse30) |c_~#queue~0.base|))) (let ((.cse28 (+ (select .cse27 .cse4) 1)) (.cse29 (+ (* (select .cse27 .cse1) 4) |c_~#queue~0.offset|))) (let ((.cse26 (store (store (store (store .cse27 .cse4 .cse28) .cse29 v_subst_6) .cse3 v_ArrVal_790) .cse1 (+ v_subst_5 1)))) (let ((.cse24 (store (select (store (store .cse23 |c_~#stored_elements~0.base| .cse30) |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse22 .cse1)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (not (= (select (select (store (store .cse23 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse11) 1)) (not (= (let ((.cse25 (select (store (store .cse23 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (select .cse25 (+ (* (select .cse25 .cse4) 4) |c_~#queue~0.offset|))) 0)) (= 400 (select (store (store (store .cse27 .cse3 v_ArrVal_786) .cse4 .cse28) .cse29 v_subst_6) .cse1)))))))))))))))) is different from false [2024-04-06 00:40:02,137 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#stored_elements~0.offset| 4)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse17 (+ (* (select .cse16 .cse5) 4) |c_~#queue~0.offset|))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_subst_6 Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_775 Int) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse6 (let ((.cse14 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse15 (store .cse16 .cse17 |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse15 .cse1 v_ArrVal_775) .cse5 (+ (select .cse15 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779) |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse5) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse13 (store (store .cse6 .cse1 v_ArrVal_782) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse12 (store (select (store (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779) |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base|) .cse9 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (let ((.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| (* (select .cse0 .cse5) 4)))) (let ((.cse11 (store (store (store (store .cse0 .cse2 .cse3) .cse4 v_subst_6) .cse1 v_ArrVal_790) .cse5 (+ v_subst_5 1)))) (let ((.cse8 (store (select (store (store .cse7 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (= 400 (select (store (store (store .cse0 .cse1 v_ArrVal_786) .cse2 .cse3) .cse4 v_subst_6) .cse5)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse6 .cse5)) (not (= (select (select (store (store .cse7 |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse9) 1)) (not (= (let ((.cse10 (select (store (store .cse7 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base|))) (select .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse2) 4)))) 0))))))))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_775 Int) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse22 (let ((.cse28 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse29 (store .cse16 .cse17 |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse29 .cse1 v_ArrVal_775) .cse5 (+ (select .cse29 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779) |c_~#queue~0.base|))) (store .cse28 (+ (* (select .cse28 .cse5) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse27 (store (store .cse22 .cse1 v_ArrVal_782) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse26 (store (select (store (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779) |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base|) .cse9 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse23 (select (store (store .cse19 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base| .cse26) |c_~#queue~0.base|))) (let ((.cse24 (+ (select .cse23 .cse2) 1)) (.cse25 (+ |c_~#queue~0.offset| (* (select .cse23 .cse5) 4)))) (let ((.cse20 (store (store (store (store .cse23 .cse2 .cse24) .cse25 v_subst_7) .cse1 v_ArrVal_790) .cse5 (+ v_subst_4 1)))) (let ((.cse21 (store (select (store (store .cse19 |c_~#stored_elements~0.base| .cse26) |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (= (let ((.cse18 (select (store (store .cse19 |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base|))) (select .cse18 (+ (* (select .cse18 .cse2) 4) |c_~#queue~0.offset|))) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (not (= 0 (select (select (store (store .cse19 |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse9))) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse22 .cse5)) (= 400 (select (store (store (store .cse23 .cse1 v_ArrVal_786) .cse2 .cse24) .cse25 v_subst_7) .cse5)))))))))))))) is different from false [2024-04-06 00:40:04,087 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse11 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_subst_4 Int) (v_ArrVal_773 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_775 Int) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_773))) (let ((.cse5 (let ((.cse15 (select (store (store (store .cse14 |c_~#queue~0.base| (let ((.cse16 (let ((.cse17 (select .cse14 |c_~#queue~0.base|))) (store .cse17 (+ (* 4 (select .cse17 .cse6)) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)))) (store (store .cse16 .cse8 v_ArrVal_775) .cse6 (+ (select .cse16 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779) |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* 4 (select .cse15 .cse6))) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse13 (store (store .cse5 .cse8 v_ArrVal_782) .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse2 (store .cse14 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse12 (store (select (store (store (store .cse14 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779) |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base|) .cse11 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse7 (select (store (store .cse2 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (let ((.cse9 (+ (select .cse7 .cse1) 1)) (.cse10 (+ |c_~#queue~0.offset| (* 4 (select .cse7 .cse6))))) (let ((.cse3 (store (store (store (store .cse7 .cse1 .cse9) .cse10 v_subst_7) .cse8 v_ArrVal_790) .cse6 (+ v_subst_4 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (= (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base|))) (select .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)))) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse5 .cse6)) (= 400 (select (store (store (store .cse7 .cse8 v_ArrVal_786) .cse1 .cse9) .cse10 v_subst_7) .cse6)) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse11) 0)))))))))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_subst_6 Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_773 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_775 Int) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_773))) (let ((.cse21 (let ((.cse29 (select (store (store (store .cse28 |c_~#queue~0.base| (let ((.cse30 (let ((.cse31 (select .cse28 |c_~#queue~0.base|))) (store .cse31 (+ (* 4 (select .cse31 .cse6)) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)))) (store (store .cse30 .cse8 v_ArrVal_775) .cse6 (+ (select .cse30 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779) |c_~#queue~0.base|))) (store .cse29 (+ |c_~#queue~0.offset| (* 4 (select .cse29 .cse6))) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse27 (store (store .cse21 .cse8 v_ArrVal_782) .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse22 (store .cse28 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse26 (store (select (store (store (store .cse28 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779) |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base|) .cse11 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse18 (select (store (store .cse22 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base| .cse26) |c_~#queue~0.base|))) (let ((.cse19 (+ (select .cse18 .cse1) 1)) (.cse20 (+ |c_~#queue~0.offset| (* 4 (select .cse18 .cse6))))) (let ((.cse25 (store (store (store (store .cse18 .cse1 .cse19) .cse20 v_subst_6) .cse8 v_ArrVal_790) .cse6 (+ v_subst_5 1)))) (let ((.cse23 (store (select (store (store .cse22 |c_~#stored_elements~0.base| .cse26) |c_~#queue~0.base| .cse25) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (= 400 (select (store (store (store .cse18 .cse8 v_ArrVal_786) .cse1 .cse19) .cse20 v_subst_6) .cse6)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse21 .cse6)) (not (= (select (select (store (store .cse22 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse11) 1)) (not (= 0 (let ((.cse24 (select (store (store .cse22 |c_~#queue~0.base| .cse25) |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base|))) (select .cse24 (+ (* (select .cse24 .cse1) 4) |c_~#queue~0.offset|))))))))))))))))) is different from false [2024-04-06 00:40:09,059 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 1600 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#stored_elements~0.offset| 4)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse18 (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|)) (.cse19 (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_subst_6 Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_773 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_775 Int) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store .cse18 .cse19 v_ArrVal_772)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_773))) (let ((.cse3 (let ((.cse15 (select (store (store (store .cse14 |c_~#queue~0.base| (let ((.cse16 (let ((.cse17 (select .cse14 |c_~#queue~0.base|))) (store .cse17 (+ |c_~#queue~0.offset| (* 4 (select .cse17 .cse4))) |t1Thread1of1ForFork1_enqueue_~x#1|)))) (store (store .cse16 .cse6 v_ArrVal_775) .cse4 (+ (select .cse16 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779) |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse4) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse13 (store (store .cse3 .cse6 v_ArrVal_782) .cse4 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse0 (store .cse14 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse12 (store (select (store (store (store .cse14 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779) |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse5 (select (store (store .cse0 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (let ((.cse8 (+ (select .cse5 .cse7) 1)) (.cse9 (+ (* (select .cse5 .cse4) 4) |c_~#queue~0.offset|))) (let ((.cse11 (store (store (store (store .cse5 .cse7 .cse8) .cse9 v_subst_6) .cse6 v_ArrVal_790) .cse4 (+ v_subst_5 1)))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse2) 1)) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse3 .cse4)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (= 400 (select (store (store (store .cse5 .cse6 v_ArrVal_786) .cse7 .cse8) .cse9 v_subst_6) .cse4)) (not (= (let ((.cse10 (select (store (store .cse0 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse10 (+ (* (select .cse10 .cse7) 4) |c_~#queue~0.offset|))) 0)))))))))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_subst_4 Int) (v_ArrVal_773 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_775 Int) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse30 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store .cse18 .cse19 v_ArrVal_772)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_773))) (let ((.cse20 (let ((.cse31 (select (store (store (store .cse30 |c_~#queue~0.base| (let ((.cse32 (let ((.cse33 (select .cse30 |c_~#queue~0.base|))) (store .cse33 (+ |c_~#queue~0.offset| (* 4 (select .cse33 .cse4))) |t1Thread1of1ForFork1_enqueue_~x#1|)))) (store (store .cse32 .cse6 v_ArrVal_775) .cse4 (+ (select .cse32 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779) |c_~#queue~0.base|))) (store .cse31 (+ (* (select .cse31 .cse4) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse29 (store (store .cse20 .cse6 v_ArrVal_782) .cse4 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse22 (store .cse30 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse28 (store (select (store (store (store .cse30 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779) |c_~#queue~0.base| .cse29) |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse25 (select (store (store .cse22 |c_~#queue~0.base| .cse29) |c_~#stored_elements~0.base| .cse28) |c_~#queue~0.base|))) (let ((.cse26 (+ (select .cse25 .cse7) 1)) (.cse27 (+ (* (select .cse25 .cse4) 4) |c_~#queue~0.offset|))) (let ((.cse23 (store (store (store (store .cse25 .cse7 .cse26) .cse27 v_subst_7) .cse6 v_ArrVal_790) .cse4 (+ v_subst_4 1)))) (let ((.cse24 (store (select (store (store .cse22 |c_~#stored_elements~0.base| .cse28) |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse20 .cse4)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (= (let ((.cse21 (select (store (store .cse22 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (select .cse21 (+ (* (select .cse21 .cse7) 4) |c_~#queue~0.offset|))) 0) (not (= (select (select (store (store .cse22 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse2) 0)) (= 400 (select (store (store (store .cse25 .cse6 v_ArrVal_786) .cse7 .cse26) .cse27 v_subst_7) .cse4)))))))))))))) is different from false [2024-04-06 00:40:09,799 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse11 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 1604)) (.cse18 (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ |c_ULTIMATE.start_init_~q#1.offset| 1604) 0)) (.cse19 (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_subst_6 Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_773 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_775 Int) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store .cse18 .cse19 v_ArrVal_772)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_773))) (let ((.cse5 (let ((.cse15 (select (store (store (store .cse14 |c_~#queue~0.base| (let ((.cse16 (let ((.cse17 (select .cse14 |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse6) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)))) (store (store .cse16 .cse8 v_ArrVal_775) .cse6 (+ (select .cse16 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779) |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse6) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse13 (store (store .cse5 .cse8 v_ArrVal_782) .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse2 (store .cse14 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse12 (store (select (store (store (store .cse14 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779) |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base|) .cse11 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse7 (select (store (store .cse2 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (let ((.cse9 (+ (select .cse7 .cse1) 1)) (.cse10 (+ (* (select .cse7 .cse6) 4) |c_~#queue~0.offset|))) (let ((.cse3 (store (store (store (store .cse7 .cse1 .cse9) .cse10 v_subst_6) .cse8 v_ArrVal_790) .cse6 (+ v_subst_5 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (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| (* 4 (select .cse0 .cse1))))) 0)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse5 .cse6)) (= 400 (select (store (store (store .cse7 .cse8 v_ArrVal_786) .cse1 .cse9) .cse10 v_subst_6) .cse6)) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse11) 1)))))))))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_subst_4 Int) (v_ArrVal_773 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_775 Int) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse30 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store .cse18 .cse19 v_ArrVal_772)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_773))) (let ((.cse20 (let ((.cse31 (select (store (store (store .cse30 |c_~#queue~0.base| (let ((.cse32 (let ((.cse33 (select .cse30 |c_~#queue~0.base|))) (store .cse33 (+ (* (select .cse33 .cse6) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)))) (store (store .cse32 .cse8 v_ArrVal_775) .cse6 (+ (select .cse32 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779) |c_~#queue~0.base|))) (store .cse31 (+ (* (select .cse31 .cse6) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse29 (store (store .cse20 .cse8 v_ArrVal_782) .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse21 (store .cse30 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse28 (store (select (store (store (store .cse30 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779) |c_~#queue~0.base| .cse29) |c_~#stored_elements~0.base|) .cse11 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse25 (select (store (store .cse21 |c_~#queue~0.base| .cse29) |c_~#stored_elements~0.base| .cse28) |c_~#queue~0.base|))) (let ((.cse26 (+ (select .cse25 .cse1) 1)) (.cse27 (+ (* (select .cse25 .cse6) 4) |c_~#queue~0.offset|))) (let ((.cse24 (store (store (store (store .cse25 .cse1 .cse26) .cse27 v_subst_7) .cse8 v_ArrVal_790) .cse6 (+ v_subst_4 1)))) (let ((.cse22 (store (select (store (store .cse21 |c_~#stored_elements~0.base| .cse28) |c_~#queue~0.base| .cse24) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse20 .cse6)) (not (= (select (select (store (store .cse21 |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse11) 0)) (= (let ((.cse23 (select (store (store .cse21 |c_~#queue~0.base| .cse24) |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base|))) (select .cse23 (+ (* (select .cse23 .cse1) 4) |c_~#queue~0.offset|))) 0) (= 400 (select (store (store (store .cse25 .cse8 v_ArrVal_786) .cse1 .cse26) .cse27 v_subst_7) .cse6)))))))))))))) is different from false [2024-04-06 00:40:10,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-06 00:40:10,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 16561 treesize of output 7691 [2024-04-06 00:40:10,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-06 00:40:10,343 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 79589 treesize of output 77985 [2024-04-06 00:40:11,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-06 00:40:11,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 1019406146 treesize of output 883889260 Received shutdown request... [2024-04-06 00:50:10,026 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/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-04-06 00:50:10,026 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/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-04-06 00:50:10,026 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/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-04-06 00:50:10,071 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-04-06 00:50:10,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-04-06 00:50:10,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 00:50:10,280 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 293 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-25-2-2-2-2-2-2-2-2-3-3-3-3-2-3-4-4-4-4-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-4-4-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-69-3-2-5-2-5-4-8-4-9-4-9-4-9-4-9-4-7-3-5-3-5-3-3-3-3-3-3-3-3-2-3-3-3-2-3-4-4-2-3-4-4-2-3-4-4-2-2-2-3-2-2-2-2-1 context. [2024-04-06 00:50:10,282 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-04-06 00:50:10,282 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-04-06 00:50:10,282 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-04-06 00:50:10,282 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2024-04-06 00:50:10,282 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2024-04-06 00:50:10,282 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-04-06 00:50:10,286 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-04-06 00:50:10,290 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-04-06 00:50:10,290 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-04-06 00:50:10,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 12:50:10 BasicIcfg [2024-04-06 00:50:10,293 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-04-06 00:50:10,293 INFO L158 Benchmark]: Toolchain (without parser) took 842149.82ms. Allocated memory was 371.2MB in the beginning and 1.3GB in the end (delta: 946.9MB). Free memory was 301.0MB in the beginning and 1.2GB in the end (delta: -924.5MB). Peak memory consumption was 816.6MB. Max. memory is 8.0GB. [2024-04-06 00:50:10,293 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 187.7MB. Free memory is still 153.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-06 00:50:10,293 INFO L158 Benchmark]: CACSL2BoogieTranslator took 535.98ms. Allocated memory is still 371.2MB. Free memory was 300.7MB in the beginning and 320.8MB in the end (delta: -20.0MB). Peak memory consumption was 16.9MB. Max. memory is 8.0GB. [2024-04-06 00:50:10,293 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.86ms. Allocated memory is still 371.2MB. Free memory was 320.8MB in the beginning and 317.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-04-06 00:50:10,294 INFO L158 Benchmark]: Boogie Preprocessor took 49.80ms. Allocated memory is still 371.2MB. Free memory was 317.6MB in the beginning and 315.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-04-06 00:50:10,294 INFO L158 Benchmark]: RCFGBuilder took 490.73ms. Allocated memory is still 371.2MB. Free memory was 315.0MB in the beginning and 289.3MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2024-04-06 00:50:10,294 INFO L158 Benchmark]: TraceAbstraction took 840996.04ms. Allocated memory was 371.2MB in the beginning and 1.3GB in the end (delta: 946.9MB). Free memory was 288.3MB in the beginning and 1.2GB in the end (delta: -937.3MB). Peak memory consumption was 802.8MB. Max. memory is 8.0GB. [2024-04-06 00:50:10,295 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.09ms. Allocated memory is still 187.7MB. Free memory is still 153.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 535.98ms. Allocated memory is still 371.2MB. Free memory was 300.7MB in the beginning and 320.8MB in the end (delta: -20.0MB). Peak memory consumption was 16.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.86ms. Allocated memory is still 371.2MB. Free memory was 320.8MB in the beginning and 317.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.80ms. Allocated memory is still 371.2MB. Free memory was 317.6MB in the beginning and 315.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 490.73ms. Allocated memory is still 371.2MB. Free memory was 315.0MB in the beginning and 289.3MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 840996.04ms. Allocated memory was 371.2MB in the beginning and 1.3GB in the end (delta: 946.9MB). Free memory was 288.3MB in the beginning and 1.2GB in the end (delta: -937.3MB). Peak memory consumption was 802.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8005, independent: 6444, independent conditional: 6380, independent unconditional: 64, dependent: 1561, dependent conditional: 1553, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6444, independent: 6444, independent conditional: 6380, independent unconditional: 64, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6444, independent: 6444, independent conditional: 6380, independent unconditional: 64, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6444, independent: 6444, independent conditional: 6380, independent unconditional: 64, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6444, independent: 6444, independent conditional: 2004, independent unconditional: 4440, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6444, independent: 6444, independent conditional: 704, independent unconditional: 5740, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6444, independent: 6444, independent conditional: 704, independent unconditional: 5740, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 339, independent: 339, independent conditional: 10, independent unconditional: 329, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 339, independent: 339, independent conditional: 0, independent unconditional: 339, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6444, independent: 6105, independent conditional: 694, independent unconditional: 5411, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 339, unknown conditional: 10, unknown unconditional: 329] , Statistics on independence cache: Total cache size (in pairs): 339, Positive cache size: 339, Positive conditional cache size: 10, Positive unconditional cache size: 329, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1300, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6444, independent: 6444, independent conditional: 2004, independent unconditional: 4440, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6444, independent: 6444, independent conditional: 704, independent unconditional: 5740, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6444, independent: 6444, independent conditional: 704, independent unconditional: 5740, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 339, independent: 339, independent conditional: 10, independent unconditional: 329, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 339, independent: 339, independent conditional: 0, independent unconditional: 339, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6444, independent: 6105, independent conditional: 694, independent unconditional: 5411, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 339, unknown conditional: 10, unknown unconditional: 329] , Statistics on independence cache: Total cache size (in pairs): 339, Positive cache size: 339, Positive conditional cache size: 10, Positive unconditional cache size: 329, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1300 ], Independence queries for same thread: 1561 - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 293 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-25-2-2-2-2-2-2-2-2-3-3-3-3-2-3-4-4-4-4-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-4-4-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-69-3-2-5-2-5-4-8-4-9-4-9-4-9-4-9-4-7-3-5-3-5-3-3-3-3-3-3-3-3-2-3-3-3-2-3-4-4-2-3-4-4-2-3-4-4-2-2-2-3-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1059]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 293 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-25-2-2-2-2-2-2-2-2-3-3-3-3-2-3-4-4-4-4-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-4-4-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-69-3-2-5-2-5-4-8-4-9-4-9-4-9-4-9-4-7-3-5-3-5-3-3-3-3-3-3-3-3-2-3-3-3-2-3-4-4-2-3-4-4-2-3-4-4-2-2-2-3-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1063]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 293 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-25-2-2-2-2-2-2-2-2-3-3-3-3-2-3-4-4-4-4-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-4-4-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-69-3-2-5-2-5-4-8-4-9-4-9-4-9-4-9-4-7-3-5-3-5-3-3-3-3-3-3-3-3-2-3-3-3-2-3-4-4-2-3-4-4-2-3-4-4-2-2-2-3-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1062]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 293 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-25-2-2-2-2-2-2-2-2-3-3-3-3-2-3-4-4-4-4-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-4-4-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-69-3-2-5-2-5-4-8-4-9-4-9-4-9-4-9-4-7-3-5-3-5-3-3-3-3-3-3-3-3-2-3-3-3-2-3-4-4-2-3-4-4-2-3-4-4-2-2-2-3-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1032]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 293 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-25-2-2-2-2-2-2-2-2-3-3-3-3-2-3-4-4-4-4-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-4-4-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-69-3-2-5-2-5-4-8-4-9-4-9-4-9-4-9-4-7-3-5-3-5-3-3-3-3-3-3-3-3-2-3-3-3-2-3-4-4-2-3-4-4-2-3-4-4-2-2-2-3-2-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 433 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 840.8s, OverallIterations: 12, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 33.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: 341, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 61.8s InterpolantComputationTime, 2430 NumberOfCodeBlocks, 2430 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2987 ConstructedInterpolants, 424 QuantifiedInterpolants, 130952 SizeOfPredicates, 106 NumberOfNonLiveVariables, 1273 ConjunctsInSsa, 245 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 147/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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown