/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_longer.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.conditional-comm-9b88b13 [2024-11-17 12:00:18,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 12:00:18,572 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2024-11-17 12:00:18,579 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 12:00:18,580 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 12:00:18,609 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 12:00:18,611 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 12:00:18,611 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 12:00:18,611 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 12:00:18,612 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 12:00:18,613 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 12:00:18,613 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 12:00:18,613 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 12:00:18,613 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 12:00:18,613 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 12:00:18,613 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 12:00:18,613 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 12:00:18,613 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 12:00:18,613 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 12:00:18,613 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 12:00:18,614 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 12:00:18,614 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 12:00:18,614 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 12:00:18,614 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 12:00:18,614 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 12:00:18,614 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-17 12:00:18,614 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 12:00:18,614 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-17 12:00:18,614 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 12:00:18,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-17 12:00:18,615 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 12:00:18,615 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 12:00:18,615 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 12:00:18,615 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 12:00:18,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 12:00:18,616 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 12:00:18,616 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-17 12:00:18,616 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-17 12:00:18,616 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-17 12:00:18,616 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP [2024-11-17 12:00:18,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 12:00:18,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 12:00:18,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 12:00:18,904 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 12:00:18,906 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 12:00:18,907 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/queue_longer.i [2024-11-17 12:00:20,312 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/e24ed9812/eaf23049ea4448cc85193fddcc4212ae/FLAG9303e816b [2024-11-17 12:00:20,623 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 12:00:20,623 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/queue_longer.i [2024-11-17 12:00:20,644 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/e24ed9812/eaf23049ea4448cc85193fddcc4212ae/FLAG9303e816b [2024-11-17 12:00:20,662 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/e24ed9812/eaf23049ea4448cc85193fddcc4212ae [2024-11-17 12:00:20,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 12:00:20,668 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-17 12:00:20,669 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 12:00:20,669 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 12:00:20,673 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 12:00:20,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:00:20" (1/1) ... [2024-11-17 12:00:20,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d2320a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:20, skipping insertion in model container [2024-11-17 12:00:20,675 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:00:20" (1/1) ... [2024-11-17 12:00:20,715 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 12:00:21,088 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/queue_longer.i[43296,43309] [2024-11-17 12:00:21,096 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/queue_longer.i[43503,43516] [2024-11-17 12:00:21,099 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/queue_longer.i[43783,43796] [2024-11-17 12:00:21,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 12:00:21,143 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 12:00:21,212 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/queue_longer.i[43296,43309] [2024-11-17 12:00:21,216 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/queue_longer.i[43503,43516] [2024-11-17 12:00:21,219 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/queue_longer.i[43783,43796] [2024-11-17 12:00:21,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 12:00:21,342 INFO L204 MainTranslator]: Completed translation [2024-11-17 12:00:21,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:21 WrapperNode [2024-11-17 12:00:21,344 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 12:00:21,345 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 12:00:21,345 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 12:00:21,345 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 12:00:21,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:21" (1/1) ... [2024-11-17 12:00:21,385 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:21" (1/1) ... [2024-11-17 12:00:21,488 INFO L138 Inliner]: procedures = 274, calls = 856, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 1038 [2024-11-17 12:00:21,488 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 12:00:21,489 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 12:00:21,489 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 12:00:21,489 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 12:00:21,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:21" (1/1) ... [2024-11-17 12:00:21,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:21" (1/1) ... [2024-11-17 12:00:21,515 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:21" (1/1) ... [2024-11-17 12:00:21,515 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:21" (1/1) ... [2024-11-17 12:00:21,563 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:21" (1/1) ... [2024-11-17 12:00:21,566 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:21" (1/1) ... [2024-11-17 12:00:21,570 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:21" (1/1) ... [2024-11-17 12:00:21,573 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:21" (1/1) ... [2024-11-17 12:00:21,578 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 12:00:21,579 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-17 12:00:21,579 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-17 12:00:21,579 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-17 12:00:21,580 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:21" (1/1) ... [2024-11-17 12:00:21,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-17 12:00:21,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-17 12:00:21,619 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-17 12:00:21,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-17 12:00:21,645 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-17 12:00:21,646 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-17 12:00:21,646 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-17 12:00:21,646 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-17 12:00:21,646 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-17 12:00:21,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-17 12:00:21,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-17 12:00:21,646 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-17 12:00:21,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 12:00:21,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-17 12:00:21,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 12:00:21,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 12:00:21,648 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-17 12:00:21,801 INFO L238 CfgBuilder]: Building ICFG [2024-11-17 12:00:21,803 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 12:00:23,210 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-17 12:00:23,210 INFO L287 CfgBuilder]: Performing block encoding [2024-11-17 12:00:23,254 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 12:00:23,255 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-17 12:00:23,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:00:23 BoogieIcfgContainer [2024-11-17 12:00:23,255 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-17 12:00:23,258 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 12:00:23,258 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 12:00:23,262 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 12:00:23,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:00:20" (1/3) ... [2024-11-17 12:00:23,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0163bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:00:23, skipping insertion in model container [2024-11-17 12:00:23,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:21" (2/3) ... [2024-11-17 12:00:23,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0163bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:00:23, skipping insertion in model container [2024-11-17 12:00:23,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:00:23" (3/3) ... [2024-11-17 12:00:23,266 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2024-11-17 12:00:23,281 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 12:00:23,282 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_longer.i that has 3 procedures, 1052 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2024-11-17 12:00:23,282 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-17 12:00:23,452 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-17 12:00:23,539 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 12:00:23,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-17 12:00:23,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-17 12:00:23,542 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-17 12:00:23,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-17 12:00:23,648 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-17 12:00:23,676 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork1 ======== [2024-11-17 12:00:23,685 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@26e9d05e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 12:00:23,685 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-17 12:00:24,042 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:00:24,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:00:24,049 INFO L85 PathProgramCache]: Analyzing trace with hash 722505448, now seen corresponding path program 1 times [2024-11-17 12:00:24,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:00:24,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933865719] [2024-11-17 12:00:24,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:00:24,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:00:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:00:24,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 12:00:24,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:00:24,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933865719] [2024-11-17 12:00:24,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933865719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 12:00:24,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 12:00:24,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 12:00:25,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843357483] [2024-11-17 12:00:25,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 12:00:25,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 12:00:25,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:00:25,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 12:00:25,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 12:00:25,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:25,042 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:00:25,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 447.5) internal successors, (895), 2 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 12:00:25,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:25,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:25,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 12:00:25,185 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:00:25,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:00:25,187 INFO L85 PathProgramCache]: Analyzing trace with hash 286716042, now seen corresponding path program 1 times [2024-11-17 12:00:25,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:00:25,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417761407] [2024-11-17 12:00:25,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:00:25,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:00:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:00:26,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 12:00:26,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:00:26,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417761407] [2024-11-17 12:00:26,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417761407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 12:00:26,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 12:00:26,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 12:00:26,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194125022] [2024-11-17 12:00:26,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 12:00:26,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 12:00:26,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:00:26,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 12:00:26,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 12:00:26,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:26,587 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:00:26,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 223.25) internal successors, (893), 4 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 12:00:26,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:26,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:26,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:26,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:00:26,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 12:00:26,761 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:00:26,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:00:26,763 INFO L85 PathProgramCache]: Analyzing trace with hash -66579943, now seen corresponding path program 1 times [2024-11-17 12:00:26,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:00:26,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586980037] [2024-11-17 12:00:26,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:00:26,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:00:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:00:32,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 12:00:32,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:00:32,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586980037] [2024-11-17 12:00:32,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586980037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 12:00:32,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 12:00:32,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-17 12:00:32,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779707545] [2024-11-17 12:00:32,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 12:00:32,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-17 12:00:32,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:00:32,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-17 12:00:32,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-11-17 12:00:32,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:32,909 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:00:32,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 53.64705882352941) internal successors, (912), 17 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 12:00:32,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:32,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:00:32,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:36,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:36,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:00:36,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 12:00:36,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 12:00:36,961 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:00:36,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:00:36,963 INFO L85 PathProgramCache]: Analyzing trace with hash 752897812, now seen corresponding path program 1 times [2024-11-17 12:00:36,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:00:36,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407456365] [2024-11-17 12:00:36,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:00:36,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:00:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:00:43,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 12:00:43,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:00:43,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407456365] [2024-11-17 12:00:43,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407456365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 12:00:43,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 12:00:43,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2024-11-17 12:00:43,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055912813] [2024-11-17 12:00:43,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 12:00:43,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-17 12:00:43,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:00:43,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-17 12:00:43,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2024-11-17 12:00:43,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:43,912 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:00:43,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 38.166666666666664) internal successors, (916), 24 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 12:00:43,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:43,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:00:43,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-17 12:00:43,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:49,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:49,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:00:49,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 12:00:49,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-17 12:00:49,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 12:00:49,126 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:00:49,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:00:49,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1449345974, now seen corresponding path program 1 times [2024-11-17 12:00:49,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:00:49,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739522921] [2024-11-17 12:00:49,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:00:49,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:00:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:00:49,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 12:00:49,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:00:49,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739522921] [2024-11-17 12:00:49,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739522921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 12:00:49,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 12:00:49,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 12:00:49,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704228619] [2024-11-17 12:00:49,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 12:00:49,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 12:00:49,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:00:49,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 12:00:49,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 12:00:49,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:49,483 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:00:49,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 228.5) internal successors, (914), 4 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 12:00:49,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:49,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:00:49,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-17 12:00:49,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-17 12:00:49,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:49,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:49,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:00:49,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 12:00:49,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-17 12:00:49,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:00:49,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 12:00:49,785 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:00:49,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:00:49,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1043599940, now seen corresponding path program 1 times [2024-11-17 12:00:49,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:00:49,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519728153] [2024-11-17 12:00:49,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:00:49,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:00:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:00:50,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 12:00:50,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:00:50,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519728153] [2024-11-17 12:00:50,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519728153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 12:00:50,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 12:00:50,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 12:00:50,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597878258] [2024-11-17 12:00:50,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 12:00:50,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 12:00:50,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:00:50,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 12:00:50,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 12:00:50,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:50,382 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:00:50,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.6666666666667) internal successors, (944), 3 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 12:00:50,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:50,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:00:50,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-17 12:00:50,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-17 12:00:50,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:00:50,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:50,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:50,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:00:50,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 12:00:50,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-17 12:00:50,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:00:50,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:00:50,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 12:00:50,927 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:00:50,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:00:50,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1409494270, now seen corresponding path program 1 times [2024-11-17 12:00:50,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:00:50,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231483242] [2024-11-17 12:00:50,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:00:50,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:00:50,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:00:51,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 12:00:51,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:00:51,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231483242] [2024-11-17 12:00:51,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231483242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 12:00:51,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 12:00:51,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 12:00:51,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95944923] [2024-11-17 12:00:51,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 12:00:51,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 12:00:51,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:00:51,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 12:00:51,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 12:00:51,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:51,401 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:00:51,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 12:00:51,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:51,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:00:51,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-17 12:00:51,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-17 12:00:51,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:00:51,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:00:51,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:51,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:51,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:00:51,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 12:00:51,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-17 12:00:51,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:00:51,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:00:51,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:00:51,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-17 12:00:51,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 12:00:51,525 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-17 12:00:51,526 INFO L320 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork1 was SAFE (1/3) [2024-11-17 12:00:51,538 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 12:00:51,539 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-17 12:00:51,540 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-17 12:00:51,540 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@26e9d05e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 12:00:51,540 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-17 12:00:51,586 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-17 12:00:51,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:00:51,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1911351535, now seen corresponding path program 1 times [2024-11-17 12:00:51,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:00:51,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289147883] [2024-11-17 12:00:51,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:00:51,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:00:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:00:51,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 12:00:51,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:00:51,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289147883] [2024-11-17 12:00:51,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289147883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 12:00:51,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 12:00:51,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 12:00:51,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957648732] [2024-11-17 12:00:51,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 12:00:51,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 12:00:51,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:00:51,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 12:00:51,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 12:00:51,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:51,755 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:00:51,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 427.5) internal successors, (855), 2 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 12:00:51,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:51,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:51,885 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-17 12:00:51,885 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-11-17 12:00:51,885 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-17 12:00:51,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 12:00:51,886 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-17 12:00:51,887 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (2/3) [2024-11-17 12:00:51,899 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 12:00:51,900 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-17 12:00:51,900 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork0 ======== [2024-11-17 12:00:51,900 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@26e9d05e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 12:00:51,900 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-17 12:00:51,956 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:00:51,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:00:51,957 INFO L85 PathProgramCache]: Analyzing trace with hash 73397212, now seen corresponding path program 1 times [2024-11-17 12:00:51,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:00:51,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408588536] [2024-11-17 12:00:51,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:00:51,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:00:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:00:52,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 12:00:52,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:00:52,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408588536] [2024-11-17 12:00:52,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408588536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 12:00:52,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 12:00:52,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 12:00:52,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846597885] [2024-11-17 12:00:52,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 12:00:52,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 12:00:52,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:00:52,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 12:00:52,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 12:00:52,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:52,192 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:00:52,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 469.5) internal successors, (939), 2 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 12:00:52,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:52,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:52,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 12:00:52,225 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:00:52,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:00:52,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1020521086, now seen corresponding path program 1 times [2024-11-17 12:00:52,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:00:52,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269520547] [2024-11-17 12:00:52,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:00:52,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:00:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:00:52,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 12:00:52,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:00:52,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269520547] [2024-11-17 12:00:52,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269520547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 12:00:52,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 12:00:52,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 12:00:52,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087100006] [2024-11-17 12:00:52,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 12:00:52,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 12:00:52,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:00:52,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 12:00:52,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 12:00:52,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:52,490 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:00:52,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 234.25) internal successors, (937), 4 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 12:00:52,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:52,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:52,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:52,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:00:52,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 12:00:52,543 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:00:52,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:00:52,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1529098637, now seen corresponding path program 1 times [2024-11-17 12:00:52,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:00:52,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758858671] [2024-11-17 12:00:52,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:00:52,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:00:52,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:00:53,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 12:00:53,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:00:53,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758858671] [2024-11-17 12:00:53,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758858671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 12:00:53,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 12:00:53,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 12:00:53,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828280088] [2024-11-17 12:00:53,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 12:00:53,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 12:00:53,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:00:53,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 12:00:53,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 12:00:53,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:53,062 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:00:53,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 12:00:53,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:53,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:00:53,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:53,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:53,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:00:53,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:00:53,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 12:00:53,262 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:00:53,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:00:53,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1019923824, now seen corresponding path program 1 times [2024-11-17 12:00:53,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:00:53,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117135546] [2024-11-17 12:00:53,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:00:53,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:00:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:00:53,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 12:00:53,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:00:53,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117135546] [2024-11-17 12:00:53,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117135546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 12:00:53,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 12:00:53,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 12:00:53,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067307897] [2024-11-17 12:00:53,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 12:00:53,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 12:00:53,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:00:53,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 12:00:53,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 12:00:53,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:53,516 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:00:53,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 249.25) internal successors, (997), 4 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 12:00:53,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:53,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:00:53,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:00:53,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:53,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:53,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:00:53,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:00:53,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:00:53,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 12:00:53,607 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:00:53,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:00:53,608 INFO L85 PathProgramCache]: Analyzing trace with hash 129544686, now seen corresponding path program 1 times [2024-11-17 12:00:53,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:00:53,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287575552] [2024-11-17 12:00:53,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:00:53,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:00:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:00:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 12:00:56,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:00:56,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287575552] [2024-11-17 12:00:56,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287575552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 12:00:56,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 12:00:56,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-17 12:00:56,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106705250] [2024-11-17 12:00:56,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 12:00:56,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-17 12:00:56,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:00:56,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-17 12:00:56,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-17 12:00:56,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:56,096 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:00:56,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 82.91666666666667) internal successors, (995), 12 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 12:00:56,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:56,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:00:56,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:00:56,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:00:56,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:57,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:00:57,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:00:57,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:00:57,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:00:57,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 12:00:57,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 12:00:57,977 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:00:57,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:00:57,978 INFO L85 PathProgramCache]: Analyzing trace with hash -379552493, now seen corresponding path program 1 times [2024-11-17 12:00:57,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:00:57,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488479975] [2024-11-17 12:00:57,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:00:57,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:00:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:01:03,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 12:01:03,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:01:03,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488479975] [2024-11-17 12:01:03,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488479975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 12:01:03,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 12:01:03,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-11-17 12:01:03,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200594913] [2024-11-17 12:01:03,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 12:01:03,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-17 12:01:03,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:01:03,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-17 12:01:03,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2024-11-17 12:01:03,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:03,331 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:01:03,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 45.40909090909091) internal successors, (999), 22 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 12:01:03,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:03,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:03,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:01:03,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:03,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-17 12:01:03,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:07,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:07,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:07,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:01:07,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:07,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 12:01:07,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-17 12:01:07,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 12:01:07,113 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:01:07,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:01:07,114 INFO L85 PathProgramCache]: Analyzing trace with hash 239916686, now seen corresponding path program 1 times [2024-11-17 12:01:07,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:01:07,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966926373] [2024-11-17 12:01:07,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:01:07,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:01:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:01:15,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 12:01:15,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:01:15,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966926373] [2024-11-17 12:01:15,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966926373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 12:01:15,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 12:01:15,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2024-11-17 12:01:15,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267537125] [2024-11-17 12:01:15,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 12:01:15,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-17 12:01:15,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:01:15,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-17 12:01:15,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2024-11-17 12:01:15,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:15,622 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:01:15,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 33.43333333333333) internal successors, (1003), 30 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 12:01:15,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:15,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:15,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:01:15,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:15,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-17 12:01:15,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-17 12:01:15,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:20,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:20,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:20,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:01:20,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:20,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 12:01:20,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-17 12:01:20,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-17 12:01:20,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 12:01:20,343 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:01:20,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:01:20,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1439863119, now seen corresponding path program 1 times [2024-11-17 12:01:20,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:01:20,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593033969] [2024-11-17 12:01:20,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:01:20,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:01:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:01:31,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 12:01:31,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:01:31,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593033969] [2024-11-17 12:01:31,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593033969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 12:01:31,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 12:01:31,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2024-11-17 12:01:31,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326309037] [2024-11-17 12:01:31,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 12:01:31,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-17 12:01:31,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:01:31,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-17 12:01:31,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1482, Unknown=0, NotChecked=0, Total=1640 [2024-11-17 12:01:31,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:31,143 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:01:31,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 24.51219512195122) internal successors, (1005), 41 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 12:01:31,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:31,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:31,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:01:31,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:31,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-17 12:01:31,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-17 12:01:31,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-11-17 12:01:31,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:43,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:43,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:43,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:01:43,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:43,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 12:01:43,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-17 12:01:43,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-17 12:01:43,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-11-17 12:01:43,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-17 12:01:43,291 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:01:43,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:01:43,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1982757764, now seen corresponding path program 1 times [2024-11-17 12:01:43,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:01:43,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615962255] [2024-11-17 12:01:43,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:01:43,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:01:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:01:50,043 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 12:01:50,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:01:50,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615962255] [2024-11-17 12:01:50,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615962255] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 12:01:50,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176828556] [2024-11-17 12:01:50,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:01:50,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 12:01:50,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-17 12:01:50,047 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 12:01:50,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-17 12:01:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:01:50,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 2207 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-11-17 12:01:50,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 12:01:51,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-17 12:01:51,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-17 12:01:52,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:01:52,219 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 12:01:52,236 INFO L349 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2024-11-17 12:01:52,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 28 [2024-11-17 12:01:52,303 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 12:01:52,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2024-11-17 12:01:52,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2024-11-17 12:01:52,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:01:52,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-17 12:01:52,882 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 12:01:52,889 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-17 12:01:52,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2024-11-17 12:01:52,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:01:52,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-17 12:01:53,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2024-11-17 12:01:53,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:01:53,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-17 12:01:53,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:01:53,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-17 12:01:53,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-17 12:01:53,554 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-17 12:01:53,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-17 12:01:53,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-17 12:01:53,623 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 12:01:53,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 12:01:54,864 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| Int) (v_ArrVal_527 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_527) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25|) (not (= 400 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1)))))) is different from false [2024-11-17 12:01:54,875 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| Int) (v_ArrVal_527 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_527) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25|)))) is different from false [2024-11-17 12:01:54,889 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| Int) (v_ArrVal_527 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_527) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25|) (not (= 400 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1)))))) is different from false [2024-11-17 12:01:54,939 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| Int) (v_ArrVal_527 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_527) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25|)))) is different from false [2024-11-17 12:01:54,987 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| Int) (v_ArrVal_527 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_527) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25|)))) is different from false [2024-11-17 12:01:55,010 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| Int) (v_ArrVal_527 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store .cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_527) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25|) (not (= 400 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|) .cse1)))))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29|)))) is different from false [2024-11-17 12:01:55,047 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| Int) (v_ArrVal_527 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse4 (store .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_527) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25|) (not (= 400 (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|) .cse3))))))) is different from false [2024-11-17 12:01:55,928 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_523 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| Int) (v_ArrVal_527 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_523) |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_527) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25|) (not (= 400 (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|) .cse1)))))))) is different from false [2024-11-17 12:01:56,346 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_523 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_33| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| Int) (v_ArrVal_527 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_523) |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_33| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_527) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25|) (not (= 400 (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|) .cse1)))))))) is different from false [2024-11-17 12:01:56,429 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_523 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_33| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| Int) (v_ArrVal_527 (Array Int Int)) (v_ArrVal_518 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_518)) (.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_523) |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_33| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_527) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29|) (not (= 400 (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|) .cse1))) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25|)))))) is different from false [2024-11-17 12:01:56,465 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33|) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_523 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_33| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| Int) (v_ArrVal_527 (Array Int Int)) (v_ArrVal_518 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse7 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_518))) (store (store .cse7 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ (select .cse7 .cse1) 1)))))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse4 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_523) |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse6 (+ 1608 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_33| 1)) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_527) |c_~#queue~0.base|))) (or (not (= 400 (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|) .cse3))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25|))))))))) is different from false [2024-11-17 12:01:56,531 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_523 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_33| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| Int) (v_ArrVal_527 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int) (v_ArrVal_518 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse7 (store .cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) v_ArrVal_518))) (store (store .cse7 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 (+ 1 (select .cse7 .cse3))))))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse0 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_523) |c_~#queue~0.base|))) (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse6 (+ 1608 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_33| 1)) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_527) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33|) (not (= 400 (select (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|) .cse1))) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25|))))))) is different from false [2024-11-17 12:01:57,763 INFO L349 Elim1Store]: treesize reduction 312, result has 39.3 percent of original size [2024-11-17 12:01:57,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 664 treesize of output 423 [2024-11-17 12:01:57,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 12:01:57,821 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 462 treesize of output 462 [2024-11-17 12:01:57,847 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 93 treesize of output 85 [2024-11-17 12:01:57,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-17 12:01:57,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-17 12:01:58,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-17 12:01:58,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 12:01:58,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 90 [2024-11-17 12:01:58,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 12:01:58,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 229 treesize of output 215 [2024-11-17 12:01:59,296 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2024-11-17 12:01:59,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176828556] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 12:01:59,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 12:01:59,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 34] total 89 [2024-11-17 12:01:59,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443567253] [2024-11-17 12:01:59,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 12:01:59,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2024-11-17 12:01:59,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:01:59,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2024-11-17 12:01:59,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=636, Invalid=5212, Unknown=52, NotChecked=1932, Total=7832 [2024-11-17 12:01:59,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:59,305 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:01:59,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 35.08988764044944) internal successors, (3123), 89 states have internal predecessors, (3123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 12:01:59,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:01:59,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:59,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:01:59,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:01:59,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-17 12:01:59,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-17 12:01:59,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-11-17 12:01:59,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-11-17 12:01:59,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:02:17,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:02:17,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:02:17,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:02:17,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:02:17,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 12:02:17,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-17 12:02:17,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-17 12:02:17,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-11-17 12:02:17,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-17 12:02:17,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-17 12:02:17,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-17 12:02:17,522 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:02:17,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:02:17,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1847866495, now seen corresponding path program 1 times [2024-11-17 12:02:17,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:02:17,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504458277] [2024-11-17 12:02:17,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:02:17,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:02:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:02:29,136 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 12:02:29,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:02:29,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504458277] [2024-11-17 12:02:29,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504458277] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 12:02:29,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673680704] [2024-11-17 12:02:29,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:02:29,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 12:02:29,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-17 12:02:29,139 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 12:02:29,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-17 12:02:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:02:29,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 2212 conjuncts, 120 conjuncts are in the unsatisfiable core [2024-11-17 12:02:29,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 12:02:31,356 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-11-17 12:02:31,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-17 12:02:31,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-17 12:02:32,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:02:32,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:02:32,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:02:32,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2024-11-17 12:02:32,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2024-11-17 12:02:32,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-17 12:02:32,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:02:32,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-17 12:02:32,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:02:32,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:02:32,939 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-11-17 12:02:32,986 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-11-17 12:02:33,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-17 12:02:33,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:02:33,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-17 12:02:33,537 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-11-17 12:02:33,721 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-11-17 12:02:34,124 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-11-17 12:02:34,171 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-11-17 12:02:34,246 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-11-17 12:02:34,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:02:34,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-17 12:02:34,488 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-11-17 12:02:34,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-17 12:02:34,529 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 12:02:34,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 12:03:08,307 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_43| Int) (v_ArrVal_670 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (v_ArrVal_663 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (v_ArrVal_666 Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse5 (+ (select .cse4 .cse5) 1)))))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_663) |c_~#queue~0.base|)) (.cse2 (+ 1600 |c_~#queue~0.offset|))) (or (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse3 (+ |c_~#queue~0.offset| 1604))) (store (store (store (store .cse1 .cse2 v_ArrVal_666) (+ (* 4 (select .cse1 .cse3)) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 1608 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_43| 1)) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1)))) |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse2))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_666))))) is different from false [2024-11-17 12:03:29,960 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_43| Int) (v_ArrVal_670 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (v_ArrVal_663 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (v_ArrVal_666 Int)) (let ((.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604)) (.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse6 (store .cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse6 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse5 (+ (select .cse6 .cse5) 1)))))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_663) |c_~#queue~0.base|)) (.cse2 (+ 1600 |c_~#queue~0.offset|))) (or (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse3 (+ |c_~#queue~0.offset| 1604))) (store (store (store (store .cse1 .cse2 v_ArrVal_666) (+ (* (select .cse1 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) (+ 1608 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_43| 1)) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1)))) |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse2))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_666) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|)))))) is different from false [2024-11-17 12:03:43,659 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_43| Int) (v_ArrVal_659 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (v_ArrVal_663 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (v_ArrVal_666 Int)) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_659) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse5 .cse3 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse2 (+ 1 (select .cse5 .cse2))))) |c_~#stored_elements~0.base| v_ArrVal_663) |c_~#queue~0.base|)) (.cse1 (+ 1600 |c_~#queue~0.offset|))) (or (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 v_ArrVal_666) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_43| 1)) .cse2 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse1))) (< (+ (select .cse0 .cse1) 1) v_ArrVal_666) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|))))) is different from false [2024-11-17 12:03:43,826 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_43| Int) (v_ArrVal_659 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (v_ArrVal_663 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (v_ArrVal_666 Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse5 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_659) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse6 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse6 .cse4 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_663) |c_~#queue~0.base|)) (.cse1 (+ 1600 |c_~#queue~0.offset|))) (or (< (+ 1 (select .cse0 .cse1)) v_ArrVal_666) (not (= 400 (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 v_ArrVal_666) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse4 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_43| 1)) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse1))) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|)))))) is different from false [2024-11-17 12:03:43,845 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_43| Int) (v_ArrVal_659 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (v_ArrVal_663 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (v_ArrVal_666 Int)) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))) (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse0 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_659) |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse6 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse6 .cse5 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_663) |c_~#queue~0.base|)) (.cse3 (+ 1600 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_666) (not (= (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse2 .cse3 v_ArrVal_666) (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_43| 1)) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse3) 400))))))) is different from false [2024-11-17 12:03:50,293 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_43| Int) (v_ArrVal_659 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (v_ArrVal_663 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_48| Int) (v_ArrVal_666 Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse7 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse8 (+ (select .cse7 .cse8) 1)))))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse5 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_659) |c_~#queue~0.base|))) (let ((.cse1 (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse6 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse6 .cse4 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_48| 1)) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_663) |c_~#queue~0.base|)) (.cse2 (+ 1600 |c_~#queue~0.offset|))) (or (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 v_ArrVal_666) (+ |c_~#queue~0.offset| (* (select .cse1 .cse3) 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse4 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_43| 1)) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse2))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_666) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|)))))) is different from false [2024-11-17 12:03:50,381 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_43| Int) (v_ArrVal_659 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (v_ArrVal_663 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (v_ArrVal_655 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_48| Int) (v_ArrVal_666 Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse7 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_655)) (.cse8 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse7 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse8 (+ (select .cse7 .cse8) 1)))))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse5 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_659) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse6 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse6 .cse4 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_48| 1)) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_663) |c_~#queue~0.base|)) (.cse1 (+ 1600 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_666) (not (= 400 (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 v_ArrVal_666) (+ |c_~#queue~0.offset| (* (select .cse0 .cse3) 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse4 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_43| 1)) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse1))) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|)))))) is different from false [2024-11-17 12:03:50,421 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46|) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_43| Int) (v_ArrVal_659 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (v_ArrVal_663 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (v_ArrVal_655 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_48| Int) (v_ArrVal_666 Int)) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse9 (store .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| 4)) v_ArrVal_655))) (store (store .cse9 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ (select .cse9 .cse1) 1)))))) (let ((.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse2 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_659) |c_~#queue~0.base|))) (let ((.cse5 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse8 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse8 .cse7 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_48| 1)) .cse3 (+ (select .cse8 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_663) |c_~#queue~0.base|)) (.cse6 (+ 1600 |c_~#queue~0.offset|))) (or (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (not (= 400 (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse5 .cse6 v_ArrVal_666) (+ |c_~#queue~0.offset| (* (select .cse5 .cse3) 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse7 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_43| 1)) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse6))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_666))))))))) is different from false [2024-11-17 12:03:50,485 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_43| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| Int) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_663 (Array Int Int)) (v_ArrVal_655 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_48| Int) (v_ArrVal_666 Int) (v_ArrVal_659 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604)) (.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse9 (store .cse6 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| 4)) v_ArrVal_655))) (store (store .cse9 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse7 (+ (select .cse9 .cse7) 1)))))) (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse0 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_659) |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse8 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse8 .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_48| 1)) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_663) |c_~#queue~0.base|)) (.cse3 (+ 1600 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_666) (not (= 400 (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse2 .cse3 v_ArrVal_666) (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_43| 1)) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse3))) (< (select .cse6 .cse7) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46|))))))) is different from false [2024-11-17 12:04:13,016 INFO L349 Elim1Store]: treesize reduction 462, result has 37.0 percent of original size [2024-11-17 12:04:13,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 1158 treesize of output 663 [2024-11-17 12:04:13,061 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-17 12:04:13,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 613 treesize of output 583 [2024-11-17 12:04:13,160 INFO L349 Elim1Store]: treesize reduction 72, result has 52.3 percent of original size [2024-11-17 12:04:13,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 470 treesize of output 441 [2024-11-17 12:04:13,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 12:04:13,209 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 612 treesize of output 606 [2024-11-17 12:04:13,266 INFO L349 Elim1Store]: treesize reduction 40, result has 29.8 percent of original size [2024-11-17 12:04:13,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 212 treesize of output 163 [2024-11-17 12:04:13,293 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 79 treesize of output 71 [2024-11-17 12:04:13,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 12:04:13,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 47 [2024-11-17 12:04:13,347 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 32 treesize of output 24 [2024-11-17 12:04:13,527 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 42 treesize of output 34 [2024-11-17 12:04:13,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2024-11-17 12:04:13,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 12:04:13,640 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 216 treesize of output 216 [2024-11-17 12:04:14,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 12:04:14,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 459 treesize of output 399 [2024-11-17 12:04:20,791 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-17 12:04:20,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673680704] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 12:04:20,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 12:04:20,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 36, 43] total 121 [2024-11-17 12:04:20,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981504963] [2024-11-17 12:04:20,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 12:04:20,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 121 states [2024-11-17 12:04:20,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 12:04:20,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2024-11-17 12:04:20,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1535, Invalid=10729, Unknown=204, NotChecked=2052, Total=14520 [2024-11-17 12:04:20,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:04:20,800 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-17 12:04:20,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 121 states, 121 states have (on average 26.520661157024794) internal successors, (3209), 121 states have internal predecessors, (3209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 12:04:20,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:04:20,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:04:20,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:04:20,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:04:20,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-17 12:04:20,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-17 12:04:20,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-11-17 12:04:20,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-11-17 12:04:20,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-11-17 12:04:20,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:04:46,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-17 12:04:48,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-17 12:04:50,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-17 12:04:52,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-17 12:04:55,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-17 12:05:16,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-17 12:05:23,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 12:05:23,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:05:23,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 12:05:23,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 12:05:23,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 12:05:23,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-17 12:05:23,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-17 12:05:23,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-11-17 12:05:23,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-17 12:05:23,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-17 12:05:23,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-17 12:05:23,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-17 12:05:23,759 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-17 12:05:23,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 12:05:23,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1906644066, now seen corresponding path program 1 times [2024-11-17 12:05:23,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 12:05:23,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908255734] [2024-11-17 12:05:23,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:05:23,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 12:05:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:05:42,348 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 12:05:42,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 12:05:42,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908255734] [2024-11-17 12:05:42,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908255734] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 12:05:42,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840228880] [2024-11-17 12:05:42,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 12:05:42,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 12:05:42,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-17 12:05:42,351 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 12:05:42,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-17 12:05:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 12:05:42,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 2215 conjuncts, 153 conjuncts are in the unsatisfiable core [2024-11-17 12:05:42,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 12:05:44,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-17 12:05:44,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-17 12:05:44,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 12:05:44,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-11-17 12:05:45,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:05:45,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:05:45,295 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 12:05:45,317 INFO L349 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2024-11-17 12:05:45,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 40 [2024-11-17 12:05:45,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:05:45,369 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 12:05:45,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2024-11-17 12:05:45,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 12:05:45,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 25 [2024-11-17 12:05:45,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:05:45,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 27 treesize of output 20 [2024-11-17 12:05:46,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:05:46,651 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 12:05:46,665 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2024-11-17 12:05:46,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 39 [2024-11-17 12:05:46,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:05:46,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:05:46,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:05:46,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2024-11-17 12:05:47,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 12:05:47,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 41 treesize of output 37 [2024-11-17 12:05:47,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:05:47,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 12:05:47,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2024-11-17 12:05:48,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:05:48,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:05:48,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:05:48,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:05:48,128 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 53 treesize of output 46 [2024-11-17 12:05:48,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:05:48,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 12:05:48,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 46 [2024-11-17 12:05:49,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:05:49,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:05:49,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:05:49,416 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 12:05:49,437 INFO L349 Elim1Store]: treesize reduction 90, result has 23.7 percent of original size [2024-11-17 12:05:49,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 68 [2024-11-17 12:05:49,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:05:49,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:05:49,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:05:49,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:05:49,600 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 53 treesize of output 46 [2024-11-17 12:05:49,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:05:49,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 12:05:49,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 37 [2024-11-17 12:05:49,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:05:49,924 INFO L349 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2024-11-17 12:05:49,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 34 [2024-11-17 12:05:50,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:05:50,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 12:05:50,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 37 [2024-11-17 12:05:50,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 12:05:50,927 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 42 treesize of output 31 [2024-11-17 12:05:50,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 12:05:50,930 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 28 treesize of output 16 [2024-11-17 12:05:51,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-17 12:05:51,242 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 12:05:51,242 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 12:05:51,605 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_t2Thread1of1ForFork0_dequeue_~x~0#1| 0)) (.cse0 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset|))) (and (or (forall ((v_ArrVal_811 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_~q#1.base| v_ArrVal_811) |c_~#stored_elements~0.base|) .cse0) 1))) (not .cse1)) (or .cse1 (forall ((v_ArrVal_811 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_~q#1.base| v_ArrVal_811) |c_~#stored_elements~0.base|) .cse0) 0)))))) is different from false [2024-11-17 12:05:51,768 WARN L851 $PredicateComparison]: unable to prove that (or (let ((.cse1 (= |c_t2Thread1of1ForFork0_dequeue_~x~0#1| 0)) (.cse0 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset|))) (and (or (forall ((v_ArrVal_811 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_~q#1.base| v_ArrVal_811) |c_~#stored_elements~0.base|) .cse0) 1))) (not .cse1)) (or .cse1 (forall ((v_ArrVal_811 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_~q#1.base| v_ArrVal_811) |c_~#stored_elements~0.base|) .cse0) 0)))))) (= 400 (select (select |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_~q#1.base|) (+ |c_t2Thread1of1ForFork0_dequeue_~q#1.offset| 1600)))) is different from false [2024-11-17 12:06:21,574 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse10 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset| 4)) (.cse6 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (.cse8 (+ (* (select .cse7 .cse10) 4) |c_~#queue~0.offset|)) (.cse9 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post41#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse5 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse7 .cse8 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse9 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse10 (+ |t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse2 (store (select .cse5 |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse0 (select (store .cse5 |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base|))) (let ((.cse1 (select .cse0 .cse4))) (or (= (select .cse0 (+ (* .cse1 4) |c_~#queue~0.offset|)) 0) (forall ((v_ArrVal_811 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) .cse3) 0))) (= 400 .cse1))))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post41#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse12 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse7 .cse8 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse9 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse10 (+ |t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse13 (store (select .cse12 |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork1_~value~0#1|))) (or (not (= (let ((.cse11 (select (store .cse12 |c_~#stored_elements~0.base| .cse13) |c_~#queue~0.base|))) (select .cse11 (+ (* (select .cse11 .cse4) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_811 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse13) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) .cse3) 1)))))))))) is different from false [2024-11-17 12:06:53,641 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_#in~q#1.base|)) (.cse13 (+ |c_t2Thread1of1ForFork0_dequeue_#in~q#1.offset| 1600))) (let ((.cse2 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset| 4)) (.cse5 (+ 1600 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (.cse10 (+ 1608 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#queue~0.offset| 1604)) (.cse12 (+ 1608 |c_t2Thread1of1ForFork0_dequeue_#in~q#1.offset|)) (.cse14 (+ (select .cse11 .cse13) 1))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post41#1| Int) (|t2Thread1of1ForFork0_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_#in~q#1.base| (store (store .cse11 .cse12 (+ (- 1) |t2Thread1of1ForFork0_dequeue_#t~post45#1|)) .cse13 .cse14)))) (let ((.cse6 (store .cse0 |c_~#queue~0.base| (store (store (let ((.cse8 (select .cse0 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse10 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse9 (+ |t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse1 (store (select .cse6 |c_~#stored_elements~0.base|) .cse7 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse4 (select (store .cse6 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (let ((.cse3 (select .cse4 .cse5))) (or (forall ((v_ArrVal_811 (Array Int Int))) (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) .cse2) 0))) (= 400 .cse3) (= (select .cse4 (+ (* .cse3 4) |c_~#queue~0.offset|)) 0)))))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post41#1| Int) (|t2Thread1of1ForFork0_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse15 (store |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_#in~q#1.base| (store (store .cse11 .cse12 (+ (- 1) |t2Thread1of1ForFork0_dequeue_#t~post45#1|)) .cse13 .cse14)))) (let ((.cse18 (store .cse15 |c_~#queue~0.base| (store (store (let ((.cse19 (select .cse15 |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse10 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse9 (+ |t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse16 (store (select .cse18 |c_~#stored_elements~0.base|) .cse7 |t1Thread1of1ForFork1_~value~0#1|))) (or (forall ((v_ArrVal_811 (Array Int Int))) (not (= (select (select (store (store .cse15 |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) .cse2) 1))) (not (= (let ((.cse17 (select (store .cse18 |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base|))) (select .cse17 (+ (* (select .cse17 .cse5) 4) |c_~#queue~0.offset|))) 0)))))))))) is different from false [2024-11-17 12:07:14,415 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_~#queue~0.offset| 1604)) (.cse14 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse5 (+ 1600 |c_~#queue~0.offset|))) (let ((.cse4 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset| 4)) (.cse2 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse7 (store .cse14 .cse5 (+ (select .cse14 .cse5) 1))) (.cse8 (+ (* (select .cse14 .cse10) 4) |c_~#queue~0.offset|)) (.cse9 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_811 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post41#1| Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse6 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse7 .cse8 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse9 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse10 (+ |t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse3 (store (select .cse6 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) |c_~#stored_elements~0.offset| 4) |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse1 (select (store .cse6 |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base|))) (let ((.cse0 (select .cse1 .cse5))) (or (= 400 .cse0) (= (select .cse1 (+ |c_~#queue~0.offset| (* 4 .cse0))) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_28| .cse2) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) .cse4) 0)))))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_811 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post41#1| Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse13 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse7 .cse8 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse9 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse10 (+ |t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse11 (store (select .cse13 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) |c_~#stored_elements~0.offset| 4) |t1Thread1of1ForFork1_~value~0#1|))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse11) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) .cse4) 1)) (< |v_t1Thread1of1ForFork1_~i~0#1_28| .cse2) (not (= (let ((.cse12 (select (store .cse13 |c_~#stored_elements~0.base| .cse11) |c_~#queue~0.base|))) (select .cse12 (+ |c_~#queue~0.offset| (* 4 (select .cse12 .cse5))))) 0))))))))) is different from false [2024-11-17 12:07:14,807 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse4 (* |c_t2Thread1of1ForFork0_~i~1#1| 4)) (.cse5 (+ 1600 |c_~#queue~0.offset|)) (.cse10 (+ 1608 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#queue~0.offset| 1604)) (.cse11 (select |c_#memory_int| |c_~#stored_elements~0.base|)) (.cse12 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_811 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post41#1| Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (v_subst_2 Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| (store .cse11 (+ 4 |~#stored_elements~0.offset| .cse12) |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse6 (store (store (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store (store .cse8 .cse5 (+ (select .cse8 .cse5) 1)) (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse10 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse9 (+ |t1Thread1of1ForFork1_enqueue_#t~post41#1| 1)))) (let ((.cse3 (store (select (store .cse7 |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_2))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base|))) (let ((.cse0 (select .cse2 .cse5))) (or (= 400 .cse0) (< |v_t1Thread1of1ForFork1_~i~0#1_28| .cse1) (= (select .cse2 (+ (* .cse0 4) |c_~#queue~0.offset|)) 0) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) (+ .cse4 4 |~#stored_elements~0.offset|)) 0))))))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_811 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post41#1| Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (|~#stored_elements~0.offset| Int) (v_subst_1 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse16 (store |c_#memory_int| |c_~#stored_elements~0.base| (store .cse11 (+ 4 |~#stored_elements~0.offset| .cse12) |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse15 (store (store (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store (store .cse17 .cse5 (+ (select .cse17 .cse5) 1)) (+ (* (select .cse17 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse10 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse9 (+ |t1Thread1of1ForFork1_enqueue_#t~post41#1| 1)))) (let ((.cse13 (store (select (store .cse16 |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_1))) (or (< |v_t1Thread1of1ForFork1_~i~0#1_28| .cse1) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse13) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) (+ .cse4 4 |~#stored_elements~0.offset|)) 1)) (not (= (let ((.cse14 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse15) |c_~#stored_elements~0.base| .cse13) |c_~#queue~0.base|))) (select .cse14 (+ |c_~#queue~0.offset| (* (select .cse14 .cse5) 4)))) 0))))))))) is different from false [2024-11-17 12:07:16,550 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse3 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse2 (* |c_t2Thread1of1ForFork0_~i~1#1| 4)) (.cse5 (+ 1600 |c_~#queue~0.offset|)) (.cse10 (+ 1608 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#queue~0.offset| 1604)) (.cse11 (select .cse0 |c_~#stored_elements~0.base|)) (.cse12 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_811 (Array Int Int)) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (|~#stored_elements~0.offset| Int) (v_subst_1 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse7 (store .cse0 |c_~#stored_elements~0.base| (store .cse11 (+ 4 |~#stored_elements~0.offset| .cse12) |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse6 (store (store (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store (store .cse8 .cse5 (+ (select .cse8 .cse5) 1)) (+ |c_~#queue~0.offset| (* (select .cse8 .cse9) 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse10 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse9 (+ v_subst_3 1)))) (let ((.cse1 (store (select (store .cse7 |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_1))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) (+ .cse2 4 |~#stored_elements~0.offset|)) 1)) (< |v_t1Thread1of1ForFork1_~i~0#1_28| .cse3) (not (= (let ((.cse4 (select (store (store .cse0 |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse4 (+ (* (select .cse4 .cse5) 4) |c_~#queue~0.offset|))) 0))))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_811 (Array Int Int)) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (v_subst_2 Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse17 (store .cse0 |c_~#stored_elements~0.base| (store .cse11 (+ 4 |~#stored_elements~0.offset| .cse12) |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse16 (store (store (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store (store .cse18 .cse5 (+ (select .cse18 .cse5) 1)) (+ |c_~#queue~0.offset| (* (select .cse18 .cse9) 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse10 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse9 (+ v_subst_4 1)))) (let ((.cse15 (store (select (store .cse17 |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_2))) (let ((.cse14 (select (store (store .cse0 |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base|))) (let ((.cse13 (select .cse14 .cse5))) (or (< |v_t1Thread1of1ForFork1_~i~0#1_28| .cse3) (= 400 .cse13) (= (select .cse14 (+ (* 4 .cse13) |c_~#queue~0.offset|)) 0) (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) (+ .cse2 4 |~#stored_elements~0.offset|)) 0)))))))))))) is different from false [2024-11-17 12:07:16,710 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))) (let ((.cse3 (* |c_t2Thread1of1ForFork0_~i~1#1| 4)) (.cse0 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse6 (+ 1600 |c_~#queue~0.offset|)) (.cse11 (+ 1608 |c_~#queue~0.offset|)) (.cse10 (+ |c_~#queue~0.offset| 1604)) (.cse12 (select .cse1 |c_~#stored_elements~0.base|)) (.cse13 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_811 (Array Int Int)) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (v_subst_2 Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse8 (store .cse1 |c_~#stored_elements~0.base| (store .cse12 (+ 4 |~#stored_elements~0.offset| .cse13) |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse7 (store (store (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (store (store .cse9 .cse6 (+ (select .cse9 .cse6) 1)) (+ (* (select .cse9 .cse10) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse11 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse10 (+ v_subst_4 1)))) (let ((.cse2 (store (select (store .cse8 |c_~#queue~0.base| .cse7) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_2))) (let ((.cse5 (select (store (store .cse1 |c_~#queue~0.base| .cse7) |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base|))) (let ((.cse4 (select .cse5 .cse6))) (or (< |v_t1Thread1of1ForFork1_~i~0#1_28| .cse0) (not (= 0 (select (select (store (store .cse1 |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) (+ .cse3 4 |~#stored_elements~0.offset|)))) (= 400 .cse4) (= (select .cse5 (+ (* .cse4 4) |c_~#queue~0.offset|)) 0)))))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_811 (Array Int Int)) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (|~#stored_elements~0.offset| Int) (v_subst_1 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse17 (store .cse1 |c_~#stored_elements~0.base| (store .cse12 (+ 4 |~#stored_elements~0.offset| .cse13) |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse16 (store (store (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store (store .cse18 .cse6 (+ (select .cse18 .cse6) 1)) (+ (* (select .cse18 .cse10) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse11 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse10 (+ v_subst_3 1)))) (let ((.cse14 (store (select (store .cse17 |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_1))) (or (not (= (select (select (store (store .cse1 |c_~#stored_elements~0.base| .cse14) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) (+ .cse3 4 |~#stored_elements~0.offset|)) 1)) (not (= (let ((.cse15 (select (store (store .cse1 |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base| .cse14) |c_~#queue~0.base|))) (select .cse15 (+ (* 4 (select .cse15 .cse6)) |c_~#queue~0.offset|))) 0)) (< |v_t1Thread1of1ForFork1_~i~0#1_28| .cse0))))))))) is different from false [2024-11-17 12:07:16,869 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse19 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse20 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse19 .cse20 (+ (select .cse19 .cse20) 1)))))) (let ((.cse6 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse5 (* |c_t2Thread1of1ForFork0_~i~1#1| 4)) (.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse10 (+ 1608 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#queue~0.offset| 1604)) (.cse11 (select .cse2 |c_~#stored_elements~0.base|)) (.cse12 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_811 (Array Int Int)) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (|~#stored_elements~0.offset| Int) (v_subst_1 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse7 (store .cse2 |c_~#stored_elements~0.base| (store .cse11 (+ 4 |~#stored_elements~0.offset| .cse12) |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse3 (store (store (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)) (+ (* 4 (select .cse8 .cse9)) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse10 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse9 (+ v_subst_3 1)))) (let ((.cse4 (store (select (store .cse7 |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_1))) (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 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|))) 0)) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) (+ .cse5 4 |~#stored_elements~0.offset|)) 1)) (< |v_t1Thread1of1ForFork1_~i~0#1_28| .cse6)))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_811 (Array Int Int)) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (v_subst_2 Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse17 (store .cse2 |c_~#stored_elements~0.base| (store .cse11 (+ 4 |~#stored_elements~0.offset| .cse12) |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse16 (store (store (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store (store .cse18 .cse1 (+ (select .cse18 .cse1) 1)) (+ (* 4 (select .cse18 .cse9)) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse10 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse9 (+ v_subst_4 1)))) (let ((.cse15 (store (select (store .cse17 |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_2))) (let ((.cse13 (select (store (store .cse2 |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base|))) (let ((.cse14 (select .cse13 .cse1))) (or (= 0 (select .cse13 (+ (* .cse14 4) |c_~#queue~0.offset|))) (< |v_t1Thread1of1ForFork1_~i~0#1_28| .cse6) (= 400 .cse14) (not (= 0 (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) (+ .cse5 4 |~#stored_elements~0.offset|)))))))))))))) is different from false [2024-11-17 12:07:17,535 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse15 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse5 (* |c_t2Thread1of1ForFork0_~i~1#1| 4)) (.cse6 (+ 1600 |c_~#queue~0.offset|)) (.cse11 (+ 1608 |c_~#queue~0.offset|)) (.cse10 (+ |c_~#queue~0.offset| 1604)) (.cse12 (* |c_t1Thread1of1ForFork1_~i~0#1| 4)) (.cse14 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse16 (+ (select .cse13 .cse15) 1))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_811 (Array Int Int)) (v_subst_5 Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (v_subst_2 Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse13 .cse14 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse15 .cse16)))) (let ((.cse8 (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse12) |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse7 (store (store (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (store (store .cse9 .cse6 (+ (select .cse9 .cse6) 1)) (+ (* (select .cse9 .cse10) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse11 (+ v_subst_5 1)) .cse10 (+ v_subst_4 1)))) (let ((.cse4 (store (select (store .cse8 |c_~#queue~0.base| .cse7) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_2))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| .cse7) |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base|))) (let ((.cse1 (select .cse0 .cse6))) (or (= (select .cse0 (+ |c_~#queue~0.offset| (* 4 .cse1))) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_28| .cse2) (not (= (select (select (store (store .cse3 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) (+ .cse5 4 |~#stored_elements~0.offset|)) 0)) (= 400 .cse1))))))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_811 (Array Int Int)) (v_subst_6 Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (|~#stored_elements~0.offset| Int) (v_subst_1 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse18 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse13 .cse14 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse15 .cse16)))) (let ((.cse21 (store .cse18 |c_~#stored_elements~0.base| (store (select .cse18 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse12) |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse19 (store (store (let ((.cse22 (select .cse21 |c_~#queue~0.base|))) (store (store .cse22 .cse6 (+ (select .cse22 .cse6) 1)) (+ (* (select .cse22 .cse10) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse11 (+ v_subst_6 1)) .cse10 (+ v_subst_3 1)))) (let ((.cse20 (store (select (store .cse21 |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_1))) (or (< |v_t1Thread1of1ForFork1_~i~0#1_28| .cse2) (not (= (let ((.cse17 (select (store (store .cse18 |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base|))) (select .cse17 (+ (* (select .cse17 .cse6) 4) |c_~#queue~0.offset|))) 0)) (not (= (select (select (store (store .cse18 |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) (+ .cse5 4 |~#stored_elements~0.offset|)) 1))))))))))) is different from false [2024-11-17 12:07:18,554 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse15 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse5 (* |c_t2Thread1of1ForFork0_~i~1#1| 4)) (.cse2 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse6 (+ 1600 |c_~#queue~0.offset|)) (.cse11 (+ 1608 |c_~#queue~0.offset|)) (.cse10 (+ |c_~#queue~0.offset| 1604)) (.cse12 (* |c_t1Thread1of1ForFork1_~i~0#1| 4)) (.cse14 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse16 (+ (select .cse13 .cse15) 1))) (and (forall ((v_ArrVal_811 (Array Int Int)) (v_subst_7 Int) (v_subst_5 Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (v_subst_2 Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse13 .cse14 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse15 .cse16)))) (let ((.cse8 (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse12) |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse7 (store (store (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (store (store .cse9 .cse6 (+ (select .cse9 .cse6) 1)) (+ (* (select .cse9 .cse10) 4) |c_~#queue~0.offset|) v_subst_7)) .cse11 (+ v_subst_5 1)) .cse10 (+ v_subst_4 1)))) (let ((.cse4 (store (select (store .cse8 |c_~#queue~0.base| .cse7) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_2))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| .cse7) |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base|))) (let ((.cse1 (select .cse0 .cse6))) (or (= (select .cse0 (+ |c_~#queue~0.offset| (* .cse1 4))) 0) (= 400 .cse1) (< |v_t1Thread1of1ForFork1_~i~0#1_28| .cse2) (not (= (select (select (store (store .cse3 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) (+ .cse5 4 |~#stored_elements~0.offset|)) 0)))))))))) (forall ((v_ArrVal_811 (Array Int Int)) (v_subst_8 Int) (v_subst_6 Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (|~#stored_elements~0.offset| Int) (v_subst_1 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse18 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse13 .cse14 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse15 .cse16)))) (let ((.cse21 (store .cse18 |c_~#stored_elements~0.base| (store (select .cse18 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse12) |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse19 (store (store (let ((.cse22 (select .cse21 |c_~#queue~0.base|))) (store (store .cse22 .cse6 (+ (select .cse22 .cse6) 1)) (+ (* (select .cse22 .cse10) 4) |c_~#queue~0.offset|) v_subst_8)) .cse11 (+ v_subst_6 1)) .cse10 (+ v_subst_3 1)))) (let ((.cse20 (store (select (store .cse21 |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_1))) (or (not (= (let ((.cse17 (select (store (store .cse18 |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base|))) (select .cse17 (+ |c_~#queue~0.offset| (* (select .cse17 .cse6) 4)))) 0)) (not (= (select (select (store (store .cse18 |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) (+ .cse5 4 |~#stored_elements~0.offset|)) 1)) (< |v_t1Thread1of1ForFork1_~i~0#1_28| .cse2)))))))))) is different from false [2024-11-17 12:07:19,279 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse12 (let ((.cse23 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse23 (+ (* (select .cse23 .cse14) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_enqueue_~x#1|)))) (let ((.cse6 (* |c_t2Thread1of1ForFork0_~i~1#1| 4)) (.cse0 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse10 (+ 1608 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#queue~0.offset| 1604)) (.cse11 (* |c_t1Thread1of1ForFork1_~i~0#1| 4)) (.cse13 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse15 (+ (select .cse12 .cse14) 1))) (and (forall ((v_ArrVal_811 (Array Int Int)) (v_subst_8 Int) (v_subst_6 Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (|~#stored_elements~0.offset| Int) (v_subst_1 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse12 .cse13 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse14 .cse15)))) (let ((.cse7 (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse11) |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse4 (store (store (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store (store .cse8 .cse2 (+ 1 (select .cse8 .cse2))) (+ |c_~#queue~0.offset| (* (select .cse8 .cse9) 4)) v_subst_8)) .cse10 (+ v_subst_6 1)) .cse9 (+ v_subst_3 1)))) (let ((.cse5 (store (select (store .cse7 |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_1))) (or (< |v_t1Thread1of1ForFork1_~i~0#1_28| .cse0) (not (= (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base|))) (select .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)))) 0)) (not (= (select (select (store (store .cse3 |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) (+ .cse6 4 |~#stored_elements~0.offset|)) 1)))))))) (forall ((v_ArrVal_811 (Array Int Int)) (v_subst_7 Int) (v_subst_5 Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (v_subst_2 Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse18 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse12 .cse13 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse14 .cse15)))) (let ((.cse21 (store .cse18 |c_~#stored_elements~0.base| (store (select .cse18 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse11) |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse20 (store (store (let ((.cse22 (select .cse21 |c_~#queue~0.base|))) (store (store .cse22 .cse2 (+ 1 (select .cse22 .cse2))) (+ |c_~#queue~0.offset| (* (select .cse22 .cse9) 4)) v_subst_7)) .cse10 (+ v_subst_5 1)) .cse9 (+ v_subst_4 1)))) (let ((.cse19 (store (select (store .cse21 |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_2))) (let ((.cse16 (select (store (store .cse18 |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (let ((.cse17 (select .cse16 .cse2))) (or (= (select .cse16 (+ (* .cse17 4) |c_~#queue~0.offset|)) 0) (= 400 .cse17) (not (= (select (select (store (store .cse18 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) (+ .cse6 4 |~#stored_elements~0.offset|)) 0)) (< |v_t1Thread1of1ForFork1_~i~0#1_28| .cse0))))))))))))) is different from false [2024-11-17 12:07:20,059 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse13 (let ((.cse23 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse23 (+ (* (select .cse23 .cse15) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_enqueue_#in~x#1|)))) (let ((.cse2 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse5 (* |c_t2Thread1of1ForFork0_~i~1#1| 4)) (.cse6 (+ 1600 |c_~#queue~0.offset|)) (.cse11 (+ 1608 |c_~#queue~0.offset|)) (.cse10 (+ |c_~#queue~0.offset| 1604)) (.cse12 (* |c_t1Thread1of1ForFork1_~i~0#1| 4)) (.cse14 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse16 (+ (select .cse13 .cse15) 1))) (and (forall ((v_ArrVal_811 (Array Int Int)) (v_subst_7 Int) (v_subst_5 Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (v_subst_2 Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse13 .cse14 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse15 .cse16)))) (let ((.cse8 (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse12) |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse7 (store (store (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (store (store .cse9 .cse6 (+ 1 (select .cse9 .cse6))) (+ (* 4 (select .cse9 .cse10)) |c_~#queue~0.offset|) v_subst_7)) .cse11 (+ v_subst_5 1)) .cse10 (+ v_subst_4 1)))) (let ((.cse4 (store (select (store .cse8 |c_~#queue~0.base| .cse7) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_2))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| .cse7) |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base|))) (let ((.cse1 (select .cse0 .cse6))) (or (= (select .cse0 (+ |c_~#queue~0.offset| (* 4 .cse1))) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_28| .cse2) (not (= (select (select (store (store .cse3 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) (+ .cse5 4 |~#stored_elements~0.offset|)) 0)) (= 400 .cse1))))))))) (forall ((v_ArrVal_811 (Array Int Int)) (v_subst_8 Int) (v_subst_6 Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (|~#stored_elements~0.offset| Int) (v_subst_1 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse18 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse13 .cse14 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse15 .cse16)))) (let ((.cse21 (store .cse18 |c_~#stored_elements~0.base| (store (select .cse18 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse12) |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse19 (store (store (let ((.cse22 (select .cse21 |c_~#queue~0.base|))) (store (store .cse22 .cse6 (+ 1 (select .cse22 .cse6))) (+ (* 4 (select .cse22 .cse10)) |c_~#queue~0.offset|) v_subst_8)) .cse11 (+ v_subst_6 1)) .cse10 (+ v_subst_3 1)))) (let ((.cse20 (store (select (store .cse21 |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_1))) (or (< |v_t1Thread1of1ForFork1_~i~0#1_28| .cse2) (not (= (let ((.cse17 (select (store (store .cse18 |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base|))) (select .cse17 (+ |c_~#queue~0.offset| (* (select .cse17 .cse6) 4)))) 0)) (not (= (select (select (store (store .cse18 |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) (+ .cse5 4 |~#stored_elements~0.offset|)) 1)))))))))))) is different from false [2024-11-17 12:07:20,860 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse13 (let ((.cse23 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (store .cse23 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* (select .cse23 .cse15) 4)) |c_t1Thread1of1ForFork1_enqueue_#in~x#1|)))) (let ((.cse2 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse5 (* |c_t2Thread1of1ForFork0_~i~1#1| 4)) (.cse6 (+ 1600 |c_~#queue~0.offset|)) (.cse11 (+ 1608 |c_~#queue~0.offset|)) (.cse10 (+ |c_~#queue~0.offset| 1604)) (.cse12 (* |c_t1Thread1of1ForFork1_~i~0#1| 4)) (.cse14 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse16 (+ (select .cse13 .cse15) 1))) (and (forall ((v_ArrVal_811 (Array Int Int)) (v_subst_7 Int) (v_subst_5 Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (v_subst_2 Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse13 .cse14 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse15 .cse16)))) (let ((.cse8 (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse12) |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse7 (store (store (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (store (store .cse9 .cse6 (+ (select .cse9 .cse6) 1)) (+ (* (select .cse9 .cse10) 4) |c_~#queue~0.offset|) v_subst_7)) .cse11 (+ v_subst_5 1)) .cse10 (+ v_subst_4 1)))) (let ((.cse4 (store (select (store .cse8 |c_~#queue~0.base| .cse7) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_2))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| .cse7) |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base|))) (let ((.cse1 (select .cse0 .cse6))) (or (= (select .cse0 (+ (* 4 .cse1) |c_~#queue~0.offset|)) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_28| .cse2) (not (= 0 (select (select (store (store .cse3 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) (+ .cse5 4 |~#stored_elements~0.offset|)))) (= 400 .cse1))))))))) (forall ((v_ArrVal_811 (Array Int Int)) (v_subst_8 Int) (v_subst_6 Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (|~#stored_elements~0.offset| Int) (v_subst_1 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse18 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse13 .cse14 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse15 .cse16)))) (let ((.cse21 (store .cse18 |c_~#stored_elements~0.base| (store (select .cse18 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse12) |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse19 (store (store (let ((.cse22 (select .cse21 |c_~#queue~0.base|))) (store (store .cse22 .cse6 (+ (select .cse22 .cse6) 1)) (+ (* (select .cse22 .cse10) 4) |c_~#queue~0.offset|) v_subst_8)) .cse11 (+ v_subst_6 1)) .cse10 (+ v_subst_3 1)))) (let ((.cse20 (store (select (store .cse21 |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_1))) (or (< |v_t1Thread1of1ForFork1_~i~0#1_28| .cse2) (not (= (let ((.cse17 (select (store (store .cse18 |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base|))) (select .cse17 (+ (* (select .cse17 .cse6) 4) |c_~#queue~0.offset|))) 0)) (not (= (select (select (store (store .cse18 |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) (+ .cse5 4 |~#stored_elements~0.offset|)) 1)))))))))))) is different from false [2024-11-17 12:07:22,454 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse9 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (* |c_t2Thread1of1ForFork0_~i~1#1| 4)) (.cse3 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse5 (+ 1600 |c_~#queue~0.offset|)) (.cse12 (* |c_t1Thread1of1ForFork1_~i~0#1| 4)) (.cse11 (+ 1608 |c_~#queue~0.offset|)) (.cse15 (+ (* (select .cse14 .cse9) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_811 (Array Int Int)) (v_subst_7 Int) (v_subst_5 Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (v_subst_2 Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse10 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse13 (store .cse14 .cse15 |t1Thread1of1ForFork1_~value~0#1|))) (store (store .cse13 .cse11 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse9 (+ (select .cse13 .cse9) 1)))))) (let ((.cse7 (store (select .cse10 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse12) |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse6 (store (store (let ((.cse8 (select (store .cse10 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base|))) (store (store .cse8 .cse5 (+ (select .cse8 .cse5) 1)) (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) v_subst_7)) .cse11 (+ v_subst_5 1)) .cse9 (+ v_subst_4 1)))) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_2))) (let ((.cse4 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|))) (let ((.cse2 (select .cse4 .cse5))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) (+ .cse1 4 |~#stored_elements~0.offset|)) 0)) (= 400 .cse2) (< |v_t1Thread1of1ForFork1_~i~0#1_28| .cse3) (= (select .cse4 (+ (* .cse2 4) |c_~#queue~0.offset|)) 0))))))))) (forall ((v_ArrVal_811 (Array Int Int)) (v_subst_8 Int) (v_subst_6 Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (|~#stored_elements~0.offset| Int) (v_subst_1 Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse21 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse22 (store .cse14 .cse15 |t1Thread1of1ForFork1_~value~0#1|))) (store (store .cse22 .cse11 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse9 (+ (select .cse22 .cse9) 1)))))) (let ((.cse19 (store (select .cse21 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse12) |t1Thread1of1ForFork1_~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 .cse5 (+ (select .cse20 .cse5) 1)) (+ (* (select .cse20 .cse9) 4) |c_~#queue~0.offset|) v_subst_8)) .cse11 (+ v_subst_6 1)) .cse9 (+ v_subst_3 1)))) (let ((.cse16 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_1))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) (+ .cse1 4 |~#stored_elements~0.offset|)) 1)) (< |v_t1Thread1of1ForFork1_~i~0#1_28| .cse3) (not (= (let ((.cse17 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base|))) (select .cse17 (+ (* (select .cse17 .cse5) 4) |c_~#queue~0.offset|))) 0))))))))))) is different from false [2024-11-17 12:07:24,154 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse8 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse11 (* |c_t1Thread1of1ForFork1_~i~0#1| 4)) (.cse10 (+ 1608 |c_~#queue~0.offset|)) (.cse14 (+ (* (select .cse13 .cse8) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_811 (Array Int Int)) (v_subst_7 Int) (v_subst_5 Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (v_subst_2 Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse9 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse12 (store .cse13 .cse14 |t1Thread1of1ForFork1_~value~0#1|))) (store (store .cse12 .cse10 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse8 (+ (select .cse12 .cse8) 1)))))) (let ((.cse6 (store (select .cse9 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse11) |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse5 (store (store (let ((.cse7 (select (store .cse9 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse7 .cse4 (+ (select .cse7 .cse4) 1)) (+ (* (select .cse7 .cse8) 4) |c_~#queue~0.offset|) v_subst_7)) .cse10 (+ v_subst_5 1)) .cse8 (+ v_subst_4 1)))) (let ((.cse2 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_2))) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base|))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (< |v_t1Thread1of1ForFork1_~i~0#1_28| .cse1) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset|)) 0)) (= (select .cse3 (+ (* .cse0 4) |c_~#queue~0.offset|)) 0))))))))) (forall ((v_ArrVal_811 (Array Int Int)) (v_subst_8 Int) (v_subst_6 Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (|~#stored_elements~0.offset| Int) (v_subst_1 Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse20 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse21 (store .cse13 .cse14 |t1Thread1of1ForFork1_~value~0#1|))) (store (store .cse21 .cse10 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse8 (+ (select .cse21 .cse8) 1)))))) (let ((.cse18 (store (select .cse20 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| .cse11) |t1Thread1of1ForFork1_~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 .cse4 (+ (select .cse19 .cse4) 1)) (+ (* (select .cse19 .cse8) 4) |c_~#queue~0.offset|) v_subst_8)) .cse10 (+ v_subst_6 1)) .cse8 (+ v_subst_3 1)))) (let ((.cse15 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_1))) (or (< |v_t1Thread1of1ForFork1_~i~0#1_28| .cse1) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset|)) 1)) (not (= (let ((.cse16 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base|))) (select .cse16 (+ (* (select .cse16 .cse4) 4) |c_~#queue~0.offset|))) 0))))))))))) is different from false [2024-11-17 12:07:25,923 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse7 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (+ 1600 |c_~#queue~0.offset|)) (.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse12 (+ (* (select .cse11 .cse7) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_811 (Array Int Int)) (v_subst_8 Int) (v_subst_6 Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (|~#stored_elements~0.offset| Int) (v_subst_1 Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse8 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse10 (store .cse11 .cse12 |t1Thread1of1ForFork1_~value~0#1|))) (store (store .cse10 .cse9 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse7 (+ (select .cse10 .cse7) 1))))) (.cse1 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse5 (store (select .cse8 |c_~#stored_elements~0.base|) .cse1 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse4 (store (store (let ((.cse6 (select (store .cse8 |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base|))) (store (store .cse6 .cse3 (+ (select .cse6 .cse3) 1)) (+ (* (select .cse6 .cse7) 4) |c_~#queue~0.offset|) v_subst_8)) .cse9 (+ v_subst_6 1)) .cse7 (+ v_subst_3 1)))) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_1))) (or (< |v_t1Thread1of1ForFork1_~i~0#1_28| 1) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) .cse1) 1)) (not (= (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|))) (select .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|))) 0)))))))) (forall ((v_ArrVal_811 (Array Int Int)) (v_subst_7 Int) (v_subst_5 Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (v_subst_2 Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse20 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse21 (store .cse11 .cse12 |t1Thread1of1ForFork1_~value~0#1|))) (store (store .cse21 .cse9 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse7 (+ (select .cse21 .cse7) 1))))) (.cse16 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse18 (store (select .cse20 |c_~#stored_elements~0.base|) .cse16 |t1Thread1of1ForFork1_~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 .cse3 (+ (select .cse19 .cse3) 1)) (+ (* (select .cse19 .cse7) 4) |c_~#queue~0.offset|) v_subst_7)) .cse9 (+ v_subst_5 1)) .cse7 (+ v_subst_4 1)))) (let ((.cse15 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_2))) (let ((.cse13 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base|))) (let ((.cse14 (select .cse13 .cse3))) (or (= (select .cse13 (+ (* .cse14 4) |c_~#queue~0.offset|)) 0) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) .cse16) 0)) (< |v_t1Thread1of1ForFork1_~i~0#1_28| 1) (= 400 .cse14)))))))))))) is different from false [2024-11-17 12:07:29,679 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1600 |c_~#queue~0.offset|)) (.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_798 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_subst_8 Int) (v_subst_6 Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (|~#stored_elements~0.offset| Int) (v_subst_1 Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse10 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_798))) (let ((.cse8 (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ (* 4 (select .cse12 .cse7)) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse11 .cse9 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse7 (+ (select .cse11 .cse7) 1)))) (.cse1 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse5 (store (select (store .cse10 |c_~#queue~0.base| .cse8) |c_~#stored_elements~0.base|) .cse1 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse4 (store (store (let ((.cse6 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse8) |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base|))) (store (store .cse6 .cse3 (+ (select .cse6 .cse3) 1)) (+ (* 4 (select .cse6 .cse7)) |c_~#queue~0.offset|) v_subst_8)) .cse9 (+ v_subst_6 1)) .cse7 (+ v_subst_3 1)))) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_1))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) .cse1) 1)) (not (= (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|))) (select .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)))) 0)) (< |v_t1Thread1of1ForFork1_~i~0#1_28| 1)))))))) (forall ((v_ArrVal_798 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_subst_7 Int) (v_subst_5 Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (v_subst_2 Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse21 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_798))) (let ((.cse20 (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ (* 4 (select .cse23 .cse7)) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse22 .cse9 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse7 (+ (select .cse22 .cse7) 1)))) (.cse16 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse18 (store (select (store .cse21 |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base|) .cse16 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse17 (store (store (let ((.cse19 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base|))) (store (store .cse19 .cse3 (+ (select .cse19 .cse3) 1)) (+ (* 4 (select .cse19 .cse7)) |c_~#queue~0.offset|) v_subst_7)) .cse9 (+ v_subst_5 1)) .cse7 (+ v_subst_4 1)))) (let ((.cse15 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_2))) (let ((.cse13 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse17) |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base|))) (let ((.cse14 (select .cse13 .cse3))) (or (= (select .cse13 (+ |c_~#queue~0.offset| (* .cse14 4))) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_28| 1) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) .cse16) 0)) (= 400 .cse14)))))))))))) is different from false [2024-11-17 12:07:34,627 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 1600 |c_~#queue~0.offset|)) (.cse11 (+ 1608 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (and (forall ((v_ArrVal_798 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_subst_7 Int) (v_subst_5 Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (v_subst_2 Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse12 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_798))) (let ((.cse10 (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ (* 4 (select .cse14 .cse9)) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse13 .cse11 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse9 (+ (select .cse13 .cse9) 1)))) (.cse4 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse7 (store (select (store .cse12 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base|) .cse4 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse6 (store (store (let ((.cse8 (select (store (store .cse2 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base|))) (store (store .cse8 .cse5 (+ (select .cse8 .cse5) 1)) (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) v_subst_7)) .cse11 (+ v_subst_5 1)) .cse9 (+ v_subst_4 1)))) (let ((.cse3 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_2))) (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base|))) (let ((.cse1 (select .cse0 .cse5))) (or (= (select .cse0 (+ (* .cse1 4) |c_~#queue~0.offset|)) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_28| 1) (= 400 .cse1) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) .cse4) 0))))))))))) (forall ((v_ArrVal_798 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_subst_8 Int) (v_subst_6 Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (|~#stored_elements~0.offset| Int) (v_subst_1 Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse22 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_798))) (let ((.cse21 (let ((.cse23 (let ((.cse24 (select .cse22 |c_~#queue~0.base|))) (store .cse24 (+ (* 4 (select .cse24 .cse9)) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse23 .cse11 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse9 (+ (select .cse23 .cse9) 1)))) (.cse16 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse19 (store (select (store .cse22 |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base|) .cse16 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse18 (store (store (let ((.cse20 (select (store (store .cse2 |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (store (store .cse20 .cse5 (+ (select .cse20 .cse5) 1)) (+ (* (select .cse20 .cse9) 4) |c_~#queue~0.offset|) v_subst_8)) .cse11 (+ v_subst_6 1)) .cse9 (+ v_subst_3 1)))) (let ((.cse15 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_1))) (or (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) .cse16) 1)) (< |v_t1Thread1of1ForFork1_~i~0#1_28| 1) (not (= (let ((.cse17 (select (store (store .cse2 |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base|))) (select .cse17 (+ (* (select .cse17 .cse5) 4) |c_~#queue~0.offset|))) 0))))))))))) is different from false [2024-11-17 12:07:35,238 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse10 (+ 1608 |c_~#queue~0.offset|)) (.cse8 (+ |c_~#queue~0.offset| 1604)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))) (and (forall ((v_ArrVal_798 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_subst_8 Int) (v_subst_6 Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (|~#stored_elements~0.offset| Int) (v_subst_1 Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse11 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_798))) (let ((.cse9 (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* (select .cse13 .cse8) 4)) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse12 .cse10 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse8 (+ (select .cse12 .cse8) 1)))) (.cse2 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse6 (store (select (store .cse11 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse5 (store (store (let ((.cse7 (select (store (store .cse0 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse7 .cse4 (+ (select .cse7 .cse4) 1)) (+ (* (select .cse7 .cse8) 4) |c_~#queue~0.offset|) v_subst_8)) .cse10 (+ v_subst_6 1)) .cse8 (+ 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|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_1))) (or (< |v_t1Thread1of1ForFork1_~i~0#1_28| 1) (not (= 1 (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) .cse2))) (not (= (let ((.cse3 (select (store (store .cse0 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|))) 0))))))))) (forall ((v_ArrVal_798 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_subst_7 Int) (v_subst_5 Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (v_subst_2 Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse22 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_798))) (let ((.cse21 (let ((.cse23 (let ((.cse24 (select .cse22 |c_~#queue~0.base|))) (store .cse24 (+ |c_~#queue~0.offset| (* (select .cse24 .cse8) 4)) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse23 .cse10 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse8 (+ (select .cse23 .cse8) 1)))) (.cse15 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse19 (store (select (store .cse22 |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base|) .cse15 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse18 (store (store (let ((.cse20 (select (store (store .cse0 |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (store (store .cse20 .cse4 (+ (select .cse20 .cse4) 1)) (+ (* (select .cse20 .cse8) 4) |c_~#queue~0.offset|) v_subst_7)) .cse10 (+ v_subst_5 1)) .cse8 (+ v_subst_4 1)))) (let ((.cse14 (store (select (store (store .cse0 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_2))) (let ((.cse16 (select (store (store .cse0 |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base| .cse14) |c_~#queue~0.base|))) (let ((.cse17 (select .cse16 .cse4))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse14) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) .cse15) 0)) (< |v_t1Thread1of1ForFork1_~i~0#1_28| 1) (= (select .cse16 (+ |c_~#queue~0.offset| (* .cse17 4))) 0) (= 400 .cse17)))))))))))) is different from false [2024-11-17 12:07:35,790 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse10 (+ 1608 |c_~#queue~0.offset|)) (.cse8 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse25 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse26 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse25 .cse26 (+ (select .cse25 .cse26) 1)))))) (and (forall ((v_ArrVal_798 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_subst_8 Int) (v_subst_6 Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (|~#stored_elements~0.offset| Int) (v_subst_1 Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse11 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_798))) (let ((.cse9 (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* (select .cse13 .cse8) 4)) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse12 .cse10 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse8 (+ (select .cse12 .cse8) 1)))) (.cse5 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse6 (store (select (store .cse11 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse3 (store (store (let ((.cse7 (select (store (store .cse2 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse7 .cse1 (+ (select .cse7 .cse1) 1)) (+ |c_~#queue~0.offset| (* (select .cse7 .cse8) 4)) v_subst_8)) .cse10 (+ v_subst_6 1)) .cse8 (+ 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|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_1))) (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)) (< |v_t1Thread1of1ForFork1_~i~0#1_28| 1) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) .cse5) 1))))))))) (forall ((v_ArrVal_798 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_subst_7 Int) (v_subst_5 Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (v_subst_2 Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse22 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_798))) (let ((.cse21 (let ((.cse23 (let ((.cse24 (select .cse22 |c_~#queue~0.base|))) (store .cse24 (+ |c_~#queue~0.offset| (* (select .cse24 .cse8) 4)) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse23 .cse10 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse8 (+ (select .cse23 .cse8) 1)))) (.cse17 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse19 (store (select (store .cse22 |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base|) .cse17 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse18 (store (store (let ((.cse20 (select (store (store .cse2 |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (store (store .cse20 .cse1 (+ (select .cse20 .cse1) 1)) (+ |c_~#queue~0.offset| (* (select .cse20 .cse8) 4)) v_subst_7)) .cse10 (+ v_subst_5 1)) .cse8 (+ v_subst_4 1)))) (let ((.cse16 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_2))) (let ((.cse14 (select (store (store .cse2 |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base|))) (let ((.cse15 (select .cse14 .cse1))) (or (= 0 (select .cse14 (+ (* .cse15 4) |c_~#queue~0.offset|))) (< |v_t1Thread1of1ForFork1_~i~0#1_28| 1) (= 400 .cse15) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) .cse17) 0))))))))))))) is different from false [2024-11-17 12:07:40,589 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse16 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse10 (+ 1608 |c_~#queue~0.offset|)) (.cse8 (+ |c_~#queue~0.offset| 1604)) (.cse15 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse17 (+ (select .cse14 .cse16) 1))) (and (forall ((v_ArrVal_798 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_subst_9 Int) (v_subst_8 Int) (v_subst_6 Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (|~#stored_elements~0.offset| Int) (v_subst_1 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse14 .cse15 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse16 .cse17)))) (let ((.cse11 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_798))) (let ((.cse9 (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse12 .cse10 (+ v_subst_9 1)) .cse8 (+ (select .cse12 .cse8) 1)))) (.cse2 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse6 (store (select (store .cse11 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse5 (store (store (let ((.cse7 (select (store (store .cse0 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse7 .cse4 (+ (select .cse7 .cse4) 1)) (+ (* (select .cse7 .cse8) 4) |c_~#queue~0.offset|) v_subst_8)) .cse10 (+ v_subst_6 1)) .cse8 (+ 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|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_1))) (or (< |v_t1Thread1of1ForFork1_~i~0#1_28| 1) (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_811) |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_798 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_subst_7 Int) (v_subst_5 Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (v_subst_2 Int) (|~#stored_elements~0.offset| Int) (v_subst_10 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse20 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse14 .cse15 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse16 .cse17)))) (let ((.cse27 (store .cse20 |c_~#stored_elements~0.base| v_ArrVal_798))) (let ((.cse26 (let ((.cse28 (let ((.cse29 (select .cse27 |c_~#queue~0.base|))) (store .cse29 (+ (* (select .cse29 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse28 .cse10 (+ v_subst_10 1)) .cse8 (+ (select .cse28 .cse8) 1)))) (.cse22 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse24 (store (select (store .cse27 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base|) .cse22 |t1Thread1of1ForFork1_~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 .cse8) 4) |c_~#queue~0.offset|) v_subst_7)) .cse10 (+ v_subst_5 1)) .cse8 (+ v_subst_4 1)))) (let ((.cse21 (store (select (store (store .cse20 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_2))) (let ((.cse18 (select (store (store .cse20 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base|))) (let ((.cse19 (select .cse18 .cse4))) (or (= (select .cse18 (+ |c_~#queue~0.offset| (* .cse19 4))) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_28| 1) (not (= (select (select (store (store .cse20 |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) .cse22) 0)) (= 400 .cse19)))))))))))))) is different from false [2024-11-17 12:07:45,599 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse10 (+ 1608 |c_~#queue~0.offset|)) (.cse8 (+ |c_~#queue~0.offset| 1604)) (.cse15 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse16 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse17 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse18 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_798 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_793 Int) (v_subst_9 Int) (v_subst_8 Int) (v_subst_6 Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (|~#stored_elements~0.offset| Int) (v_subst_1 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse14 (store .cse17 .cse18 v_ArrVal_793))) (store (store .cse14 .cse15 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse16 (+ (select .cse14 .cse16) 1)))))) (let ((.cse11 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_798))) (let ((.cse9 (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse12 .cse10 (+ v_subst_9 1)) .cse8 (+ (select .cse12 .cse8) 1)))) (.cse2 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse6 (store (select (store .cse11 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse5 (store (store (let ((.cse7 (select (store (store .cse0 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse7 .cse4 (+ (select .cse7 .cse4) 1)) (+ (* (select .cse7 .cse8) 4) |c_~#queue~0.offset|) v_subst_8)) .cse10 (+ v_subst_6 1)) .cse8 (+ 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|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_1))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) .cse2) 1)) (< |v_t1Thread1of1ForFork1_~i~0#1_28| 1) (not (= (let ((.cse3 (select (store (store .cse0 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)))) 0)))))))))) (forall ((v_ArrVal_798 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_793 Int) (v_subst_7 Int) (v_subst_5 Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (v_subst_2 Int) (|~#stored_elements~0.offset| Int) (v_subst_10 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse21 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse31 (store .cse17 .cse18 v_ArrVal_793))) (store (store .cse31 .cse15 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse16 (+ (select .cse31 .cse16) 1)))))) (let ((.cse28 (store .cse21 |c_~#stored_elements~0.base| v_ArrVal_798))) (let ((.cse27 (let ((.cse29 (let ((.cse30 (select .cse28 |c_~#queue~0.base|))) (store .cse30 (+ (* (select .cse30 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse29 .cse10 (+ v_subst_10 1)) .cse8 (+ (select .cse29 .cse8) 1)))) (.cse23 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse25 (store (select (store .cse28 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base|) .cse23 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse24 (store (store (let ((.cse26 (select (store (store .cse21 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base|))) (store (store .cse26 .cse4 (+ (select .cse26 .cse4) 1)) (+ (* (select .cse26 .cse8) 4) |c_~#queue~0.offset|) v_subst_7)) .cse10 (+ v_subst_5 1)) .cse8 (+ v_subst_4 1)))) (let ((.cse22 (store (select (store (store .cse21 |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base| .cse24) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_2))) (let ((.cse19 (select (store (store .cse21 |c_~#queue~0.base| .cse24) |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base|))) (let ((.cse20 (select .cse19 .cse4))) (or (< |v_t1Thread1of1ForFork1_~i~0#1_28| 1) (= (select .cse19 (+ |c_~#queue~0.offset| (* 4 .cse20))) 0) (= 400 .cse20) (not (= (select (select (store (store .cse21 |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) .cse23) 0)))))))))))))) is different from false [2024-11-17 12:07:47,005 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse17 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse18 .cse17)) (.cse5 (+ 1600 |c_~#queue~0.offset|)) (.cse11 (+ 1608 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#queue~0.offset| 1604)) (.cse16 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_798 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_793 Int) (v_subst_9 Int) (v_subst_8 Int) (v_subst_6 Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (|~#stored_elements~0.offset| Int) (v_subst_1 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse15 (store .cse18 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_793))) (store (store .cse15 .cse16 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse17 (+ (select .cse15 .cse17) 1)))))) (let ((.cse12 (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_798))) (let ((.cse10 (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* (select .cse14 .cse9) 4)) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse13 .cse11 (+ v_subst_9 1)) .cse9 (+ (select .cse13 .cse9) 1)))) (.cse3 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse7 (store (select (store .cse12 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse6 (store (store (let ((.cse8 (select (store (store .cse1 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base|))) (store (store .cse8 .cse5 (+ (select .cse8 .cse5) 1)) (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) v_subst_8)) .cse11 (+ v_subst_6 1)) .cse9 (+ v_subst_3 1)))) (let ((.cse2 (store (select (store (store .cse1 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_1))) (or (not (= (select (select (store (store .cse1 |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) .cse3) 1)) (< |v_t1Thread1of1ForFork1_~i~0#1_28| 1) (not (= (let ((.cse4 (select (store (store .cse1 |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base|))) (select .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse5) 4)))) 0)))))))))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_798 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_793 Int) (v_subst_7 Int) (v_subst_5 Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (v_subst_2 Int) (|~#stored_elements~0.offset| Int) (v_subst_10 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse19 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse31 (store .cse18 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_793))) (store (store .cse31 .cse16 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse17 (+ (select .cse31 .cse17) 1)))))) (let ((.cse28 (store .cse19 |c_~#stored_elements~0.base| v_ArrVal_798))) (let ((.cse27 (let ((.cse29 (let ((.cse30 (select .cse28 |c_~#queue~0.base|))) (store .cse30 (+ |c_~#queue~0.offset| (* (select .cse30 .cse9) 4)) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse29 .cse11 (+ v_subst_10 1)) .cse9 (+ (select .cse29 .cse9) 1)))) (.cse21 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse25 (store (select (store .cse28 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base|) .cse21 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse24 (store (store (let ((.cse26 (select (store (store .cse19 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base|))) (store (store .cse26 .cse5 (+ (select .cse26 .cse5) 1)) (+ (* (select .cse26 .cse9) 4) |c_~#queue~0.offset|) v_subst_7)) .cse11 (+ v_subst_5 1)) .cse9 (+ v_subst_4 1)))) (let ((.cse20 (store (select (store (store .cse19 |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base| .cse24) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_2))) (let ((.cse23 (select (store (store .cse19 |c_~#queue~0.base| .cse24) |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base|))) (let ((.cse22 (select .cse23 .cse5))) (or (not (= (select (select (store (store .cse19 |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) .cse21) 0)) (< |v_t1Thread1of1ForFork1_~i~0#1_28| 1) (= 400 .cse22) (= (select .cse23 (+ |c_~#queue~0.offset| (* .cse22 4))) 0)))))))))))))))) is different from false [2024-11-17 12:07:50,503 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse19 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (.cse18 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse0 (select .cse19 .cse18)) (.cse6 (+ 1600 |c_~#queue~0.offset|)) (.cse12 (+ 1608 |c_~#queue~0.offset|)) (.cse10 (+ |c_~#queue~0.offset| 1604)) (.cse17 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_798 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_793 Int) (v_subst_7 Int) (v_subst_5 Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (v_subst_2 Int) (|~#stored_elements~0.offset| Int) (v_subst_10 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse16 (store .cse19 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4)) v_ArrVal_793))) (store (store .cse16 .cse17 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse18 (+ (select .cse16 .cse18) 1)))))) (let ((.cse13 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_798))) (let ((.cse11 (let ((.cse14 (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse10) 4)) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse14 .cse12 (+ v_subst_10 1)) .cse10 (+ (select .cse14 .cse10) 1)))) (.cse4 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse8 (store (select (store .cse13 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base|) .cse4 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse7 (store (store (let ((.cse9 (select (store (store .cse2 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base|))) (store (store .cse9 .cse6 (+ (select .cse9 .cse6) 1)) (+ (* (select .cse9 .cse10) 4) |c_~#queue~0.offset|) v_subst_7)) .cse12 (+ v_subst_5 1)) .cse10 (+ v_subst_4 1)))) (let ((.cse3 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base| .cse7) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_2))) (let ((.cse5 (select (store (store .cse2 |c_~#queue~0.base| .cse7) |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base|))) (let ((.cse1 (select .cse5 .cse6))) (or (< |v_t1Thread1of1ForFork1_~i~0#1_28| 1) (= .cse1 400) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) .cse4) 0)) (= (select .cse5 (+ |c_~#queue~0.offset| (* .cse1 4))) 0))))))))))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_798 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_793 Int) (v_subst_9 Int) (v_subst_8 Int) (v_subst_6 Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (|~#stored_elements~0.offset| Int) (v_subst_1 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse20 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse31 (store .cse19 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4)) v_ArrVal_793))) (store (store .cse31 .cse17 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse18 (+ (select .cse31 .cse18) 1)))))) (let ((.cse28 (store .cse20 |c_~#stored_elements~0.base| v_ArrVal_798))) (let ((.cse27 (let ((.cse29 (let ((.cse30 (select .cse28 |c_~#queue~0.base|))) (store .cse30 (+ |c_~#queue~0.offset| (* (select .cse30 .cse10) 4)) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse29 .cse12 (+ v_subst_9 1)) .cse10 (+ (select .cse29 .cse10) 1)))) (.cse22 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse25 (store (select (store .cse28 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base|) .cse22 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse24 (store (store (let ((.cse26 (select (store (store .cse20 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base|))) (store (store .cse26 .cse6 (+ (select .cse26 .cse6) 1)) (+ |c_~#queue~0.offset| (* (select .cse26 .cse10) 4)) v_subst_8)) .cse12 (+ v_subst_6 1)) .cse10 (+ v_subst_3 1)))) (let ((.cse21 (store (select (store (store .cse20 |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base| .cse24) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_1))) (or (< |v_t1Thread1of1ForFork1_~i~0#1_28| 1) (not (= (select (select (store (store .cse20 |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) .cse22) 1)) (not (= (let ((.cse23 (select (store (store .cse20 |c_~#queue~0.base| .cse24) |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base|))) (select .cse23 (+ |c_~#queue~0.offset| (* (select .cse23 .cse6) 4)))) 0))))))))))))))) is different from false [2024-11-17 12:07:55,278 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse9 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse15 .cse9)) (.cse5 (+ 1600 |c_~#queue~0.offset|)) (.cse11 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_798 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_793 Int) (v_subst_7 Int) (v_subst_5 Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (v_subst_2 Int) (|~#stored_elements~0.offset| Int) (v_subst_10 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse10 (let ((.cse12 (let ((.cse13 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse14 (store .cse15 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4) |c_~#queue~0.offset|) v_ArrVal_793))) (store (store .cse14 .cse11 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse9 (+ (select .cse14 .cse9) 1)))) |c_~#stored_elements~0.base| v_ArrVal_798) |c_~#queue~0.base|))) (store .cse13 (+ (* 4 (select .cse13 .cse9)) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse12 .cse11 (+ v_subst_10 1)) .cse9 (+ (select .cse12 .cse9) 1)))) (.cse4 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse7 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_798) |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base|) .cse4 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse6 (store (store (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base|))) (store (store .cse8 .cse5 (+ (select .cse8 .cse5) 1)) (+ |c_~#queue~0.offset| (* (select .cse8 .cse9) 4)) v_subst_7)) .cse11 (+ v_subst_5 1)) .cse9 (+ v_subst_4 1)))) (let ((.cse3 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_2))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base|))) (let ((.cse2 (select .cse1 .cse5))) (or (< |v_t1Thread1of1ForFork1_~i~0#1_28| 1) (= (select .cse1 (+ (* .cse2 4) |c_~#queue~0.offset|)) 0) (= .cse2 400) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) .cse4) 0)))))))))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_798 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_793 Int) (v_subst_9 Int) (v_subst_8 Int) (v_subst_6 Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (|~#stored_elements~0.offset| Int) (v_subst_1 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse22 (let ((.cse23 (let ((.cse24 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse25 (store .cse15 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4) |c_~#queue~0.offset|) v_ArrVal_793))) (store (store .cse25 .cse11 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse9 (+ (select .cse25 .cse9) 1)))) |c_~#stored_elements~0.base| v_ArrVal_798) |c_~#queue~0.base|))) (store .cse24 (+ (* 4 (select .cse24 .cse9)) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse23 .cse11 (+ v_subst_9 1)) .cse9 (+ (select .cse23 .cse9) 1)))) (.cse17 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse20 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_798) |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base|) .cse17 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse19 (store (store (let ((.cse21 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base|))) (store (store .cse21 .cse5 (+ (select .cse21 .cse5) 1)) (+ |c_~#queue~0.offset| (* (select .cse21 .cse9) 4)) v_subst_8)) .cse11 (+ v_subst_6 1)) .cse9 (+ v_subst_3 1)))) (let ((.cse16 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_1))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) .cse17) 1)) (< |v_t1Thread1of1ForFork1_~i~0#1_28| 1) (not (= (let ((.cse18 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base|))) (select .cse18 (+ (* (select .cse18 .cse5) 4) |c_~#queue~0.offset|))) 0))))))))))))) is different from false [2024-11-17 12:08:12,168 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) 0)))) (let ((.cse15 (select .cse1 |c_~#queue~0.base|)) (.cse9 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (+ 1600 |c_~#queue~0.offset|)) (.cse11 (+ 1608 |c_~#queue~0.offset|)) (.cse16 (select .cse15 .cse9))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| Int)) (or (forall ((v_ArrVal_798 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_793 Int) (v_subst_7 Int) (v_subst_5 Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (v_subst_2 Int) (|~#stored_elements~0.offset| Int) (v_subst_10 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse10 (let ((.cse12 (let ((.cse13 (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse14 (store .cse15 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4) |c_~#queue~0.offset|) v_ArrVal_793))) (store (store .cse14 .cse11 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse9 (+ (select .cse14 .cse9) 1)))) |c_~#stored_elements~0.base| v_ArrVal_798) |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse12 .cse11 (+ v_subst_10 1)) .cse9 (+ (select .cse12 .cse9) 1)))) (.cse3 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse7 (store (select (store (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_798) |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse6 (store (store (let ((.cse8 (select (store (store .cse1 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base|))) (store (store .cse8 .cse5 (+ (select .cse8 .cse5) 1)) (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) v_subst_7)) .cse11 (+ v_subst_5 1)) .cse9 (+ v_subst_4 1)))) (let ((.cse2 (store (select (store (store .cse1 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_2))) (let ((.cse4 (select (store (store .cse1 |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base|))) (let ((.cse0 (select .cse4 .cse5))) (or (= .cse0 400) (not (= (select (select (store (store .cse1 |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) .cse3) 0)) (< |v_t1Thread1of1ForFork1_~i~0#1_28| 1) (= (select .cse4 (+ |c_~#queue~0.offset| (* .cse0 4))) 0))))))))) (< .cse16 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59|))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| Int)) (or (forall ((v_ArrVal_798 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_793 Int) (v_subst_9 Int) (v_subst_8 Int) (v_subst_6 Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (|~#stored_elements~0.offset| Int) (v_subst_1 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse23 (let ((.cse24 (let ((.cse25 (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse26 (store .cse15 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4) |c_~#queue~0.offset|) v_ArrVal_793))) (store (store .cse26 .cse11 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse9 (+ (select .cse26 .cse9) 1)))) |c_~#stored_elements~0.base| v_ArrVal_798) |c_~#queue~0.base|))) (store .cse25 (+ (* (select .cse25 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse24 .cse11 (+ v_subst_9 1)) .cse9 (+ (select .cse24 .cse9) 1)))) (.cse20 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse21 (store (select (store (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_798) |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base|) .cse20 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse18 (store (store (let ((.cse22 (select (store (store .cse1 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base|))) (store (store .cse22 .cse5 (+ (select .cse22 .cse5) 1)) (+ |c_~#queue~0.offset| (* (select .cse22 .cse9) 4)) v_subst_8)) .cse11 (+ v_subst_6 1)) .cse9 (+ v_subst_3 1)))) (let ((.cse19 (store (select (store (store .cse1 |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_1))) (or (not (= (let ((.cse17 (select (store (store .cse1 |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (select .cse17 (+ (* (select .cse17 .cse5) 4) |c_~#queue~0.offset|))) 0)) (not (= (select (select (store (store .cse1 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) .cse20) 1)) (< |v_t1Thread1of1ForFork1_~i~0#1_28| 1))))))) (< .cse16 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59|))))))) is different from false [2024-11-17 12:08:12,838 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ |c_ULTIMATE.start_init_~q#1.offset| 1604) 0) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) 0)))) (let ((.cse16 (select .cse3 |c_~#queue~0.base|)) (.cse10 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (+ 1600 |c_~#queue~0.offset|)) (.cse12 (+ 1608 |c_~#queue~0.offset|)) (.cse0 (select .cse16 .cse10))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_798 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_793 Int) (v_subst_7 Int) (v_subst_5 Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (v_subst_2 Int) (|~#stored_elements~0.offset| Int) (v_subst_10 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse11 (let ((.cse13 (let ((.cse14 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse15 (store .cse16 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4) |c_~#queue~0.offset|) v_ArrVal_793))) (store (store .cse15 .cse12 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse10 (+ (select .cse15 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_798) |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* (select .cse14 .cse10) 4)) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse13 .cse12 (+ v_subst_10 1)) .cse10 (+ (select .cse13 .cse10) 1)))) (.cse5 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse8 (store (select (store (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_798) |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse7 (store (store (let ((.cse9 (select (store (store .cse3 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base|))) (store (store .cse9 .cse6 (+ (select .cse9 .cse6) 1)) (+ (* (select .cse9 .cse10) 4) |c_~#queue~0.offset|) v_subst_7)) .cse12 (+ v_subst_5 1)) .cse10 (+ v_subst_4 1)))) (let ((.cse4 (store (select (store (store .cse3 |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base| .cse7) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_2))) (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| .cse7) |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base|))) (let ((.cse2 (select .cse1 .cse6))) (or (= (select .cse1 (+ (* 4 .cse2) |c_~#queue~0.offset|)) 0) (= 400 .cse2) (not (= (select (select (store (store .cse3 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) .cse5) 0)) (< |v_t1Thread1of1ForFork1_~i~0#1_28| 1))))))))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| Int)) (or (forall ((v_ArrVal_798 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_793 Int) (v_subst_9 Int) (v_subst_8 Int) (v_subst_6 Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_~i~0#1_28| Int) (|~#stored_elements~0.offset| Int) (v_subst_1 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse23 (let ((.cse24 (let ((.cse25 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse26 (store .cse16 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4) |c_~#queue~0.offset|) v_ArrVal_793))) (store (store .cse26 .cse12 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse10 (+ (select .cse26 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_798) |c_~#queue~0.base|))) (store .cse25 (+ |c_~#queue~0.offset| (* (select .cse25 .cse10) 4)) |t1Thread1of1ForFork1_~value~0#1|)))) (store (store .cse24 .cse12 (+ v_subst_9 1)) .cse10 (+ (select .cse24 .cse10) 1)))) (.cse20 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse21 (store (select (store (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_798) |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base|) .cse20 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse18 (store (store (let ((.cse22 (select (store (store .cse3 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base|))) (store (store .cse22 .cse6 (+ (select .cse22 .cse6) 1)) (+ |c_~#queue~0.offset| (* (select .cse22 .cse10) 4)) v_subst_8)) .cse12 (+ v_subst_6 1)) .cse10 (+ v_subst_3 1)))) (let ((.cse19 (store (select (store (store .cse3 |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_28| 4) 4 |~#stored_elements~0.offset|) v_subst_1))) (or (< |v_t1Thread1of1ForFork1_~i~0#1_28| 1) (not (= (let ((.cse17 (select (store (store .cse3 |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (select .cse17 (+ (* (select .cse17 .cse6) 4) |c_~#queue~0.offset|))) 0)) (not (= (select (select (store (store .cse3 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| v_ArrVal_811) |c_~#stored_elements~0.base|) .cse20) 1)))))))) (< .cse0 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59|))))))) is different from false [2024-11-17 12:08:15,294 INFO L349 Elim1Store]: treesize reduction 462, result has 37.0 percent of original size [2024-11-17 12:08:15,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 16636 treesize of output 3066 [2024-11-17 12:08:15,519 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-17 12:08:15,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 4381 treesize of output 4101 [2024-11-17 12:08:15,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 12:08:15,569 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 4369 treesize of output 4367 [2024-11-17 12:08:15,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 12:08:15,841 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 59736285 treesize of output 49866675 Received shutdown request... [2024-11-17 12:13:56,924 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-17 12:13:56,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-17 12:13:56,946 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-11-17 12:13:56,946 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-11-17 12:13:56,946 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-11-17 12:13:57,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 12:13:57,125 WARN L596 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 1090 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-31-4-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-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-61-7-3-10-4-10-4-10-4-10-4-7-4-7-4-4-4-6-4-6-4-3-4-3-4-3-4-3-4-3-4-3-4-3-4-3-4-2-3-3-3-3-1 context. [2024-11-17 12:13:57,128 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 12:13:57,130 INFO L320 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork0 was TIMEOUT (3/3) [2024-11-17 12:13:57,131 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-17 12:13:57,131 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 12:13:57,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-11-17 12:13:57,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 12:13:57 BasicIcfg [2024-11-17 12:13:57,154 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 12:13:57,155 INFO L158 Benchmark]: Toolchain (without parser) took 816487.24ms. Allocated memory was 88.1MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 59.0MB in the beginning and 848.3MB in the end (delta: -789.3MB). Peak memory consumption was 920.7MB. Max. memory is 8.0GB. [2024-11-17 12:13:57,155 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 83.9MB. Free memory is still 36.9MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-17 12:13:57,155 INFO L158 Benchmark]: CACSL2BoogieTranslator took 675.24ms. Allocated memory is still 88.1MB. Free memory was 58.7MB in the beginning and 20.7MB in the end (delta: 38.0MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2024-11-17 12:13:57,155 INFO L158 Benchmark]: Boogie Procedure Inliner took 143.88ms. Allocated memory is still 88.1MB. Free memory was 20.5MB in the beginning and 52.0MB in the end (delta: -31.5MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. [2024-11-17 12:13:57,156 INFO L158 Benchmark]: Boogie Preprocessor took 89.59ms. Allocated memory is still 88.1MB. Free memory was 52.0MB in the beginning and 45.9MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2024-11-17 12:13:57,156 INFO L158 Benchmark]: RCFGBuilder took 1675.82ms. Allocated memory was 88.1MB in the beginning and 121.6MB in the end (delta: 33.6MB). Free memory was 45.9MB in the beginning and 67.6MB in the end (delta: -21.7MB). Peak memory consumption was 36.8MB. Max. memory is 8.0GB. [2024-11-17 12:13:57,156 INFO L158 Benchmark]: TraceAbstraction took 813896.03ms. Allocated memory was 121.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 67.0MB in the beginning and 848.3MB in the end (delta: -781.2MB). Peak memory consumption was 896.3MB. Max. memory is 8.0GB. [2024-11-17 12:13:57,159 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.28ms. Allocated memory is still 83.9MB. Free memory is still 36.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 675.24ms. Allocated memory is still 88.1MB. Free memory was 58.7MB in the beginning and 20.7MB in the end (delta: 38.0MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 143.88ms. Allocated memory is still 88.1MB. Free memory was 20.5MB in the beginning and 52.0MB in the end (delta: -31.5MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 89.59ms. Allocated memory is still 88.1MB. Free memory was 52.0MB in the beginning and 45.9MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 1675.82ms. Allocated memory was 88.1MB in the beginning and 121.6MB in the end (delta: 33.6MB). Free memory was 45.9MB in the beginning and 67.6MB in the end (delta: -21.7MB). Peak memory consumption was 36.8MB. Max. memory is 8.0GB. * TraceAbstraction took 813896.03ms. Allocated memory was 121.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 67.0MB in the beginning and 848.3MB in the end (delta: -781.2MB). Peak memory consumption was 896.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 14646, independent: 14466, independent conditional: 1872, independent unconditional: 12594, dependent: 180, dependent conditional: 149, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14502, independent: 14466, independent conditional: 1872, independent unconditional: 12594, dependent: 36, dependent conditional: 5, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14502, independent: 14466, independent conditional: 1872, independent unconditional: 12594, dependent: 36, dependent conditional: 5, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14520, independent: 14466, independent conditional: 1872, independent unconditional: 12594, dependent: 54, dependent conditional: 23, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14520, independent: 14466, independent conditional: 0, independent unconditional: 14466, dependent: 54, dependent conditional: 5, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14520, independent: 14466, independent conditional: 0, independent unconditional: 14466, dependent: 54, dependent conditional: 5, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11761, independent: 11728, independent conditional: 0, independent unconditional: 11728, dependent: 33, dependent conditional: 2, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11761, independent: 11724, independent conditional: 0, independent unconditional: 11724, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 37, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 33, dependent conditional: 2, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 37, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 33, dependent conditional: 2, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 340, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 270, dependent conditional: 18, dependent unconditional: 251, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 14520, independent: 2738, independent conditional: 0, independent unconditional: 2738, dependent: 21, dependent conditional: 3, dependent unconditional: 18, unknown: 11761, unknown conditional: 2, unknown unconditional: 11759] , Statistics on independence cache: Total cache size (in pairs): 11761, Positive cache size: 11728, Positive conditional cache size: 0, Positive unconditional cache size: 11728, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1890, Maximal queried relation: 4, Independence queries for same thread: 144, Persistent sets #1 benchmarks: Persistent set computation time: 0.5s, Number of persistent set computation: 1442, Number of trivial persistent sets: 1187, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12625, independent: 12594, independent conditional: 0, independent unconditional: 12594, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 14646, independent: 14466, independent conditional: 1872, independent unconditional: 12594, dependent: 180, dependent conditional: 149, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14502, independent: 14466, independent conditional: 1872, independent unconditional: 12594, dependent: 36, dependent conditional: 5, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14502, independent: 14466, independent conditional: 1872, independent unconditional: 12594, dependent: 36, dependent conditional: 5, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14520, independent: 14466, independent conditional: 1872, independent unconditional: 12594, dependent: 54, dependent conditional: 23, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14520, independent: 14466, independent conditional: 0, independent unconditional: 14466, dependent: 54, dependent conditional: 5, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14520, independent: 14466, independent conditional: 0, independent unconditional: 14466, dependent: 54, dependent conditional: 5, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11761, independent: 11728, independent conditional: 0, independent unconditional: 11728, dependent: 33, dependent conditional: 2, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11761, independent: 11724, independent conditional: 0, independent unconditional: 11724, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 37, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 33, dependent conditional: 2, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 37, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 33, dependent conditional: 2, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 340, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 270, dependent conditional: 18, dependent unconditional: 251, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 14520, independent: 2738, independent conditional: 0, independent unconditional: 2738, dependent: 21, dependent conditional: 3, dependent unconditional: 18, unknown: 11761, unknown conditional: 2, unknown unconditional: 11759] , Statistics on independence cache: Total cache size (in pairs): 11761, Positive cache size: 11728, Positive conditional cache size: 0, Positive unconditional cache size: 11728, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1890, Maximal queried relation: 4, Independence queries for same thread: 144 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6585, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 30, dependent conditional: 15, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 0, independent unconditional: 6555, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 0, independent unconditional: 6555, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 462, independent: 461, independent conditional: 0, independent unconditional: 461, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 462, independent: 461, independent conditional: 0, independent unconditional: 461, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 6570, independent: 6094, independent conditional: 0, independent unconditional: 6094, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 462, unknown conditional: 0, unknown unconditional: 462] , Statistics on independence cache: Total cache size (in pairs): 12221, Positive cache size: 12189, Positive conditional cache size: 0, Positive unconditional cache size: 12189, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 372, Maximal queried relation: 0, Independence queries for same thread: 15, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 1278, Number of trivial persistent sets: 1272, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6198, independent: 6183, independent conditional: 0, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6585, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 30, dependent conditional: 15, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 0, independent unconditional: 6555, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 0, independent unconditional: 6555, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 462, independent: 461, independent conditional: 0, independent unconditional: 461, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 462, independent: 461, independent conditional: 0, independent unconditional: 461, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 6570, independent: 6094, independent conditional: 0, independent unconditional: 6094, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 462, unknown conditional: 0, unknown unconditional: 462] , Statistics on independence cache: Total cache size (in pairs): 12221, Positive cache size: 12189, Positive conditional cache size: 0, Positive unconditional cache size: 12189, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 372, Maximal queried relation: 0, Independence queries for same thread: 15 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 17801, independent: 17140, independent conditional: 4955, independent unconditional: 12185, dependent: 661, dependent conditional: 617, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17184, independent: 17140, independent conditional: 4955, independent unconditional: 12185, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17184, independent: 17140, independent conditional: 4955, independent unconditional: 12185, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17184, independent: 17140, independent conditional: 4955, independent unconditional: 12185, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17184, independent: 17140, independent conditional: 0, independent unconditional: 17140, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17184, independent: 17140, independent conditional: 0, independent unconditional: 17140, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2465, independent: 2443, independent conditional: 0, independent unconditional: 2443, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2465, independent: 2440, independent conditional: 0, independent unconditional: 2440, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 25, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 25, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 128, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 17184, independent: 14697, independent conditional: 0, independent unconditional: 14697, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 2465, unknown conditional: 0, unknown unconditional: 2465] , Statistics on independence cache: Total cache size (in pairs): 14686, Positive cache size: 14632, Positive conditional cache size: 0, Positive unconditional cache size: 14632, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4955, Maximal queried relation: 0, Independence queries for same thread: 617, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 1245, Number of trivial persistent sets: 1165, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12229, independent: 12185, independent conditional: 0, independent unconditional: 12185, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 17801, independent: 17140, independent conditional: 4955, independent unconditional: 12185, dependent: 661, dependent conditional: 617, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17184, independent: 17140, independent conditional: 4955, independent unconditional: 12185, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17184, independent: 17140, independent conditional: 4955, independent unconditional: 12185, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17184, independent: 17140, independent conditional: 4955, independent unconditional: 12185, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17184, independent: 17140, independent conditional: 0, independent unconditional: 17140, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17184, independent: 17140, independent conditional: 0, independent unconditional: 17140, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2465, independent: 2443, independent conditional: 0, independent unconditional: 2443, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2465, independent: 2440, independent conditional: 0, independent unconditional: 2440, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 25, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 25, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 128, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 17184, independent: 14697, independent conditional: 0, independent unconditional: 14697, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 2465, unknown conditional: 0, unknown unconditional: 2465] , Statistics on independence cache: Total cache size (in pairs): 14686, Positive cache size: 14632, Positive conditional cache size: 0, Positive unconditional cache size: 14632, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4955, Maximal queried relation: 0, Independence queries for same thread: 617 - PositiveResult [Line: 1032]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1059]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 1090 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-31-4-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-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-61-7-3-10-4-10-4-10-4-10-4-7-4-7-4-4-4-6-4-6-4-3-4-3-4-3-4-3-4-3-4-3-4-3-4-3-4-2-3-3-3-3-1 context. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 1225 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 27.9s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 10.9s, 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: 58, 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.7s SatisfiabilityAnalysisTime, 15.6s InterpolantComputationTime, 6432 NumberOfCodeBlocks, 6432 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 6425 ConstructedInterpolants, 0 QuantifiedInterpolants, 13489 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 1225 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 855 NumberOfCodeBlocks, 855 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 854 ConstructedInterpolants, 0 QuantifiedInterpolants, 854 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t2Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 1225 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 785.2s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 103.7s, 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: 249, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 165.9s InterpolantComputationTime, 12171 NumberOfCodeBlocks, 12171 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 14327 ConstructedInterpolants, 408 QuantifiedInterpolants, 156349 SizeOfPredicates, 105 NumberOfNonLiveVariables, 4419 ConjunctsInSsa, 216 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown