/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 NONE -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-03 17:48:45,826 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-03 17:48:45,892 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-03 17:48:45,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-03 17:48:45,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-03 17:48:45,918 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-03 17:48:45,918 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-03 17:48:45,919 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-03 17:48:45,919 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-03 17:48:45,952 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-03 17:48:45,953 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-03 17:48:45,953 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-03 17:48:45,953 INFO L153 SettingsManager]: * Use SBE=true [2024-04-03 17:48:45,953 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-03 17:48:45,953 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-03 17:48:45,954 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-03 17:48:45,954 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-03 17:48:45,954 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-03 17:48:45,954 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-03 17:48:45,954 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-03 17:48:45,954 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-03 17:48:45,955 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-03 17:48:45,955 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-03 17:48:45,955 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-03 17:48:45,955 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-03 17:48:45,956 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-03 17:48:45,956 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-03 17:48:45,956 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-03 17:48:45,956 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-03 17:48:45,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-03 17:48:45,957 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-03 17:48:45,957 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-03 17:48:45,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-03 17:48:45,957 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-03 17:48:45,957 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-03 17:48:45,957 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-03 17:48:45,957 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-03 17:48:45,958 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-03 17:48:45,958 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-03 17:48:45,958 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 -> NONE [2024-04-03 17:48:46,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-03 17:48:46,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-03 17:48:46,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-03 17:48:46,186 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-03 17:48:46,187 INFO L274 PluginConnector]: CDTParser initialized [2024-04-03 17:48:46,188 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/queue.i [2024-04-03 17:48:47,247 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-03 17:48:47,468 INFO L384 CDTParser]: Found 1 translation units. [2024-04-03 17:48:47,468 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i [2024-04-03 17:48:47,489 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3b54a4598/7400f8c2a0bc4e0d83b0f72fcacf8568/FLAG80987bf40 [2024-04-03 17:48:47,500 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3b54a4598/7400f8c2a0bc4e0d83b0f72fcacf8568 [2024-04-03 17:48:47,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-03 17:48:47,503 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-03 17:48:47,504 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-03 17:48:47,504 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-03 17:48:47,514 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-03 17:48:47,514 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.04 05:48:47" (1/1) ... [2024-04-03 17:48:47,515 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a38b314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 05:48:47, skipping insertion in model container [2024-04-03 17:48:47,515 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.04 05:48:47" (1/1) ... [2024-04-03 17:48:47,568 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-03 17:48:47,903 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.i[43284,43297] [2024-04-03 17:48:47,909 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.i[43491,43504] [2024-04-03 17:48:47,915 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.i[43772,43785] [2024-04-03 17:48:47,922 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-03 17:48:47,931 INFO L202 MainTranslator]: Completed pre-run [2024-04-03 17:48:47,967 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.i[43284,43297] [2024-04-03 17:48:47,968 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.i[43491,43504] [2024-04-03 17:48:47,970 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.i[43772,43785] [2024-04-03 17:48:47,971 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-03 17:48:48,022 INFO L206 MainTranslator]: Completed translation [2024-04-03 17:48:48,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 05:48:48 WrapperNode [2024-04-03 17:48:48,023 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-03 17:48:48,024 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-03 17:48:48,024 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-03 17:48:48,024 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-03 17:48:48,029 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 05:48:48" (1/1) ... [2024-04-03 17:48:48,059 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 05:48:48" (1/1) ... [2024-04-03 17:48:48,080 INFO L138 Inliner]: procedures = 275, calls = 71, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 260 [2024-04-03 17:48:48,081 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-03 17:48:48,081 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-03 17:48:48,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-03 17:48:48,082 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-03 17:48:48,088 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 05:48:48" (1/1) ... [2024-04-03 17:48:48,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 05:48:48" (1/1) ... [2024-04-03 17:48:48,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 05:48:48" (1/1) ... [2024-04-03 17:48:48,092 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 05:48:48" (1/1) ... [2024-04-03 17:48:48,107 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 05:48:48" (1/1) ... [2024-04-03 17:48:48,110 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 05:48:48" (1/1) ... [2024-04-03 17:48:48,112 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 05:48:48" (1/1) ... [2024-04-03 17:48:48,113 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 05:48:48" (1/1) ... [2024-04-03 17:48:48,115 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-03 17:48:48,116 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-03 17:48:48,116 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-03 17:48:48,116 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-03 17:48:48,117 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 05:48:48" (1/1) ... [2024-04-03 17:48:48,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-03 17:48:48,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-03 17:48:48,179 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-03 17:48:48,196 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-03 17:48:48,222 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-04-03 17:48:48,223 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-04-03 17:48:48,223 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-04-03 17:48:48,223 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-04-03 17:48:48,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-03 17:48:48,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-03 17:48:48,225 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-04-03 17:48:48,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-03 17:48:48,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-03 17:48:48,225 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-04-03 17:48:48,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-03 17:48:48,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-03 17:48:48,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-03 17:48:48,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-03 17:48:48,227 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-03 17:48:48,329 INFO L241 CfgBuilder]: Building ICFG [2024-04-03 17:48:48,331 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-03 17:48:48,566 INFO L282 CfgBuilder]: Performing block encoding [2024-04-03 17:48:48,584 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-03 17:48:48,584 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2024-04-03 17:48:48,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.04 05:48:48 BoogieIcfgContainer [2024-04-03 17:48:48,585 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-03 17:48:48,587 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-03 17:48:48,587 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-03 17:48:48,589 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-03 17:48:48,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.04 05:48:47" (1/3) ... [2024-04-03 17:48:48,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1efc950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.04 05:48:48, skipping insertion in model container [2024-04-03 17:48:48,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 05:48:48" (2/3) ... [2024-04-03 17:48:48,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1efc950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.04 05:48:48, skipping insertion in model container [2024-04-03 17:48:48,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.04 05:48:48" (3/3) ... [2024-04-03 17:48:48,591 INFO L112 eAbstractionObserver]: Analyzing ICFG queue.i [2024-04-03 17:48:48,597 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-03 17:48:48,604 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-03 17:48:48,605 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-04-03 17:48:48,605 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-03 17:48:48,686 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-04-03 17:48:48,734 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-03 17:48:48,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-03 17:48:48,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-03 17:48:48,737 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-03 17:48:48,754 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-03 17:48:48,774 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-03 17:48:48,786 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-03 17:48:48,795 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;@265ae9e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=NONE, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-03 17:48:48,795 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-04-03 17:48:48,826 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-03 17:48:48,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 17:48:48,830 INFO L85 PathProgramCache]: Analyzing trace with hash -913897265, now seen corresponding path program 1 times [2024-04-03 17:48:48,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 17:48:48,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575976326] [2024-04-03 17:48:48,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 17:48:48,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 17:48:49,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 17:48:49,108 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-03 17:48:49,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 17:48:49,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575976326] [2024-04-03 17:48:49,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575976326] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-03 17:48:49,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-03 17:48:49,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-03 17:48:49,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023211638] [2024-04-03 17:48:49,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-03 17:48:49,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-03 17:48:49,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 17:48:49,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-03 17:48:49,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-03 17:48:49,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:48:49,138 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 17:48:49,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 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-03 17:48:49,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:48:49,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:48:49,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-03 17:48:49,197 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-03 17:48:49,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 17:48:49,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1904192145, now seen corresponding path program 1 times [2024-04-03 17:48:49,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 17:48:49,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132592811] [2024-04-03 17:48:49,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 17:48:49,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 17:48:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 17:48:49,372 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-03 17:48:49,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 17:48:49,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132592811] [2024-04-03 17:48:49,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132592811] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-03 17:48:49,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-03 17:48:49,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-04-03 17:48:49,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574023352] [2024-04-03 17:48:49,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-03 17:48:49,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-03 17:48:49,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 17:48:49,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-03 17:48:49,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-03 17:48:49,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:48:49,375 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 17:48:49,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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-03 17:48:49,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:48:49,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:48:49,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:48:49,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-03 17:48:49,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-04-03 17:48:49,417 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-03 17:48:49,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 17:48:49,417 INFO L85 PathProgramCache]: Analyzing trace with hash 2091448484, now seen corresponding path program 1 times [2024-04-03 17:48:49,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 17:48:49,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365263320] [2024-04-03 17:48:49,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 17:48:49,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 17:48:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 17:48:50,662 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-03 17:48:50,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 17:48:50,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365263320] [2024-04-03 17:48:50,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365263320] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-03 17:48:50,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-03 17:48:50,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-04-03 17:48:50,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20520793] [2024-04-03 17:48:50,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-03 17:48:50,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-04-03 17:48:50,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 17:48:50,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-04-03 17:48:50,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-04-03 17:48:50,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:48:50,670 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 17:48:50,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.3125) internal successors, (117), 16 states have internal predecessors, (117), 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-03 17:48:50,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:48:50,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-03 17:48:50,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:48:51,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:48:51,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-03 17:48:51,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-03 17:48:51,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-04-03 17:48:51,151 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-03 17:48:51,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 17:48:51,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2039233399, now seen corresponding path program 1 times [2024-04-03 17:48:51,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 17:48:51,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887223431] [2024-04-03 17:48:51,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 17:48:51,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 17:48:51,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 17:48:52,775 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-03 17:48:52,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 17:48:52,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887223431] [2024-04-03 17:48:52,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887223431] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-03 17:48:52,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-03 17:48:52,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2024-04-03 17:48:52,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238950450] [2024-04-03 17:48:52,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-03 17:48:52,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-04-03 17:48:52,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 17:48:52,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-04-03 17:48:52,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2024-04-03 17:48:52,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:48:52,778 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 17:48:52,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.321428571428571) internal successors, (121), 28 states have internal predecessors, (121), 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-03 17:48:52,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:48:52,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-03 17:48:52,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-03 17:48:52,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:48:53,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:48:53,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-03 17:48:53,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-03 17:48:53,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-04-03 17:48:53,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-04-03 17:48:53,864 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-03 17:48:53,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 17:48:53,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1841237711, now seen corresponding path program 1 times [2024-04-03 17:48:53,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 17:48:53,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683950254] [2024-04-03 17:48:53,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 17:48:53,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 17:48:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 17:48:53,913 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-03 17:48:53,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 17:48:53,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683950254] [2024-04-03 17:48:53,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683950254] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-03 17:48:53,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-03 17:48:53,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-04-03 17:48:53,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904544429] [2024-04-03 17:48:53,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-03 17:48:53,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-03 17:48:53,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 17:48:53,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-03 17:48:53,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-03 17:48:53,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:48:53,915 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 17:48:53,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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-03 17:48:53,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:48:53,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-03 17:48:53,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-03 17:48:53,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-04-03 17:48:53,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:48:54,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:48:54,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-03 17:48:54,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-03 17:48:54,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-04-03 17:48:54,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-03 17:48:54,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-04-03 17:48:54,270 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-03 17:48:54,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 17:48:54,270 INFO L85 PathProgramCache]: Analyzing trace with hash 599295464, now seen corresponding path program 1 times [2024-04-03 17:48:54,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 17:48:54,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169603675] [2024-04-03 17:48:54,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 17:48:54,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 17:48:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 17:48:58,270 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-03 17:48:58,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 17:48:58,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169603675] [2024-04-03 17:48:58,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169603675] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-03 17:48:58,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-03 17:48:58,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2024-04-03 17:48:58,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523391801] [2024-04-03 17:48:58,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-03 17:48:58,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-04-03 17:48:58,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 17:48:58,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-04-03 17:48:58,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1160, Unknown=0, NotChecked=0, Total=1332 [2024-04-03 17:48:58,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:48:58,277 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 17:48:58,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 5.5675675675675675) internal successors, (206), 37 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-03 17:48:58,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:48:58,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-03 17:48:58,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-03 17:48:58,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-04-03 17:48:58,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-03 17:48:58,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:49:00,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:49:00,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-03 17:49:00,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-03 17:49:00,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-04-03 17:49:00,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-03 17:49:00,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-04-03 17:49:00,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-04-03 17:49:00,307 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-03 17:49:00,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 17:49:00,307 INFO L85 PathProgramCache]: Analyzing trace with hash 2043449997, now seen corresponding path program 1 times [2024-04-03 17:49:00,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 17:49:00,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004347450] [2024-04-03 17:49:00,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 17:49:00,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 17:49:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 17:49:02,201 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-03 17:49:02,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 17:49:02,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004347450] [2024-04-03 17:49:02,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004347450] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-03 17:49:02,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-03 17:49:02,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2024-04-03 17:49:02,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218359330] [2024-04-03 17:49:02,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-03 17:49:02,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-04-03 17:49:02,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 17:49:02,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-04-03 17:49:02,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2024-04-03 17:49:02,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:49:02,203 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 17:49:02,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.0) internal successors, (210), 30 states have internal predecessors, (210), 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-03 17:49:02,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:49:02,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-03 17:49:02,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-03 17:49:02,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-04-03 17:49:02,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-03 17:49:02,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-04-03 17:49:02,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:49:03,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:49:03,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-03 17:49:03,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-03 17:49:03,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-04-03 17:49:03,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-03 17:49:03,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-04-03 17:49:03,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-04-03 17:49:03,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-04-03 17:49:03,536 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-03 17:49:03,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 17:49:03,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1621429240, now seen corresponding path program 1 times [2024-04-03 17:49:03,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 17:49:03,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423687698] [2024-04-03 17:49:03,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 17:49:03,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 17:49:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 17:49:12,186 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-03 17:49:12,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 17:49:12,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423687698] [2024-04-03 17:49:12,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423687698] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-03 17:49:12,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-03 17:49:12,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2024-04-03 17:49:12,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278486292] [2024-04-03 17:49:12,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-03 17:49:12,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-04-03 17:49:12,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 17:49:12,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-04-03 17:49:12,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2486, Unknown=0, NotChecked=0, Total=2652 [2024-04-03 17:49:12,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:49:12,190 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 17:49:12,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 4.115384615384615) internal successors, (214), 52 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-03 17:49:12,190 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:49:12,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-03 17:49:12,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-03 17:49:12,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-04-03 17:49:12,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-03 17:49:12,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-04-03 17:49:12,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-04-03 17:49:12,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:49:18,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:49:18,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-03 17:49:18,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-03 17:49:18,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-04-03 17:49:18,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-03 17:49:18,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-04-03 17:49:18,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-04-03 17:49:18,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-04-03 17:49:18,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-04-03 17:49:18,838 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-03 17:49:18,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 17:49:18,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1713389082, now seen corresponding path program 1 times [2024-04-03 17:49:18,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 17:49:18,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230252527] [2024-04-03 17:49:18,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 17:49:18,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 17:49:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 17:49:21,919 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-03 17:49:21,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 17:49:21,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230252527] [2024-04-03 17:49:21,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230252527] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-03 17:49:21,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844769724] [2024-04-03 17:49:21,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 17:49:21,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-03 17:49:21,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-03 17:49:21,973 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-03 17:49:21,975 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-03 17:49:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 17:49:22,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 105 conjunts are in the unsatisfiable core [2024-04-03 17:49:22,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-03 17:49:22,390 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-03 17:49:22,391 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-03 17:49:22,441 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-03 17:49:22,441 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-03 17:49:22,644 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 15 treesize of output 1 [2024-04-03 17:49:22,713 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-03 17:49:22,941 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-03 17:49:23,261 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-04-03 17:49:23,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 14 [2024-04-03 17:49:23,308 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-03 17:49:23,468 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 36 treesize of output 13 [2024-04-03 17:49:23,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-03 17:49:23,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-03 17:49:23,755 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-03 17:49:24,012 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-04-03 17:49:24,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 14 [2024-04-03 17:49:24,056 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-03 17:49:24,231 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 25 treesize of output 13 [2024-04-03 17:49:24,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-03 17:49:24,297 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-03 17:49:24,503 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-03 17:49:24,553 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-03 17:49:24,747 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-04-03 17:49:24,747 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2024-04-03 17:49:24,764 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-03 17:49:24,775 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-03 17:49:24,803 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-03 17:49:24,804 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-03 17:49:25,362 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_412 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_412) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) is different from false [2024-04-03 17:49:30,195 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_409 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_412 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_407))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (select .cse1 .cse2))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 (+ 88 |c_~#queue~0.offset|) v_ArrVal_409) .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_412) |c_~#queue~0.base|) .cse2) 20) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) (= .cse3 20))))))) is different from false [2024-04-03 17:49:30,740 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_406 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_405 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_412 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_405)))) (let ((.cse0 (select (store (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_406) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_407) |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) (< (select (select (store (store (store .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_407) |c_~#queue~0.base| (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_409) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_412) |c_~#queue~0.base|) .cse1) 20) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_405) (= .cse4 20))))))) is different from false [2024-04-03 17:49:30,756 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_406 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_405 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_412 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_405)))) (let ((.cse0 (select (store (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_406) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_407) |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) (< (select (select (store (store (store .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_407) |c_~#queue~0.base| (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_409) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_412) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse5 .cse6) 1) v_ArrVal_405) (= .cse4 20)))))))) is different from false [2024-04-03 17:49:31,388 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_401 Int) (v_ArrVal_407 (Array Int Int)) (v_ArrVal_406 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_409 Int) (v_ArrVal_405 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_412 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_401)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 v_ArrVal_405)))) (let ((.cse6 (select (store (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_406) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_407) |c_~#queue~0.base|))) (let ((.cse4 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse4 .cse5))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_405) (= .cse2 20) (< (select (select (store (store (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_407) |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_409) .cse5 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_412) |c_~#queue~0.base|) .cse5) 20) (< (select .cse6 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|)))))))) is different from false [2024-04-03 17:49:54,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-03 17:49:54,819 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 423 treesize of output 278 [2024-04-03 17:49:54,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-03 17:49:54,840 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 773 treesize of output 771 [2024-04-03 17:49:54,857 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 580 treesize of output 540 [2024-04-03 17:49:54,874 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 218 treesize of output 210 [2024-04-03 17:49:54,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 179 treesize of output 163 [2024-04-03 17:49:54,903 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 340 treesize of output 324 [2024-04-03 17:49:54,942 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 7 treesize of output 3 [2024-04-03 17:49:55,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-03 17:49:55,379 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 273 treesize of output 269 [2024-04-03 17:49:56,181 INFO L349 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2024-04-03 17:49:56,181 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-03 17:49:56,270 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-03 17:49:56,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844769724] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-03 17:49:56,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-03 17:49:56,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34, 40] total 108 [2024-04-03 17:49:56,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517410269] [2024-04-03 17:49:56,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-03 17:49:56,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2024-04-03 17:49:56,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 17:49:56,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2024-04-03 17:49:56,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=999, Invalid=9377, Unknown=150, NotChecked=1030, Total=11556 [2024-04-03 17:49:56,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:49:56,276 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 17:49:56,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 108 states have (on average 6.796296296296297) internal successors, (734), 108 states have internal predecessors, (734), 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-03 17:49:56,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:49:56,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-03 17:49:56,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-03 17:49:56,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-04-03 17:49:56,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-03 17:49:56,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-04-03 17:49:56,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-04-03 17:49:56,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-04-03 17:49:56,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:50:11,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-03 17:50:15,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-03 17:50:16,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-03 17:50:18,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-03 17:50:18,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:50:18,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-03 17:50:18,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-03 17:50:18,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-04-03 17:50:18,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-03 17:50:18,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-04-03 17:50:18,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-04-03 17:50:18,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-04-03 17:50:18,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-04-03 17:50:18,331 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-03 17:50:18,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-04-03 17:50:18,523 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-03 17:50:18,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 17:50:18,525 INFO L85 PathProgramCache]: Analyzing trace with hash 102575125, now seen corresponding path program 1 times [2024-04-03 17:50:18,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 17:50:18,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347961663] [2024-04-03 17:50:18,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 17:50:18,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 17:50:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 17:50:25,647 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-03 17:50:25,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 17:50:25,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347961663] [2024-04-03 17:50:25,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347961663] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-03 17:50:25,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637914282] [2024-04-03 17:50:25,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 17:50:25,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-03 17:50:25,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-03 17:50:25,649 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-03 17:50:25,650 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-03 17:50:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 17:50:25,841 INFO L262 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 125 conjunts are in the unsatisfiable core [2024-04-03 17:50:25,852 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-03 17:50:26,044 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-03 17:50:26,044 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-03 17:50:26,114 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-03 17:50:26,114 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-03 17:50:26,353 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 15 treesize of output 1 [2024-04-03 17:50:26,455 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-03 17:50:27,158 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 18 [2024-04-03 17:50:27,661 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-04-03 17:50:27,662 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 45 treesize of output 24 [2024-04-03 17:50:27,722 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-03 17:50:28,076 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 47 treesize of output 23 [2024-04-03 17:50:28,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-03 17:50:28,235 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-03 17:50:28,557 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-03 17:50:28,911 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-04-03 17:50:28,912 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-03 17:50:28,951 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-03 17:50:29,133 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-03 17:50:29,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-03 17:50:29,234 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-03 17:50:29,500 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-03 17:50:29,695 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-03 17:50:30,105 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-04-03 17:50:30,106 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-03 17:50:30,140 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-03 17:50:30,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 0 case distinctions, treesize of input 30 treesize of output 14 [2024-04-03 17:50:30,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-03 17:50:30,288 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-03 17:50:30,480 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-03 17:50:30,488 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-03 17:50:30,527 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-03 17:50:30,527 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-03 17:51:32,787 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (or (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_575 Int) (v_ArrVal_571 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 80))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|) v_ArrVal_575) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|) .cse2) 20) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24|))))) (< |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|))) is different from false [2024-04-03 17:51:32,811 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_575 Int) (v_ArrVal_571 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 80))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|) v_ArrVal_575) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|) .cse2) 20) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24|)))))) is different from false [2024-04-03 17:51:32,927 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_575 Int) (v_ArrVal_571 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (v_ArrVal_568 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_568) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))))) (let ((.cse4 (+ |c_~#queue~0.offset| 80)) (.cse3 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store .cse3 .cse4 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|) v_ArrVal_575) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|) .cse4) 20) (< (select .cse3 .cse4) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24|) (< (select .cse3 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|)))))) is different from false [2024-04-03 17:51:33,017 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_575 Int) (v_ArrVal_571 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_568 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse4 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_568) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))))) (let ((.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 80))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24|) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|) (+ 88 |c_~#queue~0.offset|) v_ArrVal_575) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|) .cse1) 20) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|)))))) is different from false [2024-04-03 17:51:33,060 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_575 Int) (v_ArrVal_571 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_568 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_568) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))))) (let ((.cse2 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 80))) (or (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (< (select .cse2 .cse5) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24|) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store (store (store .cse2 .cse5 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|) (+ 88 |c_~#queue~0.offset|) v_ArrVal_575) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|) .cse5) 20))))))))) is different from false [2024-04-03 17:51:33,130 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_575 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (v_ArrVal_571 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_568 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse4 (store .cse6 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_568) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))))) (let ((.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 80))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24|) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|) (+ 88 |c_~#queue~0.offset|) v_ArrVal_575) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|) .cse1) 20) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (< (select .cse6 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|))))))) is different from false [2024-04-03 17:51:46,522 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_565 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_575 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse6 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_565) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566) |c_~#queue~0.base|))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566)) (.cse3 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse3 .cse5 v_ArrVal_568) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 80))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24|) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|) .cse5 v_ArrVal_575) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|) .cse1) 20) (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)))))) is different from false [2024-04-03 17:51:46,804 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_565 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_575 Int) (v_ArrVal_563 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_563)))) (let ((.cse6 (select (store (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_565) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566) |c_~#queue~0.base|))) (let ((.cse4 (store .cse7 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566)) (.cse2 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse5 v_ArrVal_568) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 80))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (< (select .cse0 .cse3) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse0 .cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|) .cse5 v_ArrVal_575) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|) .cse3) 20) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_563) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|))))))) is different from false [2024-04-03 17:51:46,844 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_565 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_575 Int) (v_ArrVal_563 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_563)))) (let ((.cse6 (select (store (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_565) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566) |c_~#queue~0.base|))) (let ((.cse4 (store .cse7 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566)) (.cse2 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse5 v_ArrVal_568) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 80))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (< (select .cse0 .cse3) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse0 .cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|) .cse5 v_ArrVal_575) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|) .cse3) 20) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_563) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|))))))) is different from false [2024-04-03 17:51:46,885 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_565 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_575 Int) (v_ArrVal_563 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_563)))) (let ((.cse8 (select (store (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_565) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566) |c_~#queue~0.base|))) (let ((.cse6 (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566)) (.cse2 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_568) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 80))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_563) (< (select .cse0 .cse5) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24|) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store (store (store .cse0 .cse5 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|) .cse7 v_ArrVal_575) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|) .cse5) 20) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)))))))) is different from false [2024-04-03 17:51:47,098 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_565 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_575 Int) (v_ArrVal_563 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 v_ArrVal_563)))) (let ((.cse5 (select (store (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_565) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566) |c_~#queue~0.base|))) (let ((.cse0 (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566)) (.cse8 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse8 .cse3 v_ArrVal_568) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 80))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|) .cse3 v_ArrVal_575) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|) .cse2) 20) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (< (select .cse1 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (+ (select .cse6 .cse7) 1) v_ArrVal_563) (< (select .cse8 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24|)))))))) is different from false [2024-04-03 17:51:47,256 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_565 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_575 Int) (v_ArrVal_563 Int) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse6 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_561)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 v_ArrVal_563)))) (let ((.cse2 (select (store (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_565) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566) |c_~#queue~0.base|))) (let ((.cse4 (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566)) (.cse8 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 80)) (.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse8 .cse5 v_ArrVal_568) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|) .cse5 v_ArrVal_575) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse6 .cse7) 1) v_ArrVal_563) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|)))))))) is different from false [2024-04-03 17:51:47,315 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_565 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_575 Int) (v_ArrVal_563 Int) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse2 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_561))) (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 v_ArrVal_563)))) (let ((.cse8 (select (store (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_565) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566) |c_~#queue~0.base|))) (let ((.cse3 (store .cse10 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566)) (.cse9 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse7 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (+ |c_~#queue~0.offset| 80)) (.cse4 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse9 .cse6 v_ArrVal_568) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|))) (or (< (+ (select .cse2 .cse1) 1) v_ArrVal_563) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse4 .cse5 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|) .cse6 v_ArrVal_575) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|) .cse5) 20) (< (select .cse4 .cse5) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24|) (< (select .cse4 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (select .cse8 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (< (select .cse9 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|))))))))))) is different from false [2024-04-03 17:51:47,435 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_565 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_575 Int) (v_ArrVal_563 Int) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse7 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_561)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse6 v_ArrVal_563)))) (let ((.cse8 (select (store (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_565) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566) |c_~#queue~0.base|))) (let ((.cse0 (store .cse10 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566)) (.cse9 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse9 .cse3 v_ArrVal_568) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 80))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|) .cse3 v_ArrVal_575) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|) .cse2) 20) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) (< (+ (select .cse7 .cse6) 1) v_ArrVal_563) (< (select .cse1 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (select .cse8 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24|) (< (select .cse9 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|))))))))) is different from false [2024-04-03 17:52:13,916 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_565 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_575 Int) (v_ArrVal_563 Int) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_559))) (let ((.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse3 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) |c_~#queue~0.offset|) v_ArrVal_561)) (.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse6 (select (store (store (store .cse9 |c_~#queue~0.base| (store (store .cse3 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 v_ArrVal_563)) |c_~#stored_elements~0.base| v_ArrVal_565) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566) |c_~#queue~0.base|))) (let ((.cse7 (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566)) (.cse4 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse4 .cse8 v_ArrVal_568) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 80))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) (< (+ (select .cse3 .cse1) 1) v_ArrVal_563) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (< (select .cse0 .cse5) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24|) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store (store (store (store .cse0 .cse5 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|) .cse8 v_ArrVal_575) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|) .cse5) 20))))))))) is different from false [2024-04-03 17:52:16,869 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_557 Int) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_565 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_575 Int) (v_ArrVal_563 Int) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_557)))) (let ((.cse11 (store .cse7 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_559))) (let ((.cse10 (select .cse11 |c_~#queue~0.base|))) (let ((.cse2 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) |c_~#queue~0.offset|) v_ArrVal_561)) (.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store (store .cse11 |c_~#queue~0.base| (store (store .cse2 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 v_ArrVal_563)) |c_~#stored_elements~0.base| v_ArrVal_565) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566) |c_~#queue~0.base|))) (let ((.cse8 (store .cse11 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_566)) (.cse5 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse5 .cse9 v_ArrVal_568) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 80))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_563) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_42|) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_41|) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (< (select .cse6 .cse3) (select .cse6 .cse1))) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) (< (select (select (store (store .cse8 |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_24| 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|) .cse9 v_ArrVal_575) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|) .cse1) 20) (< (select .cse10 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|)))))))))) is different from false [2024-04-03 17:52:16,998 INFO L349 Elim1Store]: treesize reduction 96, result has 47.0 percent of original size [2024-04-03 17:52:16,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1334 treesize of output 1082 [2024-04-03 17:52:17,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-03 17:52:17,074 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 1708 treesize of output 1688 [2024-04-03 17:52:17,127 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 787 treesize of output 747 [2024-04-03 17:52:17,166 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 195 treesize of output 183 [2024-04-03 17:52:17,210 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 385 treesize of output 369 [2024-04-03 17:52:17,257 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 354 treesize of output 342 [2024-04-03 17:52:17,294 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 303 treesize of output 279 [2024-04-03 17:52:18,201 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 7 treesize of output 3 [2024-04-03 17:52:19,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-03 17:52:19,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 393 treesize of output 363 [2024-04-03 17:52:21,104 INFO L349 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2024-04-03 17:52:21,105 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-03 17:52:21,233 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2024-04-03 17:52:21,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637914282] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-03 17:52:21,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-03 17:52:21,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 44, 52] total 143 [2024-04-03 17:52:21,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621990559] [2024-04-03 17:52:21,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-03 17:52:21,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 143 states [2024-04-03 17:52:21,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-03 17:52:21,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2024-04-03 17:52:21,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1393, Invalid=14518, Unknown=155, NotChecked=4240, Total=20306 [2024-04-03 17:52:21,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:52:21,244 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-03 17:52:21,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 143 states, 143 states have (on average 5.741258741258742) internal successors, (821), 143 states have internal predecessors, (821), 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-03 17:52:21,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:52:21,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-03 17:52:21,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-03 17:52:21,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-04-03 17:52:21,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-03 17:52:21,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-04-03 17:52:21,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-04-03 17:52:21,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-04-03 17:52:21,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-04-03 17:52:21,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:52:55,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-03 17:52:58,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-03 17:53:01,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-03 17:53:01,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-03 17:53:01,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-03 17:53:01,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-04-03 17:53:01,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-03 17:53:01,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-04-03 17:53:01,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-04-03 17:53:01,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-04-03 17:53:01,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-04-03 17:53:01,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-04-03 17:53:01,111 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-03 17:53:01,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-04-03 17:53:01,307 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-03 17:53:01,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-03 17:53:01,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1343727046, now seen corresponding path program 1 times [2024-04-03 17:53:01,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-03 17:53:01,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770061092] [2024-04-03 17:53:01,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 17:53:01,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-03 17:53:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 17:53:11,416 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-03 17:53:11,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-03 17:53:11,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770061092] [2024-04-03 17:53:11,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770061092] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-03 17:53:11,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618304297] [2024-04-03 17:53:11,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-03 17:53:11,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-03 17:53:11,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-03 17:53:11,418 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-03 17:53:11,419 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-03 17:53:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-03 17:53:11,643 INFO L262 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 182 conjunts are in the unsatisfiable core [2024-04-03 17:53:11,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-03 17:53:12,008 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-03 17:53:12,008 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-03 17:53:12,124 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-03 17:53:12,124 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-03 17:53:12,517 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-03 17:53:12,657 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-03 17:53:13,653 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-03 17:53:14,511 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-03 17:53:14,622 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-03 17:53:15,045 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-03 17:53:15,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-03 17:53:15,298 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-03 17:53:16,427 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-03 17:53:17,713 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-03 17:53:17,967 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-03 17:53:18,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-04-03 17:53:18,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-03 17:53:18,821 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-03 17:53:20,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-03 17:53:20,122 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-03 17:53:20,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-03 17:53:20,621 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-03 17:53:22,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-03 17:53:22,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 38 [2024-04-03 17:53:22,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-03 17:53:22,321 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-03 17:53:22,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-03 17:53:22,544 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 41 treesize of output 31 [2024-04-03 17:53:22,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-03 17:53:22,860 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 34 treesize of output 28 [2024-04-03 17:53:23,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-03 17:53:23,793 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-03 17:53:23,796 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-03 17:53:23,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-03 17:53:23,969 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-03 17:53:24,311 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-03 17:53:24,408 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-03 17:53:24,408 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-03 17:53:25,003 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|)) (.cse0 (= |c_t2Thread1of1ForFork1_dequeue_#t~mem43#1| 0))) (and (or (not .cse0) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse1) 1)))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse1) 0))) .cse0))) is different from false [2024-04-03 17:54:15,859 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse9 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (+ |c_~#queue~0.offset| 80)) (.cse1 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse5 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse7 (+ (* (select .cse6 .cse9) 4) |c_~#queue~0.offset|)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_741 Int) (v_ArrVal_739 Int) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse4 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse6 .cse7 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse8 v_ArrVal_739) .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse0 (store (select .cse4 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_744) |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))))) (forall ((v_ArrVal_741 Int) (v_ArrVal_739 Int) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse11 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse6 .cse7 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse8 v_ArrVal_739) .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse12 (store (select .cse11 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_741))) (or (not (= (let ((.cse10 (select (store .cse11 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (select .cse10 (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse1) 1)))))))))) is different from false [2024-04-03 18:00:03,878 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse14 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse12 (let ((.cse23 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse23 (+ (* (select .cse23 .cse14) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) |c_t1Thread1of1ForFork0_enqueue_#in~x#1|))) (.cse22 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (let ((.cse2 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse7 (+ |c_~#stored_elements~0.offset| 8 .cse22)) (.cse4 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|)) (.cse11 (+ |c_~#stored_elements~0.offset| 4 .cse22)) (.cse13 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse15 (+ (select .cse12 .cse14) 1))) (and (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse12 .cse13 v_ArrVal_730) .cse14 .cse15)))) (let ((.cse6 (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) .cse11 |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse5 (store (store (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (store (store .cse8 .cse4 (+ (select .cse8 .cse4) 1)) (+ |c_~#queue~0.offset| (* (select .cse8 .cse9) 4)) v_subst_4)) .cse10 v_ArrVal_739) .cse9 (+ v_subst_3 1)))) (let ((.cse1 (store (select (store .cse6 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse2) 1))) (not (= (let ((.cse3 (select (store (store .cse0 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)))) 0)))))))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse17 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse12 .cse13 v_ArrVal_730) .cse14 .cse15)))) (let ((.cse20 (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) .cse11 |c_t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse18 (store (store (let ((.cse21 (select .cse20 |c_~#queue~0.base|))) (store (store .cse21 .cse4 (+ (select .cse21 .cse4) 1)) (+ |c_~#queue~0.offset| (* (select .cse21 .cse9) 4)) v_subst_5)) .cse10 v_ArrVal_739) .cse9 (+ v_subst_2 1)))) (let ((.cse19 (store (select (store .cse20 |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (= (let ((.cse16 (select (store (store .cse17 |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (select .cse16 (+ (* (select .cse16 .cse4) 4) |c_~#queue~0.offset|))) 0) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse17 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse2) 0))))))))))))) is different from false [2024-04-03 18:00:51,243 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse8 (+ 84 |c_~#queue~0.offset|)) (.cse22 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (let ((.cse4 (+ |c_~#stored_elements~0.offset| 4)) (.cse6 (+ |c_~#stored_elements~0.offset| 8 .cse22)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse11 (+ |c_~#stored_elements~0.offset| 4 .cse22)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse14 (+ (* (select .cse13 .cse8) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse9 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse12 (store .cse13 .cse14 |t1Thread1of1ForFork0_~value~0#1|))) (store (store .cse12 .cse10 v_ArrVal_730) .cse8 (+ (select .cse12 .cse8) 1)))))) (let ((.cse5 (store (select .cse9 |c_~#stored_elements~0.base|) .cse11 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse2 (store (store (let ((.cse7 (select (store .cse9 |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base|))) (store (store .cse7 .cse1 (+ (select .cse7 .cse1) 1)) (+ (* (select .cse7 .cse8) 4) |c_~#queue~0.offset|) v_subst_4)) .cse10 v_ArrVal_739) .cse8 (+ v_subst_3 1)))) (let ((.cse3 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| .cse2) |c_~#stored_elements~0.base|) .cse6 v_ArrVal_741))) (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 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)))) 0)) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse4) 1))))))))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse20 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse21 (store .cse13 .cse14 |t1Thread1of1ForFork0_~value~0#1|))) (store (store .cse21 .cse10 v_ArrVal_730) .cse8 (+ (select .cse21 .cse8) 1)))))) (let ((.cse18 (store (select .cse20 |c_~#stored_elements~0.base|) .cse11 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse16 (store (store (let ((.cse19 (select (store .cse20 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base|))) (store (store .cse19 .cse1 (+ (select .cse19 .cse1) 1)) (+ (* (select .cse19 .cse8) 4) |c_~#queue~0.offset|) v_subst_5)) .cse10 v_ArrVal_739) .cse8 (+ v_subst_2 1)))) (let ((.cse17 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base|) .cse6 v_ArrVal_741))) (or (= (let ((.cse15 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base|))) (select .cse15 (+ (* (select .cse15 .cse1) 4) |c_~#queue~0.offset|))) 0) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse4) 0)))))))))))) is different from false [2024-04-03 18:00:51,965 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse24 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (let ((.cse5 (+ |c_~#stored_elements~0.offset| 4)) (.cse7 (+ |c_~#stored_elements~0.offset| 8 .cse24)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse12 (+ |c_~#stored_elements~0.offset| 4 .cse24)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse10 (store .cse2 |c_~#queue~0.base| (let ((.cse13 (let ((.cse14 (select .cse2 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse13 .cse11 v_ArrVal_730) .cse9 (+ 1 (select .cse13 .cse9))))))) (let ((.cse6 (store (select .cse10 |c_~#stored_elements~0.base|) .cse12 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse3 (store (store (let ((.cse8 (select (store .cse10 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)) (+ |c_~#queue~0.offset| (* 4 (select .cse8 .cse9))) v_subst_5)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_2 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (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) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse5) 0)))))))))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse21 (store .cse16 |c_~#queue~0.base| (let ((.cse22 (let ((.cse23 (select .cse16 |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse22 .cse11 v_ArrVal_730) .cse9 (+ 1 (select .cse22 .cse9))))))) (let ((.cse19 (store (select .cse21 |c_~#stored_elements~0.base|) .cse12 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse17 (store (store (let ((.cse20 (select (store .cse21 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (store (store .cse20 .cse1 (+ (select .cse20 .cse1) 1)) (+ |c_~#queue~0.offset| (* 4 (select .cse20 .cse9))) v_subst_4)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_3 1)))) (let ((.cse18 (store (select (store (store .cse16 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (not (= (let ((.cse15 (select (store (store .cse16 |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base|))) (select .cse15 (+ (* (select .cse15 .cse1) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse16 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse5) 1))))))))))))) is different from false [2024-04-03 18:00:52,845 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_~#stored_elements~0.offset| 8)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse5 (+ |c_~#stored_elements~0.offset| 4)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse10 (store .cse2 |c_~#queue~0.base| (let ((.cse12 (let ((.cse13 (select .cse2 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse12 .cse11 v_ArrVal_730) .cse9 (+ 1 (select .cse12 .cse9))))))) (let ((.cse6 (store (select .cse10 |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse3 (store (store (let ((.cse8 (select (store .cse10 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)) (+ (* 4 (select .cse8 .cse9)) |c_~#queue~0.offset|) v_subst_4)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_3 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (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)) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse5) 1)))))))))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse20 (store .cse14 |c_~#queue~0.base| (let ((.cse21 (let ((.cse22 (select .cse14 |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse21 .cse11 v_ArrVal_730) .cse9 (+ 1 (select .cse21 .cse9))))))) (let ((.cse18 (store (select .cse20 |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse17 (store (store (let ((.cse19 (select (store .cse20 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base|))) (store (store .cse19 .cse1 (+ (select .cse19 .cse1) 1)) (+ (* 4 (select .cse19 .cse9)) |c_~#queue~0.offset|) v_subst_5)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_2 1)))) (let ((.cse15 (store (select (store (store .cse14 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse14 |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse5) 0))) (= (let ((.cse16 (select (store (store .cse14 |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base|))) (select .cse16 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|))) 0)))))))))) is different from false [2024-04-03 18:00:54,160 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork0_empty_#t~mem31#1| |c_t1Thread1of1ForFork0_empty_#t~mem32#1|) (let ((.cse7 (+ |c_~#stored_elements~0.offset| 8)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse5 (+ |c_~#stored_elements~0.offset| 4)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse10 (store .cse2 |c_~#queue~0.base| (let ((.cse12 (let ((.cse13 (select .cse2 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse12 .cse11 v_ArrVal_730) .cse9 (+ 1 (select .cse12 .cse9))))))) (let ((.cse6 (store (select .cse10 |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse3 (store (store (let ((.cse8 (select (store .cse10 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)) (+ (* 4 (select .cse8 .cse9)) |c_~#queue~0.offset|) v_subst_4)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_3 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (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)) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse5) 1)))))))))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse20 (store .cse14 |c_~#queue~0.base| (let ((.cse21 (let ((.cse22 (select .cse14 |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse21 .cse11 v_ArrVal_730) .cse9 (+ 1 (select .cse21 .cse9))))))) (let ((.cse18 (store (select .cse20 |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse17 (store (store (let ((.cse19 (select (store .cse20 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base|))) (store (store .cse19 .cse1 (+ (select .cse19 .cse1) 1)) (+ (* 4 (select .cse19 .cse9)) |c_~#queue~0.offset|) v_subst_5)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_2 1)))) (let ((.cse15 (store (select (store (store .cse14 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse14 |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse5) 0))) (= (let ((.cse16 (select (store (store .cse14 |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base|))) (select .cse16 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|))) 0))))))))))) is different from false [2024-04-03 18:00:54,392 WARN L854 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_empty_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_empty_~q#1.offset|)) |c_t1Thread1of1ForFork0_empty_#t~mem31#1|) (let ((.cse7 (+ |c_~#stored_elements~0.offset| 8)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse5 (+ |c_~#stored_elements~0.offset| 4)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse10 (store .cse2 |c_~#queue~0.base| (let ((.cse12 (let ((.cse13 (select .cse2 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse12 .cse11 v_ArrVal_730) .cse9 (+ 1 (select .cse12 .cse9))))))) (let ((.cse6 (store (select .cse10 |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse3 (store (store (let ((.cse8 (select (store .cse10 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)) (+ (* 4 (select .cse8 .cse9)) |c_~#queue~0.offset|) v_subst_4)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_3 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (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)) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse5) 1)))))))))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse20 (store .cse14 |c_~#queue~0.base| (let ((.cse21 (let ((.cse22 (select .cse14 |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse21 .cse11 v_ArrVal_730) .cse9 (+ 1 (select .cse21 .cse9))))))) (let ((.cse18 (store (select .cse20 |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse17 (store (store (let ((.cse19 (select (store .cse20 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base|))) (store (store .cse19 .cse1 (+ (select .cse19 .cse1) 1)) (+ (* 4 (select .cse19 .cse9)) |c_~#queue~0.offset|) v_subst_5)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_2 1)))) (let ((.cse15 (store (select (store (store .cse14 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse14 |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse5) 0))) (= (let ((.cse16 (select (store (store .cse14 |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base|))) (select .cse16 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|))) 0))))))))))) is different from false [2024-04-03 18:00:54,638 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_empty_~q#1.base|))) (= (select .cse0 (+ 84 |c_t1Thread1of1ForFork0_empty_~q#1.offset|)) (select .cse0 (+ |c_t1Thread1of1ForFork0_empty_~q#1.offset| 80)))) (let ((.cse8 (+ |c_~#stored_elements~0.offset| 8)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse6 (+ |c_~#stored_elements~0.offset| 4)) (.cse12 (+ 88 |c_~#queue~0.offset|)) (.cse10 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse11 (store .cse3 |c_~#queue~0.base| (let ((.cse13 (let ((.cse14 (select .cse3 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse10) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse13 .cse12 v_ArrVal_730) .cse10 (+ 1 (select .cse13 .cse10))))))) (let ((.cse7 (store (select .cse11 |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse4 (store (store (let ((.cse9 (select (store .cse11 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base|))) (store (store .cse9 .cse2 (+ (select .cse9 .cse2) 1)) (+ (* 4 (select .cse9 .cse10)) |c_~#queue~0.offset|) v_subst_4)) .cse12 v_ArrVal_739) .cse10 (+ v_subst_3 1)))) (let ((.cse5 (store (select (store (store .cse3 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base|) .cse8 v_ArrVal_741))) (or (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)) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse3 |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse6) 1)))))))))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse21 (store .cse15 |c_~#queue~0.base| (let ((.cse22 (let ((.cse23 (select .cse15 |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse10) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse22 .cse12 v_ArrVal_730) .cse10 (+ 1 (select .cse22 .cse10))))))) (let ((.cse19 (store (select .cse21 |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse18 (store (store (let ((.cse20 (select (store .cse21 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (store (store .cse20 .cse2 (+ (select .cse20 .cse2) 1)) (+ (* 4 (select .cse20 .cse10)) |c_~#queue~0.offset|) v_subst_5)) .cse12 v_ArrVal_739) .cse10 (+ v_subst_2 1)))) (let ((.cse16 (store (select (store (store .cse15 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base|) .cse8 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse15 |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse6) 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 .cse2) 4) |c_~#queue~0.offset|))) 0))))))))))) is different from false [2024-04-03 18:00:54,880 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_empty_#in~q#1.base|))) (= (select .cse0 (+ |c_t1Thread1of1ForFork0_empty_#in~q#1.offset| 80)) (select .cse0 (+ |c_t1Thread1of1ForFork0_empty_#in~q#1.offset| 84)))) (let ((.cse8 (+ |c_~#stored_elements~0.offset| 8)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse6 (+ |c_~#stored_elements~0.offset| 4)) (.cse12 (+ 88 |c_~#queue~0.offset|)) (.cse10 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse11 (store .cse3 |c_~#queue~0.base| (let ((.cse13 (let ((.cse14 (select .cse3 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse10) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse13 .cse12 v_ArrVal_730) .cse10 (+ 1 (select .cse13 .cse10))))))) (let ((.cse7 (store (select .cse11 |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse4 (store (store (let ((.cse9 (select (store .cse11 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base|))) (store (store .cse9 .cse2 (+ (select .cse9 .cse2) 1)) (+ (* 4 (select .cse9 .cse10)) |c_~#queue~0.offset|) v_subst_4)) .cse12 v_ArrVal_739) .cse10 (+ v_subst_3 1)))) (let ((.cse5 (store (select (store (store .cse3 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base|) .cse8 v_ArrVal_741))) (or (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)) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse3 |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse6) 1)))))))))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse21 (store .cse15 |c_~#queue~0.base| (let ((.cse22 (let ((.cse23 (select .cse15 |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse10) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse22 .cse12 v_ArrVal_730) .cse10 (+ 1 (select .cse22 .cse10))))))) (let ((.cse19 (store (select .cse21 |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse18 (store (store (let ((.cse20 (select (store .cse21 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (store (store .cse20 .cse2 (+ (select .cse20 .cse2) 1)) (+ (* 4 (select .cse20 .cse10)) |c_~#queue~0.offset|) v_subst_5)) .cse12 v_ArrVal_739) .cse10 (+ v_subst_2 1)))) (let ((.cse16 (store (select (store (store .cse15 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base|) .cse8 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse15 |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse6) 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 .cse2) 4) |c_~#queue~0.offset|))) 0))))))))))) is different from false [2024-04-03 18:00:55,366 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#queue~0.offset| 80)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (= (select .cse0 .cse1) (select .cse0 .cse2))) (let ((.cse9 (+ |c_~#stored_elements~0.offset| 8)) (.cse7 (+ |c_~#stored_elements~0.offset| 4)) (.cse12 (+ 88 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse11 (store .cse4 |c_~#queue~0.base| (let ((.cse13 (let ((.cse14 (select .cse4 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse13 .cse12 v_ArrVal_730) .cse1 (+ 1 (select .cse13 .cse1))))))) (let ((.cse8 (store (select .cse11 |c_~#stored_elements~0.base|) .cse7 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse5 (store (store (let ((.cse10 (select (store .cse11 |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base|))) (store (store .cse10 .cse2 (+ (select .cse10 .cse2) 1)) (+ (* 4 (select .cse10 .cse1)) |c_~#queue~0.offset|) v_subst_4)) .cse12 v_ArrVal_739) .cse1 (+ v_subst_3 1)))) (let ((.cse6 (store (select (store (store .cse4 |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_741))) (or (not (= (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (select .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse4 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse7) 1)))))))))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse21 (store .cse15 |c_~#queue~0.base| (let ((.cse22 (let ((.cse23 (select .cse15 |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse22 .cse12 v_ArrVal_730) .cse1 (+ 1 (select .cse22 .cse1))))))) (let ((.cse19 (store (select .cse21 |c_~#stored_elements~0.base|) .cse7 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse18 (store (store (let ((.cse20 (select (store .cse21 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (store (store .cse20 .cse2 (+ (select .cse20 .cse2) 1)) (+ (* 4 (select .cse20 .cse1)) |c_~#queue~0.offset|) v_subst_5)) .cse12 v_ArrVal_739) .cse1 (+ v_subst_2 1)))) (let ((.cse16 (store (select (store (store .cse15 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse15 |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse7) 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 .cse2) 4) |c_~#queue~0.offset|))) 0)))))))))))) is different from false [2024-04-03 18:00:55,559 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_~#stored_elements~0.offset| 8)) (.cse6 (+ |c_~#stored_elements~0.offset| 4)) (.cse13 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80))) (and (forall ((v_ArrVal_727 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_727))) (or (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (= (select .cse0 .cse1) (select .cse0 .cse2))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse14 (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse12 (let ((.cse15 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse15 .cse13 v_ArrVal_730) .cse1 (+ (select .cse15 .cse1) 1))))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse9 (store (select (store .cse14 |c_~#queue~0.base| .cse12) |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse8 (store (store (let ((.cse11 (select (store (store .cse4 |c_~#queue~0.base| .cse12) |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base|))) (store (store .cse11 .cse2 (+ (select .cse11 .cse2) 1)) (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) v_subst_4)) .cse13 v_ArrVal_739) .cse1 (+ v_subst_3 1)))) (let ((.cse5 (store (select (store (store .cse4 |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base| .cse8) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse4 |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse6) 1))) (not (= (let ((.cse7 (select (store (store .cse4 |c_~#queue~0.base| .cse8) |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base|))) (select .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|))) 0)))))))))))) (forall ((v_ArrVal_727 (Array Int Int))) (let ((.cse27 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_727))) (or (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse24 (store .cse27 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse23 (let ((.cse25 (let ((.cse26 (select .cse24 |c_~#queue~0.base|))) (store .cse26 (+ (* (select .cse26 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse25 .cse13 v_ArrVal_730) .cse1 (+ (select .cse25 .cse1) 1))))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse21 (store (select (store .cse24 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse20 (store (store (let ((.cse22 (select (store (store .cse17 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base|))) (store (store .cse22 .cse2 (+ (select .cse22 .cse2) 1)) (+ (* (select .cse22 .cse1) 4) |c_~#queue~0.offset|) v_subst_5)) .cse13 v_ArrVal_739) .cse1 (+ v_subst_2 1)))) (let ((.cse18 (store (select (store (store .cse17 |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse17 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse6) 0))) (= (let ((.cse19 (select (store (store .cse17 |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base|))) (select .cse19 (+ (* (select .cse19 .cse2) 4) |c_~#queue~0.offset|))) 0)))))))) (let ((.cse28 (select .cse27 |c_~#queue~0.base|))) (= (select .cse28 .cse1) (select .cse28 .cse2)))))))) is different from false [2024-04-03 18:00:57,063 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_~#stored_elements~0.offset| 8)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse8 (+ |c_~#stored_elements~0.offset| 4)) (.cse13 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse15 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (forall ((v_ArrVal_727 (Array Int Int))) (let ((.cse3 (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_727))) (or (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (= (select .cse0 .cse1) (select .cse0 .cse2))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse14 (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse12 (let ((.cse16 (let ((.cse17 (select .cse14 |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse2) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse16 .cse13 v_ArrVal_730) .cse2 (+ (select .cse16 .cse2) 1))))) (let ((.cse5 (store .cse15 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse9 (store (select (store .cse14 |c_~#queue~0.base| .cse12) |c_~#stored_elements~0.base|) .cse8 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse6 (store (store (let ((.cse11 (select (store (store .cse5 |c_~#queue~0.base| .cse12) |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base|))) (store (store .cse11 .cse1 (+ (select .cse11 .cse1) 1)) (+ (* 4 (select .cse11 .cse2)) |c_~#queue~0.offset|) v_subst_4)) .cse13 v_ArrVal_739) .cse2 (+ v_subst_3 1)))) (let ((.cse7 (store (select (store (store .cse5 |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_741))) (or (not (= (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base|))) (select .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse1) 4)))) 0)) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse5 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse8) 1))))))))))))) (forall ((v_ArrVal_727 (Array Int Int))) (let ((.cse19 (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_727))) (or (let ((.cse18 (select .cse19 |c_~#queue~0.base|))) (= (select .cse18 .cse1) (select .cse18 .cse2))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse27 (store .cse19 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse26 (let ((.cse28 (let ((.cse29 (select .cse27 |c_~#queue~0.base|))) (store .cse29 (+ (* (select .cse29 .cse2) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse28 .cse13 v_ArrVal_730) .cse2 (+ (select .cse28 .cse2) 1))))) (let ((.cse20 (store .cse15 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse24 (store (select (store .cse27 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base|) .cse8 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse23 (store (store (let ((.cse25 (select (store (store .cse20 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (store (store .cse25 .cse1 (+ (select .cse25 .cse1) 1)) (+ (* 4 (select .cse25 .cse2)) |c_~#queue~0.offset|) v_subst_5)) .cse13 v_ArrVal_739) .cse2 (+ v_subst_2 1)))) (let ((.cse21 (store (select (store (store .cse20 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse20 |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse8) 0))) (= (let ((.cse22 (select (store (store .cse20 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base|))) (select .cse22 (+ |c_~#queue~0.offset| (* 4 (select .cse22 .cse1))))) 0))))))))))))) is different from false [2024-04-03 18:00:57,293 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_~#stored_elements~0.offset| 8)) (.cse8 (+ |c_~#stored_elements~0.offset| 4)) (.cse13 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse15 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (and (forall ((v_ArrVal_727 (Array Int Int))) (let ((.cse3 (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_727))) (or (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (= (select .cse0 .cse1) (select .cse0 .cse2))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse14 (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse12 (let ((.cse16 (let ((.cse17 (select .cse14 |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse2) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse16 .cse13 v_ArrVal_730) .cse2 (+ (select .cse16 .cse2) 1))))) (let ((.cse5 (store .cse15 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse9 (store (select (store .cse14 |c_~#queue~0.base| .cse12) |c_~#stored_elements~0.base|) .cse8 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse6 (store (store (let ((.cse11 (select (store (store .cse5 |c_~#queue~0.base| .cse12) |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base|))) (store (store .cse11 .cse1 (+ 1 (select .cse11 .cse1))) (+ (* (select .cse11 .cse2) 4) |c_~#queue~0.offset|) v_subst_5)) .cse13 v_ArrVal_739) .cse2 (+ v_subst_2 1)))) (let ((.cse7 (store (select (store (store .cse5 |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_741))) (or (= (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base|))) (select .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|))) 0) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse5 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse8) 0))))))))))))) (forall ((v_ArrVal_727 (Array Int Int))) (let ((.cse28 (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_727))) (or (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse25 (store .cse28 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse24 (let ((.cse26 (let ((.cse27 (select .cse25 |c_~#queue~0.base|))) (store .cse27 (+ (* (select .cse27 .cse2) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse26 .cse13 v_ArrVal_730) .cse2 (+ (select .cse26 .cse2) 1))))) (let ((.cse19 (store .cse15 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse22 (store (select (store .cse25 |c_~#queue~0.base| .cse24) |c_~#stored_elements~0.base|) .cse8 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse20 (store (store (let ((.cse23 (select (store (store .cse19 |c_~#queue~0.base| .cse24) |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base|))) (store (store .cse23 .cse1 (+ 1 (select .cse23 .cse1))) (+ (* (select .cse23 .cse2) 4) |c_~#queue~0.offset|) v_subst_4)) .cse13 v_ArrVal_739) .cse2 (+ v_subst_3 1)))) (let ((.cse21 (store (select (store (store .cse19 |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_741))) (or (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 .cse1) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse19 |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse8) 1)))))))))) (let ((.cse29 (select .cse28 |c_~#queue~0.base|))) (= (select .cse29 .cse1) (select .cse29 .cse2)))))))) is different from false [2024-04-03 18:00:57,463 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_~#stored_elements~0.offset| 8)) (.cse4 (+ |c_~#queue~0.offset| 80)) (.cse2 (+ |c_~#stored_elements~0.offset| 4)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|)) (.cse13 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse30 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse31 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse30 .cse31 (+ (select .cse30 .cse31) 1)))))) (and (forall ((v_ArrVal_727 (Array Int Int))) (let ((.cse16 (store .cse13 |c_~#stored_elements~0.base| v_ArrVal_727))) (or (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse12 (store .cse16 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse10 (let ((.cse14 (let ((.cse15 (select .cse12 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse14 .cse11 v_ArrVal_730) .cse9 (+ (select .cse14 .cse9) 1))))) (let ((.cse0 (store .cse13 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse6 (store (select (store .cse12 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse5 (store (store (let ((.cse8 (select (store (store .cse0 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse8 .cse4 (+ (select .cse8 .cse4) 1)) (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) v_subst_4)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_3 1)))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse2) 1))) (not (= (let ((.cse3 (select (store (store .cse0 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|))) 0))))))))) (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (= (select .cse17 .cse4) (select .cse17 .cse9)))))) (forall ((v_ArrVal_727 (Array Int Int))) (let ((.cse19 (store .cse13 |c_~#stored_elements~0.base| v_ArrVal_727))) (or (let ((.cse18 (select .cse19 |c_~#queue~0.base|))) (= (select .cse18 .cse4) (select .cse18 .cse9))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse27 (store .cse19 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse26 (let ((.cse28 (let ((.cse29 (select .cse27 |c_~#queue~0.base|))) (store .cse29 (+ (* (select .cse29 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse28 .cse11 v_ArrVal_730) .cse9 (+ (select .cse28 .cse9) 1))))) (let ((.cse20 (store .cse13 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse24 (store (select (store .cse27 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse23 (store (store (let ((.cse25 (select (store (store .cse20 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (store (store .cse25 .cse4 (+ (select .cse25 .cse4) 1)) (+ (* (select .cse25 .cse9) 4) |c_~#queue~0.offset|) v_subst_5)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_2 1)))) (let ((.cse21 (store (select (store (store .cse20 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse20 |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse2) 0))) (= (let ((.cse22 (select (store (store .cse20 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base|))) (select .cse22 (+ |c_~#queue~0.offset| (* (select .cse22 .cse4) 4)))) 0))))))))))))) is different from false [2024-04-03 18:00:58,678 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse20 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (+ |c_~#stored_elements~0.offset| 8)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse6 (+ |c_~#stored_elements~0.offset| 4)) (.cse13 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse19 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse21 (+ (select .cse18 .cse20) 1))) (and (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_727 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse18 .cse19 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse20 .cse21)))) (let ((.cse3 (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_727))) (or (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (= (select .cse0 .cse1) (select .cse0 .cse2))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse14 (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse12 (let ((.cse16 (let ((.cse17 (select .cse14 |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse16 .cse13 v_ArrVal_730) .cse1 (+ (select .cse16 .cse1) 1))))) (let ((.cse4 (store .cse15 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse9 (store (select (store .cse14 |c_~#queue~0.base| .cse12) |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse8 (store (store (let ((.cse11 (select (store (store .cse4 |c_~#queue~0.base| .cse12) |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base|))) (store (store .cse11 .cse2 (+ (select .cse11 .cse2) 1)) (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) v_subst_4)) .cse13 v_ArrVal_739) .cse1 (+ v_subst_3 1)))) (let ((.cse5 (store (select (store (store .cse4 |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base| .cse8) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= 1 (select (select (store (store .cse4 |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse6)))) (not (= (let ((.cse7 (select (store (store .cse4 |c_~#queue~0.base| .cse8) |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base|))) (select .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse2) 4)))) 0))))))))))))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_727 (Array Int Int))) (let ((.cse32 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse18 .cse19 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse20 .cse21)))) (let ((.cse23 (store .cse32 |c_~#stored_elements~0.base| v_ArrVal_727))) (or (let ((.cse22 (select .cse23 |c_~#queue~0.base|))) (= (select .cse22 .cse1) (select .cse22 .cse2))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse31 (store .cse23 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse30 (let ((.cse33 (let ((.cse34 (select .cse31 |c_~#queue~0.base|))) (store .cse34 (+ (* (select .cse34 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse33 .cse13 v_ArrVal_730) .cse1 (+ (select .cse33 .cse1) 1))))) (let ((.cse24 (store .cse32 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse28 (store (select (store .cse31 |c_~#queue~0.base| .cse30) |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse27 (store (store (let ((.cse29 (select (store (store .cse24 |c_~#queue~0.base| .cse30) |c_~#stored_elements~0.base| .cse28) |c_~#queue~0.base|))) (store (store .cse29 .cse2 (+ (select .cse29 .cse2) 1)) (+ (* (select .cse29 .cse1) 4) |c_~#queue~0.offset|) v_subst_5)) .cse13 v_ArrVal_739) .cse1 (+ v_subst_2 1)))) (let ((.cse25 (store (select (store (store .cse24 |c_~#stored_elements~0.base| .cse28) |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse24 |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse6) 0))) (= (let ((.cse26 (select (store (store .cse24 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base|))) (select .cse26 (+ (* (select .cse26 .cse2) 4) |c_~#queue~0.offset|))) 0))))))))))))))) is different from false [2024-04-03 18:00:59,796 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_~#stored_elements~0.offset| 8)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse6 (+ |c_~#stored_elements~0.offset| 4)) (.cse13 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse19 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse20 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse21 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse22 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_727 (Array Int Int)) (v_ArrVal_723 Int)) (let ((.cse15 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse18 (store .cse21 .cse22 v_ArrVal_723))) (store (store .cse18 .cse19 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse20 (+ (select .cse18 .cse20) 1)))))) (let ((.cse3 (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_727))) (or (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (= (select .cse0 .cse1) (select .cse0 .cse2))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse14 (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse12 (let ((.cse16 (let ((.cse17 (select .cse14 |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse2) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse16 .cse13 v_ArrVal_730) .cse2 (+ (select .cse16 .cse2) 1))))) (let ((.cse4 (store .cse15 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse9 (store (select (store .cse14 |c_~#queue~0.base| .cse12) |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse8 (store (store (let ((.cse11 (select (store (store .cse4 |c_~#queue~0.base| .cse12) |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base|))) (store (store .cse11 .cse1 (+ (select .cse11 .cse1) 1)) (+ (* (select .cse11 .cse2) 4) |c_~#queue~0.offset|) v_subst_5)) .cse13 v_ArrVal_739) .cse2 (+ v_subst_2 1)))) (let ((.cse5 (store (select (store (store .cse4 |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base| .cse8) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse4 |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse6) 0))) (= (let ((.cse7 (select (store (store .cse4 |c_~#queue~0.base| .cse8) |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base|))) (select .cse7 (+ |c_~#queue~0.offset| (* 4 (select .cse7 .cse1))))) 0)))))))))))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_727 (Array Int Int)) (v_ArrVal_723 Int)) (let ((.cse33 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse36 (store .cse21 .cse22 v_ArrVal_723))) (store (store .cse36 .cse19 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse20 (+ (select .cse36 .cse20) 1)))))) (let ((.cse24 (store .cse33 |c_~#stored_elements~0.base| v_ArrVal_727))) (or (let ((.cse23 (select .cse24 |c_~#queue~0.base|))) (= (select .cse23 .cse1) (select .cse23 .cse2))) (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse32 (store .cse24 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse31 (let ((.cse34 (let ((.cse35 (select .cse32 |c_~#queue~0.base|))) (store .cse35 (+ (* (select .cse35 .cse2) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse34 .cse13 v_ArrVal_730) .cse2 (+ (select .cse34 .cse2) 1))))) (let ((.cse25 (store .cse33 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse29 (store (select (store .cse32 |c_~#queue~0.base| .cse31) |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse28 (store (store (let ((.cse30 (select (store (store .cse25 |c_~#queue~0.base| .cse31) |c_~#stored_elements~0.base| .cse29) |c_~#queue~0.base|))) (store (store .cse30 .cse1 (+ (select .cse30 .cse1) 1)) (+ (* (select .cse30 .cse2) 4) |c_~#queue~0.offset|) v_subst_4)) .cse13 v_ArrVal_739) .cse2 (+ v_subst_3 1)))) (let ((.cse26 (store (select (store (store .cse25 |c_~#stored_elements~0.base| .cse29) |c_~#queue~0.base| .cse28) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse25 |c_~#stored_elements~0.base| .cse26) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse6) 1))) (not (= (let ((.cse27 (select (store (store .cse25 |c_~#queue~0.base| .cse28) |c_~#stored_elements~0.base| .cse26) |c_~#queue~0.base|))) (select .cse27 (+ (* (select .cse27 .cse1) 4) |c_~#queue~0.offset|))) 0))))))))))))))) is different from false [2024-04-03 18:01:00,186 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse21 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse20 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (+ |c_~#stored_elements~0.offset| 8)) (.cse5 (+ |c_~#stored_elements~0.offset| 4)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse9 (+ 84 |c_~#queue~0.offset|)) (.cse19 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse22 (+ (* (select .cse21 .cse20) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_727 (Array Int Int)) (v_ArrVal_723 Int)) (let ((.cse13 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse18 (store .cse21 .cse22 v_ArrVal_723))) (store (store .cse18 .cse19 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse20 (+ (select .cse18 .cse20) 1)))))) (let ((.cse16 (store .cse13 |c_~#stored_elements~0.base| v_ArrVal_727))) (or (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse12 (store .cse16 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse10 (let ((.cse14 (let ((.cse15 (select .cse12 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse14 .cse11 v_ArrVal_730) .cse9 (+ (select .cse14 .cse9) 1))))) (let ((.cse2 (store .cse13 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse6 (store (select (store .cse12 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse3 (store (store (let ((.cse8 (select (store (store .cse2 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)) (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) v_subst_4)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_3 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (not (= (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base|))) (select .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)))) 0)) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse5) 1)))))))))) (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (= (select .cse17 .cse1) (select .cse17 .cse9))))))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_727 (Array Int Int)) (v_ArrVal_723 Int)) (let ((.cse31 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse36 (store .cse21 .cse22 v_ArrVal_723))) (store (store .cse36 .cse19 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse20 (+ (select .cse36 .cse20) 1)))))) (let ((.cse34 (store .cse31 |c_~#stored_elements~0.base| v_ArrVal_727))) (or (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse30 (store .cse34 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse29 (let ((.cse32 (let ((.cse33 (select .cse30 |c_~#queue~0.base|))) (store .cse33 (+ (* (select .cse33 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse32 .cse11 v_ArrVal_730) .cse9 (+ (select .cse32 .cse9) 1))))) (let ((.cse23 (store .cse31 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse27 (store (select (store .cse30 |c_~#queue~0.base| .cse29) |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse26 (store (store (let ((.cse28 (select (store (store .cse23 |c_~#queue~0.base| .cse29) |c_~#stored_elements~0.base| .cse27) |c_~#queue~0.base|))) (store (store .cse28 .cse1 (+ (select .cse28 .cse1) 1)) (+ (* (select .cse28 .cse9) 4) |c_~#queue~0.offset|) v_subst_5)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_2 1)))) (let ((.cse24 (store (select (store (store .cse23 |c_~#stored_elements~0.base| .cse27) |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse23 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse5) 0))) (= (let ((.cse25 (select (store (store .cse23 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (select .cse25 (+ |c_~#queue~0.offset| (* 4 (select .cse25 .cse1))))) 0)))))))) (let ((.cse35 (select .cse34 |c_~#queue~0.base|))) (= (select .cse35 .cse1) (select .cse35 .cse9)))))))))) is different from false [2024-04-03 18:01:00,817 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse21 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse20 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse7 (+ |c_~#stored_elements~0.offset| 8)) (.cse5 (+ |c_~#stored_elements~0.offset| 4)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse9 (+ 84 |c_~#queue~0.offset|)) (.cse19 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse22 (+ (* (select .cse21 .cse20) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (and (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_727 (Array Int Int)) (v_ArrVal_723 Int)) (let ((.cse13 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse18 (store .cse21 .cse22 v_ArrVal_723))) (store (store .cse18 .cse19 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse20 (+ (select .cse18 .cse20) 1)))))) (let ((.cse16 (store .cse13 |c_~#stored_elements~0.base| v_ArrVal_727))) (or (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse12 (store .cse16 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse10 (let ((.cse14 (let ((.cse15 (select .cse12 |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse9) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse14 .cse11 v_ArrVal_730) .cse9 (+ (select .cse14 .cse9) 1))))) (let ((.cse2 (store .cse13 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse6 (store (select (store .cse12 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse3 (store (store (let ((.cse8 (select (store (store .cse2 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)) (+ (* 4 (select .cse8 .cse9)) |c_~#queue~0.offset|) v_subst_4)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_3 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (not (= (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base|))) (select .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)))) 0)) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse5) 1)))))))))) (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (= (select .cse17 .cse1) (select .cse17 .cse9))))))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_727 (Array Int Int)) (v_ArrVal_723 Int)) (let ((.cse31 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse36 (store .cse21 .cse22 v_ArrVal_723))) (store (store .cse36 .cse19 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse20 (+ (select .cse36 .cse20) 1)))))) (let ((.cse34 (store .cse31 |c_~#stored_elements~0.base| v_ArrVal_727))) (or (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse30 (store .cse34 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728))) (let ((.cse29 (let ((.cse32 (let ((.cse33 (select .cse30 |c_~#queue~0.base|))) (store .cse33 (+ |c_~#queue~0.offset| (* (select .cse33 .cse9) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse32 .cse11 v_ArrVal_730) .cse9 (+ (select .cse32 .cse9) 1))))) (let ((.cse23 (store .cse31 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse27 (store (select (store .cse30 |c_~#queue~0.base| .cse29) |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse26 (store (store (let ((.cse28 (select (store (store .cse23 |c_~#queue~0.base| .cse29) |c_~#stored_elements~0.base| .cse27) |c_~#queue~0.base|))) (store (store .cse28 .cse1 (+ (select .cse28 .cse1) 1)) (+ (* 4 (select .cse28 .cse9)) |c_~#queue~0.offset|) v_subst_5)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_2 1)))) (let ((.cse24 (store (select (store (store .cse23 |c_~#stored_elements~0.base| .cse27) |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse23 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse5) 0))) (= (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 .cse1) 4) |c_~#queue~0.offset|))) 0)))))))) (let ((.cse35 (select .cse34 |c_~#queue~0.base|))) (= (select .cse35 .cse1) (select .cse35 .cse9)))))))))) is different from false [2024-04-03 18:01:02,046 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse9 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (+ |c_~#stored_elements~0.offset| 8)) (.cse2 (+ |c_~#stored_elements~0.offset| 4)) (.cse4 (+ |c_~#queue~0.offset| 80)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse18 (+ (* (select .cse17 .cse9) 4) |c_~#queue~0.offset|))) (and (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_727 (Array Int Int)) (v_ArrVal_723 Int)) (let ((.cse14 (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse16 (store .cse17 .cse18 v_ArrVal_723))) (store (store .cse16 .cse11 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ (select .cse16 .cse9) 1)))) |c_~#stored_elements~0.base| v_ArrVal_727))) (or (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse10 (let ((.cse12 (let ((.cse13 (select (store .cse14 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728) |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse12 .cse11 v_ArrVal_730) .cse9 (+ (select .cse12 .cse9) 1))))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse6 (store (select (store (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_727) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728) |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse5 (store (store (let ((.cse8 (select (store (store .cse0 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse8 .cse4 (+ (select .cse8 .cse4) 1)) (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) v_subst_5)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_2 1)))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse2) 0))) (= (let ((.cse3 (select (store (store .cse0 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)))) 0))))))) (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (= (select .cse15 .cse9) (select .cse15 .cse4)))))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_727 (Array Int Int)) (v_ArrVal_723 Int)) (let ((.cse28 (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse30 (store .cse17 .cse18 v_ArrVal_723))) (store (store .cse30 .cse11 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ (select .cse30 .cse9) 1)))) |c_~#stored_elements~0.base| v_ArrVal_727))) (or (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse25 (let ((.cse26 (let ((.cse27 (select (store .cse28 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728) |c_~#queue~0.base|))) (store .cse27 (+ (* (select .cse27 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse26 .cse11 v_ArrVal_730) .cse9 (+ (select .cse26 .cse9) 1))))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse23 (store (select (store (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_727) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728) |c_~#queue~0.base| .cse25) |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse21 (store (store (let ((.cse24 (select (store (store .cse20 |c_~#queue~0.base| .cse25) |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base|))) (store (store .cse24 .cse4 (+ (select .cse24 .cse4) 1)) (+ (* (select .cse24 .cse9) 4) |c_~#queue~0.offset|) v_subst_4)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_3 1)))) (let ((.cse22 (store (select (store (store .cse20 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (not (= (let ((.cse19 (select (store (store .cse20 |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base|))) (select .cse19 (+ |c_~#queue~0.offset| (* (select .cse19 .cse4) 4)))) 0)) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse20 |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse2) 1))))))))) (let ((.cse29 (select .cse28 |c_~#queue~0.base|))) (= (select .cse29 .cse9) (select .cse29 .cse4))))))))) is different from false [2024-04-03 18:01:04,717 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_~#stored_elements~0.offset| 8)) (.cse5 (+ |c_~#stored_elements~0.offset| 4)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_721 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_727 (Array Int Int)) (v_ArrVal_723 Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_721))) (let ((.cse15 (store (store .cse12 |c_~#queue~0.base| (let ((.cse17 (let ((.cse18 (select .cse12 |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse9) 4)) v_ArrVal_723)))) (store (store .cse17 .cse11 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ (select .cse17 .cse9) 1)))) |c_~#stored_elements~0.base| v_ArrVal_727))) (or (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_4 Int) (v_subst_3 Int)) (let ((.cse10 (let ((.cse13 (let ((.cse14 (select (store .cse15 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728) |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* (select .cse14 .cse9) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse13 .cse11 v_ArrVal_730) .cse9 (+ (select .cse13 .cse9) 1))))) (let ((.cse2 (store .cse12 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse6 (store (select (store (store (store .cse12 |c_~#stored_elements~0.base| v_ArrVal_727) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728) |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse3 (store (store (let ((.cse8 (select (store (store .cse2 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)) (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) v_subst_4)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_3 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (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)) (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse5) 1))))))))) (let ((.cse16 (select .cse15 |c_~#queue~0.base|))) (= (select .cse16 .cse9) (select .cse16 .cse1))))))) (forall ((v_ArrVal_721 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_727 (Array Int Int)) (v_ArrVal_723 Int)) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_721))) (let ((.cse29 (store (store .cse26 |c_~#queue~0.base| (let ((.cse31 (let ((.cse32 (select .cse26 |c_~#queue~0.base|))) (store .cse32 (+ |c_~#queue~0.offset| (* (select .cse32 .cse9) 4)) v_ArrVal_723)))) (store (store .cse31 .cse11 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ (select .cse31 .cse9) 1)))) |c_~#stored_elements~0.base| v_ArrVal_727))) (or (forall ((v_ArrVal_730 Int) (v_ArrVal_741 Int) (v_ArrVal_728 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_739 Int) (v_subst_5 Int) (v_subst_2 Int)) (let ((.cse25 (let ((.cse27 (let ((.cse28 (select (store .cse29 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728) |c_~#queue~0.base|))) (store .cse28 (+ |c_~#queue~0.offset| (* (select .cse28 .cse9) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse27 .cse11 v_ArrVal_730) .cse9 (+ (select .cse27 .cse9) 1))))) (let ((.cse19 (store .cse26 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728)) (.cse23 (store (select (store (store (store .cse26 |c_~#stored_elements~0.base| v_ArrVal_727) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_728) |c_~#queue~0.base| .cse25) |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse22 (store (store (let ((.cse24 (select (store (store .cse19 |c_~#queue~0.base| .cse25) |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base|))) (store (store .cse24 .cse1 (+ (select .cse24 .cse1) 1)) (+ (* (select .cse24 .cse9) 4) |c_~#queue~0.offset|) v_subst_5)) .cse11 v_ArrVal_739) .cse9 (+ v_subst_2 1)))) (let ((.cse20 (store (select (store (store .cse19 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_741))) (or (forall ((v_ArrVal_744 (Array Int Int))) (not (= (select (select (store (store .cse19 |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base| v_ArrVal_744) |c_~#stored_elements~0.base|) .cse5) 0))) (= (let ((.cse21 (select (store (store .cse19 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base|))) (select .cse21 (+ |c_~#queue~0.offset| (* (select .cse21 .cse1) 4)))) 0))))))) (let ((.cse30 (select .cse29 |c_~#queue~0.base|))) (= (select .cse30 .cse9) (select .cse30 .cse1))))))))) is different from false [2024-04-03 18:01:59,201 INFO L349 Elim1Store]: treesize reduction 96, result has 47.0 percent of original size [2024-04-03 18:01:59,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24199 treesize of output 13456 [2024-04-03 18:01:59,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-03 18:01:59,401 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 110317 treesize of output 105961 [2024-04-03 18:02:01,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-03 18:02:01,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 4167349675 treesize of output 2630412726 Received shutdown request... [2024-04-03 18:02:54,126 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-03 18:02:54,126 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-03 18:02:54,126 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-03 18:02:54,152 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-04-03 18:02:54,158 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-03 18:02:54,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-03 18:02:54,359 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 301 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-25-3-3-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-83-3-10-3-5-3-4-3-4-3-4-3-4-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-2-2-2-1 context. [2024-04-03 18:02:54,361 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-04-03 18:02:54,362 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-04-03 18:02:54,362 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-04-03 18:02:54,364 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2024-04-03 18:02:54,364 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2024-04-03 18:02:54,364 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-04-03 18:02:54,367 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-04-03 18:02:54,370 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-04-03 18:02:54,370 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-04-03 18:02:54,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.04 06:02:54 BasicIcfg [2024-04-03 18:02:54,372 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-04-03 18:02:54,373 INFO L158 Benchmark]: Toolchain (without parser) took 846870.14ms. Allocated memory was 189.8MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 115.6MB in the beginning and 982.3MB in the end (delta: -866.7MB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2024-04-03 18:02:54,373 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 189.8MB. Free memory is still 152.2MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-03 18:02:54,373 INFO L158 Benchmark]: CACSL2BoogieTranslator took 519.40ms. Allocated memory was 189.8MB in the beginning and 287.3MB in the end (delta: 97.5MB). Free memory was 115.3MB in the beginning and 234.8MB in the end (delta: -119.5MB). Peak memory consumption was 12.8MB. Max. memory is 8.0GB. [2024-04-03 18:02:54,373 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.70ms. Allocated memory is still 287.3MB. Free memory was 234.8MB in the beginning and 231.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-04-03 18:02:54,373 INFO L158 Benchmark]: Boogie Preprocessor took 33.96ms. Allocated memory is still 287.3MB. Free memory was 231.7MB in the beginning and 229.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-03 18:02:54,373 INFO L158 Benchmark]: RCFGBuilder took 469.49ms. Allocated memory is still 287.3MB. Free memory was 229.1MB in the beginning and 202.9MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2024-04-03 18:02:54,374 INFO L158 Benchmark]: TraceAbstraction took 845785.25ms. Allocated memory was 287.3MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 201.3MB in the beginning and 982.3MB in the end (delta: -781.0MB). Peak memory consumption was 988.0MB. Max. memory is 8.0GB. [2024-04-03 18:02:54,375 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.12ms. Allocated memory is still 189.8MB. Free memory is still 152.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 519.40ms. Allocated memory was 189.8MB in the beginning and 287.3MB in the end (delta: 97.5MB). Free memory was 115.3MB in the beginning and 234.8MB in the end (delta: -119.5MB). Peak memory consumption was 12.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.70ms. Allocated memory is still 287.3MB. Free memory was 234.8MB in the beginning and 231.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.96ms. Allocated memory is still 287.3MB. Free memory was 231.7MB in the beginning and 229.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 469.49ms. Allocated memory is still 287.3MB. Free memory was 229.1MB in the beginning and 202.9MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 845785.25ms. Allocated memory was 287.3MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 201.3MB in the beginning and 982.3MB in the end (delta: -781.0MB). Peak memory consumption was 988.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2525, independent: 2006, independent conditional: 2006, independent unconditional: 0, dependent: 519, dependent conditional: 519, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2006, independent: 2006, independent conditional: 2006, independent unconditional: 0, 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: 2006, independent: 2006, independent conditional: 2006, independent unconditional: 0, 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: 2006, independent: 2006, independent conditional: 2006, independent unconditional: 0, 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: 2006, independent: 2006, independent conditional: 0, independent unconditional: 2006, 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: 2006, independent: 2006, independent conditional: 0, independent unconditional: 2006, 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: 2006, independent: 2006, independent conditional: 0, independent unconditional: 2006, 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: 254, independent: 254, independent conditional: 0, independent unconditional: 254, 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: 254, independent: 254, independent conditional: 0, independent unconditional: 254, 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: 2006, independent: 1752, independent conditional: 0, independent unconditional: 1752, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 254, unknown conditional: 0, unknown unconditional: 254] , Statistics on independence cache: Total cache size (in pairs): 254, Positive cache size: 254, Positive conditional cache size: 0, Positive unconditional cache size: 254, 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: 0, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2006, independent: 2006, independent conditional: 0, independent unconditional: 2006, 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: 2006, independent: 2006, independent conditional: 0, independent unconditional: 2006, 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: 2006, independent: 2006, independent conditional: 0, independent unconditional: 2006, 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: 254, independent: 254, independent conditional: 0, independent unconditional: 254, 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: 254, independent: 254, independent conditional: 0, independent unconditional: 254, 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: 2006, independent: 1752, independent conditional: 0, independent unconditional: 1752, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 254, unknown conditional: 0, unknown unconditional: 254] , Statistics on independence cache: Total cache size (in pairs): 254, Positive cache size: 254, Positive conditional cache size: 0, Positive unconditional cache size: 254, 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: 0 ], Independence queries for same thread: 519 - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 301 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-25-3-3-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-83-3-10-3-5-3-4-3-4-3-4-3-4-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-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 301 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-25-3-3-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-83-3-10-3-5-3-4-3-4-3-4-3-4-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-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 301 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-25-3-3-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-83-3-10-3-5-3-4-3-4-3-4-3-4-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1064]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 301 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-25-3-3-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-83-3-10-3-5-3-4-3-4-3-4-3-4-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-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 301 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-25-3-3-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-83-3-10-3-5-3-4-3-4-3-4-3-4-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 441 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 845.6s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 74.0s, 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: 313, 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.5s SatisfiabilityAnalysisTime, 177.0s InterpolantComputationTime, 2324 NumberOfCodeBlocks, 2324 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2898 ConstructedInterpolants, 379 QuantifiedInterpolants, 114948 SizeOfPredicates, 112 NumberOfNonLiveVariables, 1305 ConjunctsInSsa, 230 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 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