/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -i ../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_longest.line754.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-04 00:48:35,567 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-04 00:48:35,568 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-04 00:48:35,588 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-04 00:48:35,588 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-04 00:48:35,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-04 00:48:35,590 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-04 00:48:35,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-04 00:48:35,592 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-04 00:48:35,593 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-04 00:48:35,593 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-04 00:48:35,594 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-04 00:48:35,595 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-04 00:48:35,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-04 00:48:35,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-04 00:48:35,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-04 00:48:35,597 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-04 00:48:35,598 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-04 00:48:35,599 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-04 00:48:35,600 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-04 00:48:35,601 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-04 00:48:35,602 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-04 00:48:35,603 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-04 00:48:35,604 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-04 00:48:35,606 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-04 00:48:35,606 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-04 00:48:35,606 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-04 00:48:35,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-04 00:48:35,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-04 00:48:35,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-04 00:48:35,608 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-04 00:48:35,609 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-04 00:48:35,609 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-04 00:48:35,610 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-04 00:48:35,610 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-04 00:48:35,611 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-04 00:48:35,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-04 00:48:35,613 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-04 00:48:35,613 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-04 00:48:35,614 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-04 00:48:35,614 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-04 00:48:35,617 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-04 00:48:35,632 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-04 00:48:35,633 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-04 00:48:35,633 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-04 00:48:35,633 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-04 00:48:35,633 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-04 00:48:35,633 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-04 00:48:35,634 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-04 00:48:35,634 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-04 00:48:35,634 INFO L138 SettingsManager]: * Use SBE=true [2022-10-04 00:48:35,634 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-04 00:48:35,634 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-04 00:48:35,634 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-04 00:48:35,634 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-04 00:48:35,635 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-04 00:48:35,635 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-04 00:48:35,635 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-04 00:48:35,635 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-04 00:48:35,635 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-04 00:48:35,635 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-04 00:48:35,635 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-04 00:48:35,635 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-04 00:48:35,635 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-04 00:48:35,635 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-04 00:48:35,636 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-04 00:48:35,636 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-04 00:48:35,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-04 00:48:35,636 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-04 00:48:35,636 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-04 00:48:35,636 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-04 00:48:35,636 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-04 00:48:35,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-04 00:48:35,636 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-04 00:48:35,636 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-04 00:48:35,637 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-04 00:48:35,637 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-04 00:48:35,637 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-04 00:48:35,637 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-04 00:48:35,637 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-04 00:48:35,637 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-04 00:48:35,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-04 00:48:35,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-04 00:48:35,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-04 00:48:35,861 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-04 00:48:35,864 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-04 00:48:35,865 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_longest.line754.bpl [2022-10-04 00:48:35,866 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_longest.line754.bpl' [2022-10-04 00:48:35,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-04 00:48:35,925 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-04 00:48:35,926 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-04 00:48:35,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-04 00:48:35,927 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-04 00:48:35,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue_longest.line754.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:48:35" (1/1) ... [2022-10-04 00:48:35,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue_longest.line754.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:48:35" (1/1) ... [2022-10-04 00:48:35,967 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue_longest.line754.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:48:35" (1/1) ... [2022-10-04 00:48:35,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue_longest.line754.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:48:35" (1/1) ... [2022-10-04 00:48:35,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue_longest.line754.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:48:35" (1/1) ... [2022-10-04 00:48:35,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue_longest.line754.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:48:35" (1/1) ... [2022-10-04 00:48:36,002 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue_longest.line754.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:48:35" (1/1) ... [2022-10-04 00:48:36,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-04 00:48:36,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-04 00:48:36,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-04 00:48:36,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-04 00:48:36,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue_longest.line754.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:48:35" (1/1) ... [2022-10-04 00:48:36,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-04 00:48:36,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:48:36,046 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-04 00:48:36,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-04 00:48:36,089 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-10-04 00:48:36,089 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-10-04 00:48:36,089 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-10-04 00:48:36,089 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-10-04 00:48:36,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-04 00:48:36,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-04 00:48:36,090 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-04 00:48:36,197 INFO L234 CfgBuilder]: Building ICFG [2022-10-04 00:48:36,198 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-04 00:48:36,776 INFO L275 CfgBuilder]: Performing block encoding [2022-10-04 00:48:36,797 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-04 00:48:36,797 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-04 00:48:36,800 INFO L202 PluginConnector]: Adding new model queue_longest.line754.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:48:36 BoogieIcfgContainer [2022-10-04 00:48:36,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-04 00:48:36,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-04 00:48:36,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-04 00:48:36,806 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-04 00:48:36,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_longest.line754.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:48:35" (1/2) ... [2022-10-04 00:48:36,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f21f5ce and model type queue_longest.line754.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:48:36, skipping insertion in model container [2022-10-04 00:48:36,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_longest.line754.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:48:36" (2/2) ... [2022-10-04 00:48:36,812 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.line754.bpl [2022-10-04 00:48:36,820 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-04 00:48:36,827 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-04 00:48:36,827 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-04 00:48:36,827 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-04 00:48:36,997 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-10-04 00:48:37,045 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:48:37,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:48:37,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:48:37,047 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-04 00:48:37,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-10-04 00:48:37,070 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:48:37,075 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-04 00:48:37,080 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@40a99483, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:48:37,080 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:48:37,128 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-04 00:48:37,131 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:48:37,132 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (1/4) [2022-10-04 00:48:37,139 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:48:37,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:48:37,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:48:37,140 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-04 00:48:37,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-10-04 00:48:37,145 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:48:37,145 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-04 00:48:37,146 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@40a99483, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:48:37,146 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:48:37,618 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-04 00:48:37,620 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:48:37,620 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/4) [2022-10-04 00:48:37,630 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:48:37,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:48:37,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:48:37,656 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-04 00:48:37,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-10-04 00:48:37,662 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:48:37,662 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Err0ASSERT_VIOLATIONASSERT ======== [2022-10-04 00:48:37,663 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@40a99483, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:48:37,663 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:48:37,663 WARN L124 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-10-04 00:48:37,663 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-04 00:48:37,664 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:48:37,664 INFO L307 ceAbstractionStarter]: Result for error location t2Err0ASSERT_VIOLATIONASSERT was SAFE (3/4) [2022-10-04 00:48:37,668 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:48:37,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:48:37,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:48:37,669 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-04 00:48:37,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2022-10-04 00:48:37,673 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:48:37,673 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Err0ASSERT_VIOLATIONASSERT ======== [2022-10-04 00:48:37,673 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@40a99483, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:48:37,674 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:48:37,737 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:48:37,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:48:37,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1817190746, now seen corresponding path program 1 times [2022-10-04 00:48:37,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:48:37,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969774469] [2022-10-04 00:48:37,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:48:37,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:48:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:48:38,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:48:38,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:48:38,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969774469] [2022-10-04 00:48:38,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969774469] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:48:38,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:48:38,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-04 00:48:38,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792597408] [2022-10-04 00:48:38,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:48:38,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-04 00:48:38,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:48:38,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-04 00:48:38,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-04 00:48:38,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:48:38,045 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:48:38,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 139.0) internal successors, (278), 2 states have internal predecessors, (278), 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) [2022-10-04 00:48:38,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:48:38,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:48:38,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-04 00:48:38,078 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:48:38,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:48:38,078 INFO L85 PathProgramCache]: Analyzing trace with hash -621438259, now seen corresponding path program 1 times [2022-10-04 00:48:38,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:48:38,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544748009] [2022-10-04 00:48:38,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:48:38,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:48:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:48:38,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:48:38,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:48:38,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544748009] [2022-10-04 00:48:38,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544748009] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:48:38,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:48:38,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-04 00:48:38,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213463679] [2022-10-04 00:48:38,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:48:38,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-04 00:48:38,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:48:38,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-04 00:48:38,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-04 00:48:38,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:48:38,289 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:48:38,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 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) [2022-10-04 00:48:38,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:48:38,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:48:38,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:48:38,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:48:38,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-04 00:48:38,832 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:48:38,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:48:38,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1381408853, now seen corresponding path program 1 times [2022-10-04 00:48:38,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:48:38,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857574871] [2022-10-04 00:48:38,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:48:38,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:48:38,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:48:38,970 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:48:38,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:48:38,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857574871] [2022-10-04 00:48:38,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857574871] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:48:38,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:48:38,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-04 00:48:38,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308362326] [2022-10-04 00:48:38,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:48:38,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-04 00:48:38,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:48:38,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-04 00:48:38,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-04 00:48:38,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:48:38,973 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:48:38,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.33333333333333) internal successors, (518), 6 states have internal predecessors, (518), 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) [2022-10-04 00:48:38,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:48:38,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:48:38,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:48:40,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:48:40,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:48:40,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:48:40,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-04 00:48:40,129 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:48:40,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:48:40,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1143628880, now seen corresponding path program 1 times [2022-10-04 00:48:40,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:48:40,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544533922] [2022-10-04 00:48:40,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:48:40,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:48:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:48:40,301 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-10-04 00:48:40,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:48:40,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544533922] [2022-10-04 00:48:40,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544533922] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:48:40,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:48:40,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-04 00:48:40,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887071610] [2022-10-04 00:48:40,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:48:40,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-04 00:48:40,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:48:40,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-04 00:48:40,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-04 00:48:40,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:48:40,304 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:48:40,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.5) internal successors, (531), 6 states have internal predecessors, (531), 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) [2022-10-04 00:48:40,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:48:40,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:48:40,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:48:40,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:48:40,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:48:40,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:48:40,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:48:40,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:48:40,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-04 00:48:40,622 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:48:40,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:48:40,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1084552452, now seen corresponding path program 2 times [2022-10-04 00:48:40,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:48:40,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816334051] [2022-10-04 00:48:40,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:48:40,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:48:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:48:40,718 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-10-04 00:48:40,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:48:40,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816334051] [2022-10-04 00:48:40,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816334051] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:48:40,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:48:40,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-04 00:48:40,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246935274] [2022-10-04 00:48:40,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:48:40,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-04 00:48:40,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:48:40,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-04 00:48:40,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-04 00:48:40,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:48:40,720 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:48:40,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 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) [2022-10-04 00:48:40,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:48:40,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:48:40,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:48:40,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:48:40,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:48:40,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:48:40,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:48:40,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:48:40,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:48:40,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:48:40,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-04 00:48:40,963 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:48:40,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:48:40,963 INFO L85 PathProgramCache]: Analyzing trace with hash -2077419964, now seen corresponding path program 1 times [2022-10-04 00:48:40,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:48:40,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203284982] [2022-10-04 00:48:40,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:48:40,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:48:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:48:41,724 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-10-04 00:48:41,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:48:41,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203284982] [2022-10-04 00:48:41,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203284982] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:48:41,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:48:41,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-10-04 00:48:41,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551035541] [2022-10-04 00:48:41,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:48:41,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-04 00:48:41,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:48:41,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-04 00:48:41,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2022-10-04 00:48:41,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:48:41,727 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:48:41,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 22.954545454545453) internal successors, (505), 22 states have internal predecessors, (505), 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) [2022-10-04 00:48:41,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:48:41,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:48:41,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:48:41,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:48:41,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:48:41,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:48:43,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:48:43,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:48:43,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:48:43,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:48:43,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:48:43,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-04 00:48:43,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-04 00:48:43,844 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:48:43,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:48:43,844 INFO L85 PathProgramCache]: Analyzing trace with hash -906844975, now seen corresponding path program 1 times [2022-10-04 00:48:43,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:48:43,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890832501] [2022-10-04 00:48:43,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:48:43,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:48:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:48:45,590 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-10-04 00:48:45,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:48:45,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890832501] [2022-10-04 00:48:45,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890832501] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:48:45,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:48:45,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-10-04 00:48:45,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687437435] [2022-10-04 00:48:45,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:48:45,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-10-04 00:48:45,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:48:45,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-10-04 00:48:45,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1824, Unknown=0, NotChecked=0, Total=1980 [2022-10-04 00:48:45,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:48:45,595 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:48:45,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 11.466666666666667) internal successors, (516), 45 states have internal predecessors, (516), 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) [2022-10-04 00:48:45,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:48:45,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:48:45,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:48:45,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:48:45,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:48:45,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-10-04 00:48:45,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:48:53,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:48:53,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:48:53,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:48:53,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:48:53,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:48:53,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-04 00:48:53,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-10-04 00:48:53,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-04 00:48:53,147 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:48:53,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:48:53,147 INFO L85 PathProgramCache]: Analyzing trace with hash -628061619, now seen corresponding path program 1 times [2022-10-04 00:48:53,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:48:53,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76524380] [2022-10-04 00:48:53,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:48:53,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:48:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:48:55,545 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-10-04 00:48:55,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:48:55,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76524380] [2022-10-04 00:48:55,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76524380] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:48:55,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:48:55,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-10-04 00:48:55,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323089102] [2022-10-04 00:48:55,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:48:55,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-10-04 00:48:55,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:48:55,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-10-04 00:48:55,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=3528, Unknown=0, NotChecked=0, Total=3782 [2022-10-04 00:48:55,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:48:55,552 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:48:55,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 8.32258064516129) internal successors, (516), 62 states have internal predecessors, (516), 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) [2022-10-04 00:48:55,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:48:55,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:48:55,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:48:55,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:48:55,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:48:55,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-10-04 00:48:55,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-10-04 00:48:55,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:49:06,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:49:06,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:49:06,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:49:06,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:49:06,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:49:06,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-04 00:49:06,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-10-04 00:49:06,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-10-04 00:49:06,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-04 00:49:06,376 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:49:06,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:49:06,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1809678632, now seen corresponding path program 1 times [2022-10-04 00:49:06,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:49:06,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303820862] [2022-10-04 00:49:06,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:49:06,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:49:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:49:29,583 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-10-04 00:49:29,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:49:29,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303820862] [2022-10-04 00:49:29,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303820862] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:49:29,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009136423] [2022-10-04 00:49:29,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:49:29,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:49:29,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:49:29,586 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-04 00:49:29,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-04 00:49:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:49:29,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 1192 conjuncts, 225 conjunts are in the unsatisfiable core [2022-10-04 00:49:29,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:49:30,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-10-04 00:49:31,455 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-04 00:49:31,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 18 [2022-10-04 00:49:32,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-04 00:49:32,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:49:32,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2022-10-04 00:49:34,506 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-04 00:49:34,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 33 [2022-10-04 00:49:34,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-10-04 00:49:35,040 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-04 00:49:35,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 38 [2022-10-04 00:49:35,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-10-04 00:49:38,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:49:38,473 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:49:38,507 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-10-04 00:49:38,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 49 treesize of output 39 [2022-10-04 00:49:39,025 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-04 00:49:39,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 13 [2022-10-04 00:49:39,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:49:39,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:49:39,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 [2022-10-04 00:49:40,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 [2022-10-04 00:49:40,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:49:40,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2022-10-04 00:49:42,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:49:42,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:49:42,920 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-10-04 00:49:42,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-04 00:49:43,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:49:43,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:49:43,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 [2022-10-04 00:49:43,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:49:43,880 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-10-04 00:49:43,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 38 [2022-10-04 00:49:44,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:49:44,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-10-04 00:49:44,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:49:44,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2022-10-04 00:49:44,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-04 00:49:45,054 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-04 00:49:45,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 00:49:52,500 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_508 (Array Int Int))) (not (= (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800))) is different from false [2022-10-04 00:49:52,512 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int)) (or (forall ((v_ArrVal_508 (Array Int Int))) (not (= (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:49:52,523 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int))) (or (not (= (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:49:52,564 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int)) (or (not (= (select (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:49:52,588 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int)) (or (not (= 800 (select (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (not (<= (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:49:52,605 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (<= (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:49:52,688 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 800) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (<= (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 00:49:52,709 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork1_read~int_#value#1| 800) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (<= (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 00:49:52,722 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (<= (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))) (= 800 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|))) is different from false [2022-10-04 00:49:52,763 WARN L833 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (<= (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 00:49:52,816 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int)) (let ((.cse2 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_504)))) (let ((.cse0 (select .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (= (select .cse0 .cse1) 800) (not (= 800 (select (select (store (store .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:49:52,883 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (= 800 (select .cse0 .cse1)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= (select (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 00:49:52,915 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504)) (.cse0 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= 800 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (= 800 (select .cse1 .cse0)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 00:49:53,035 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504)) (.cse0 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= 800 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (= 800 (select .cse1 .cse0)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 00:49:53,102 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse2 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_502)))) (let ((.cse0 (store (select .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (= (select .cse0 .cse1) 800) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (= (select (select (store (store .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:49:53,176 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse1 (store (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_502) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504)) (.cse0 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= (select (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (= 800 (select .cse1 .cse0))))) is different from false [2022-10-04 00:49:53,217 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse1 (store (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_502) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504)) (.cse0 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= 800 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (= 800 (select .cse1 .cse0)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 00:49:53,259 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_502) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (= (select .cse0 .cse1) 800) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 00:49:53,282 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_502) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (= (select .cse0 .cse1) 800) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= 800 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 00:49:53,361 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (store (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (= (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (= 800 (select .cse0 .cse1)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:49:53,419 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse0 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse1 (store (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (store .cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* (select .cse2 .cse0) 4)) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (= (select .cse1 .cse0) 800) (not (= (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:49:53,474 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (store (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (= (select .cse0 .cse1) 800) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= 800 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (not (<= (+ 3208 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)))))) is different from false [2022-10-04 00:49:54,443 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse0 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_501))) (let ((.cse1 (store (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse0) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (= 800 (select .cse1 .cse0)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (not (= 800 (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (not (<= (+ 3208 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)))))) is different from false [2022-10-04 00:49:54,529 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_501 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse0 (store (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (= 800 (select .cse0 .cse1)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (not (<= (+ 3208 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)))))))) is different from false [2022-10-04 00:49:54,582 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse0 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse1 (store (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse0) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (= (select .cse1 .cse0) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (not (= 800 (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (not (<= (+ 3208 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)))))) is different from false [2022-10-04 00:49:54,845 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse0 (+ |c_~#queue~0.offset| 3204)) (.cse1 (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| |c_t1Thread1of1ForFork1_write~int_#value#1|)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse2 (store (let ((.cse3 (select .cse1 |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse0) 4)) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (not (= 800 (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (= (select .cse2 .cse0) 800) (not (<= (+ 3208 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)))))) is different from false [2022-10-04 00:49:54,967 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#value#1_48| Int) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse0 (+ |c_~#queue~0.offset| 3204)) (.cse1 (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#value#1_48|)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse2 (store (let ((.cse3 (select .cse1 |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse0) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#value#1_48| (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (not (= 800 (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (= 800 (select .cse2 .cse0)) (not (<= (+ 3208 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)))))) is different from false [2022-10-04 00:49:55,036 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#value#1_48| Int) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse0 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#value#1_48|)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse1 (store (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse0) 4)) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (= (select .cse1 .cse0) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#value#1_48| (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (not (<= (+ 3208 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (= 800 (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))))))) is different from false [2022-10-04 00:49:55,113 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#value#1_48| Int) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse0 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#value#1_48|)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse1 (store (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse0) 4)) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1) |v_t1Thread1of1ForFork1_write~int_#value#1_48|) (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (= (select .cse1 .cse0) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (not (<= (+ 3208 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (= 800 (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))))))) is different from false [2022-10-04 00:49:55,201 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#value#1_48| Int) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse0 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#value#1_48|)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse1 (store (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse0) 4)) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (< (+ |c_t1Thread1of1ForFork1_read~int_#value#1| 1) |v_t1Thread1of1ForFork1_write~int_#value#1_48|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (= (select .cse1 .cse0) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (not (<= (+ 3208 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (= 800 (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))))))) is different from false [2022-10-04 00:49:55,247 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#value#1_48| Int) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse0 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#value#1_48|)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse1 (store (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse0) 4)) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (< (+ (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 1) |v_t1Thread1of1ForFork1_write~int_#value#1_48|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (= (select .cse1 .cse0) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (not (<= (+ 3208 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (= 800 (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))))))) is different from false [2022-10-04 00:49:55,476 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#value#1_48| Int) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (+ |c_~#queue~0.offset| 3204)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 |v_t1Thread1of1ForFork1_write~int_#value#1_48|)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse3 (store (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse0) 4)) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (< (+ (select .cse1 .cse2) 1) |v_t1Thread1of1ForFork1_write~int_#value#1_48|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (= (select .cse3 .cse0) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (not (<= (+ 3208 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (= 800 (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse3 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|))))))))) is different from false [2022-10-04 00:49:55,858 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (v_ArrVal_497 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#value#1_48| Int) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse6 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_497)))) (let ((.cse3 (select .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (+ |c_~#queue~0.offset| 3204)) (.cse1 (store (store .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 |v_t1Thread1of1ForFork1_write~int_#value#1_48|)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse2 (store (let ((.cse5 (select .cse1 |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse0)) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (not (= (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (= 800 (select .cse2 .cse0)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (not (<= (+ 3208 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (< (+ (select .cse3 .cse4) 1) |v_t1Thread1of1ForFork1_write~int_#value#1_48|))))))) is different from false [2022-10-04 00:49:55,992 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (|v_t1Thread1of1ForFork1_write~int_#value#1_48| Int) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_497 Int) (v_ArrVal_508 (Array Int Int))) (let ((.cse1 (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_497)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (+ |c_~#queue~0.offset| 3204)) (.cse3 (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 |v_t1Thread1of1ForFork1_write~int_#value#1_48|)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse4 (store (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse0) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (< (+ (select .cse1 .cse2) 1) |v_t1Thread1of1ForFork1_write~int_#value#1_48|) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= 800 (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (= (select .cse4 .cse0) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (not (<= (+ 3208 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|))))))) is different from false [2022-10-04 00:49:56,061 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (|v_t1Thread1of1ForFork1_write~int_#value#1_48| Int) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_497 Int) (v_ArrVal_508 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_497)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (+ |c_~#queue~0.offset| 3204)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 |v_t1Thread1of1ForFork1_write~int_#value#1_48|)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse1 (store (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse0) 4)) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (= 800 (select .cse1 .cse0)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (< (+ (select .cse2 .cse3) 1) |v_t1Thread1of1ForFork1_write~int_#value#1_48|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (not (= 800 (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (not (<= (+ 3208 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|))))))) is different from false [2022-10-04 00:50:11,632 INFO L356 Elim1Store]: treesize reduction 113, result has 45.1 percent of original size [2022-10-04 00:50:11,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 968 treesize of output 724 [2022-10-04 00:50:11,690 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:50:11,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2275 treesize of output 2261 [2022-10-04 00:50:11,708 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:50:11,709 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:50:11,709 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:50:11,710 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:50:11,711 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:50:11,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2226 treesize of output 2162 [2022-10-04 00:50:11,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1286 treesize of output 1222 [2022-10-04 00:50:11,770 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:50:11,770 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:50:11,771 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:50:11,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1892 treesize of output 1700 [2022-10-04 00:50:11,800 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:50:11,800 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:50:11,801 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:50:11,801 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:50:11,802 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:50:11,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2136 treesize of output 2112 [2022-10-04 00:50:12,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 4 [2022-10-04 00:50:12,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 4 [2022-10-04 00:50:13,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:50:13,985 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:50:13,986 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:50:13,986 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:50:13,988 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:50:14,001 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:50:14,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 775 treesize of output 715 [2022-10-04 00:50:18,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 247 treesize of output 239 [2022-10-04 00:50:19,292 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-10-04 00:50:19,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009136423] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 00:50:19,292 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 00:50:19,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 80, 86] total 244 [2022-10-04 00:50:19,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014924678] [2022-10-04 00:50:19,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 00:50:19,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 244 states [2022-10-04 00:50:19,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:50:19,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 244 interpolants. [2022-10-04 00:50:19,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1467, Invalid=41977, Unknown=168, NotChecked=15680, Total=59292 [2022-10-04 00:50:19,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:50:19,306 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:50:19,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 244 states, 244 states have (on average 5.868852459016393) internal successors, (1432), 244 states have internal predecessors, (1432), 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) [2022-10-04 00:50:19,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:50:19,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:50:19,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:50:19,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:50:19,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:50:19,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-10-04 00:50:19,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-10-04 00:50:19,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2022-10-04 00:50:19,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:52:36,883 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#queue~0.base|)) (.cse1 ((as const (Array Int Int)) 0))) (let ((.cse6 (@diff .cse7 .cse1))) (let ((.cse16 (store .cse7 .cse6 0))) (let ((.cse45 (+ |c_~#queue~0.offset| 3204)) (.cse17 (@diff .cse16 .cse1))) (let ((.cse43 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse42 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|)) (.cse15 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse13 (select |c_#length| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse2 (store .cse16 .cse17 0)) (.cse46 (select .cse7 .cse45)) (.cse44 (+ 3200 |c_~#queue~0.offset|))) (let ((.cse8 (= .cse46 (select .cse7 .cse44))) (.cse0 (+ |c_ULTIMATE.start_init_~q#1.offset| 3204)) (.cse3 (@diff .cse2 .cse1)) (.cse11 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (.cse4 (<= .cse13 4)) (.cse12 (select .cse15 3204)) (.cse10 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse20 (select |c_#length| |c_~#queue~0.base|)) (.cse18 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse14 (select .cse42 3204)) (.cse9 (= .cse46 0)) (.cse5 (select .cse43 .cse45)) (.cse19 (select .cse43 .cse44))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) .cse0) 0) (= .cse1 (store .cse2 .cse3 0)) .cse4 (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= .cse5 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (or (<= .cse6 3200) (<= 3208 .cse6) (= .cse1 .cse7)) (or (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|) (and .cse8 .cse9)) (<= (select |c_#length| |c_ULTIMATE.start_write~int_#ptr#1.base|) 4) (<= 0 |c_~#queue~0.offset|) .cse8 (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= .cse10 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= 0 (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_init_~q#1.base|) .cse0)) (or (<= 3208 .cse3) (= .cse1 .cse2) (<= .cse3 3200)) (= |c_ULTIMATE.start_init_~q#1.offset| |c_~#queue~0.offset|) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse11 (= .cse12 0) (or .cse11 (and .cse4 (not (= .cse13 4)) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0))) (not (= |c_~#queue~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (= .cse14 0) (exists ((|ULTIMATE.start_read~int_#ptr#1.base| Int)) (<= (select |c_#length| |ULTIMATE.start_read~int_#ptr#1.base|) 4)) (= (select .cse7 3200) (select .cse7 3204)) (= 7 |c_~#queue~0.base|) (<= (select |c_#length| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 4) (= .cse12 (select .cse15 3200)) (or (= .cse1 .cse16) (<= .cse17 3200) (<= 3208 .cse17)) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (<= .cse10 .cse18) (= .cse19 0) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (or (< .cse20 (+ 3212 |c_~#queue~0.offset|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (|v_t1Thread1of1ForFork1_write~int_#value#1_48| Int) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_497 Int) (v_ArrVal_495 Int) (v_ArrVal_508 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int)) (let ((.cse28 (store (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_493) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_494))) (let ((.cse26 (select .cse28 |c_~#queue~0.base|))) (let ((.cse25 (store (store .cse26 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_495) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_497)) (.cse21 (+ |c_~#queue~0.offset| 3204))) (let ((.cse23 (store (store .cse28 |c_~#queue~0.base| (store .cse25 .cse21 |v_t1Thread1of1ForFork1_write~int_#value#1_48|)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse24 (store (let ((.cse27 (select .cse23 |c_~#queue~0.base|))) (store .cse27 (+ |c_~#queue~0.offset| (* (select .cse27 .cse21) 4)) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504)) (.cse22 (+ 3208 |c_~#queue~0.offset|))) (or (not (<= .cse21 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= .cse22 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= 800 (select (select (store (store .cse23 |c_~#queue~0.base| (store .cse24 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (< (+ (select .cse25 .cse21) 1) |v_t1Thread1of1ForFork1_write~int_#value#1_48|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (< (+ |c_~#queue~0.offset| (* (select .cse26 .cse21) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (= 800 (select .cse24 .cse21)) (not (<= .cse22 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)))))))))) (not (= .cse20 .cse13)) (or (< .cse18 (+ 3212 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (|v_t1Thread1of1ForFork1_write~int_#value#1_48| Int) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_497 Int) (v_ArrVal_495 Int) (v_ArrVal_508 (Array Int Int))) (let ((.cse35 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_495)))) (let ((.cse29 (store (select .cse35 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_497)) (.cse30 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse31 (+ |c_~#queue~0.offset| 3204)) (.cse32 (store (store .cse35 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse29 .cse30 |v_t1Thread1of1ForFork1_write~int_#value#1_48|)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse33 (store (let ((.cse34 (select .cse32 |c_~#queue~0.base|))) (store .cse34 (+ (* 4 (select .cse34 .cse31)) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (< (+ (select .cse29 .cse30) 1) |v_t1Thread1of1ForFork1_write~int_#value#1_48|) (not (<= .cse31 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (not (= 800 (select (select (store (store .cse32 |c_~#queue~0.base| (store .cse33 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (= (select .cse33 .cse31) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (not (<= (+ 3208 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|))))))))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (|v_t1Thread1of1ForFork1_write~int_#value#1_48| Int) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_497 Int) (v_ArrVal_508 (Array Int Int))) (let ((.cse38 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_497)) (.cse39 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse36 (+ |c_~#queue~0.offset| 3204)) (.cse40 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse38 .cse39 |v_t1Thread1of1ForFork1_write~int_#value#1_48|)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse37 (store (let ((.cse41 (select .cse40 |c_~#queue~0.base|))) (store .cse41 (+ |c_~#queue~0.offset| (* (select .cse41 .cse36) 4)) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse36 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (= 800 (select .cse37 .cse36)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (< (+ (select .cse38 .cse39) 1) |v_t1Thread1of1ForFork1_write~int_#value#1_48|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (not (= 800 (select (select (store (store .cse40 |c_~#queue~0.base| (store .cse37 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (not (<= (+ 3208 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|))))))) (<= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |c_ULTIMATE.start_main_~#id1~0#1.base|) 4) (<= 4 |c_t1Thread1of1ForFork1_read~int_#sizeOfReadType#1|) (<= (select |c_#length| |c_ULTIMATE.start_main_~#id2~0#1.base|) 4) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (= .cse14 (select .cse42 3200)) (<= |c_~#stored_elements~0.base| 6) .cse9 (= .cse5 .cse19) (<= |c_ULTIMATE.start_#Ultimate.allocOnStack_~size#1| 4)))))))) is different from false [2022-10-04 00:52:36,922 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse1 (select .cse2 3204)) (.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= .cse1 0) (= 7 |c_~#queue~0.base|) (= .cse1 (select .cse2 3200)) (= (select .cse0 (+ 3200 |c_~#queue~0.offset|)) 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (|v_t1Thread1of1ForFork1_write~int_#value#1_48| Int) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_497 Int) (v_ArrVal_508 (Array Int Int))) (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_497)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse5 .cse6 |v_t1Thread1of1ForFork1_write~int_#value#1_48|)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse4 (store (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse3) 4)) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse3 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (= 800 (select .cse4 .cse3)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (< (+ (select .cse5 .cse6) 1) |v_t1Thread1of1ForFork1_write~int_#value#1_48|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (not (= 800 (select (select (store (store .cse7 |c_~#queue~0.base| (store .cse4 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (not (<= (+ 3208 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|))))))) (<= |c_~#stored_elements~0.base| 6)))) is different from false [2022-10-04 00:52:36,929 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse6 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|)) (.cse7 (select .cse8 3204))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (|v_t1Thread1of1ForFork1_write~int_#value#1_48| Int) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_497 Int) (v_ArrVal_508 (Array Int Int))) (let ((.cse1 (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_497)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (+ |c_~#queue~0.offset| 3204)) (.cse3 (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 |v_t1Thread1of1ForFork1_write~int_#value#1_48|)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse4 (store (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse0) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (< (+ (select .cse1 .cse2) 1) |v_t1Thread1of1ForFork1_write~int_#value#1_48|) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= 800 (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (= (select .cse4 .cse0) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (not (<= (+ 3208 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|))))))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= (select .cse6 (+ 3200 |c_~#queue~0.offset|)) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= (select .cse6 (+ |c_~#queue~0.offset| 3204)) 0) (= .cse7 (select .cse8 3200)) (= 7 |c_~#queue~0.base|) (= .cse7 0) (<= |c_~#stored_elements~0.base| 6)))) is different from false [2022-10-04 00:52:45,033 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse7 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|)) (.cse11 (select .cse9 3200)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse8 (+ 3200 |c_~#queue~0.offset|)) (.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (select .cse9 3204))) (and (<= (* |c_t1Thread1of1ForFork1_write~int_#value#1| 4) 4) (<= 3204 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (<= (select .cse0 .cse1) 1) (forall ((v_ArrVal_501 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse4 (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse3 (store (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (= (select .cse3 .cse2) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (not (= 800 (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse3 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (not (<= (+ 3208 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)))))) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (<= (* (select .cse6 3204) 4) 4) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_t1Thread1of1ForFork1_write~int_#value#1| (+ (select .cse7 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) 1)) (<= 0 |c_~#queue~0.offset|) (= (select .cse7 .cse8) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| (select .cse9 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (= |c_~#queue~0.offset| 0) (= (select .cse7 .cse1) 0) (= .cse10 .cse11) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (= 800 .cse11)) (= .cse1 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (not (= 800 (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) 3200))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| 3204) (not (= 3200 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|)) (= (select .cse0 .cse8) 0) (or (< (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3212 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (|v_t1Thread1of1ForFork1_write~int_#value#1_48| Int) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_497 Int) (v_ArrVal_495 Int) (v_ArrVal_508 (Array Int Int))) (let ((.cse18 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_495)))) (let ((.cse12 (store (select .cse18 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_497)) (.cse13 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse14 (+ |c_~#queue~0.offset| 3204)) (.cse15 (store (store .cse18 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse12 .cse13 |v_t1Thread1of1ForFork1_write~int_#value#1_48|)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse16 (store (let ((.cse17 (select .cse15 |c_~#queue~0.base|))) (store .cse17 (+ (* 4 (select .cse17 .cse14)) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (< (+ (select .cse12 .cse13) 1) |v_t1Thread1of1ForFork1_write~int_#value#1_48|) (not (<= .cse14 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (not (= 800 (select (select (store (store .cse15 |c_~#queue~0.base| (store .cse16 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (= (select .cse16 .cse14) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (not (<= (+ 3208 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|))))))))) (not (= (select .cse6 3200) 800)) (= |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 0) (= .cse10 0) (<= |c_~#stored_elements~0.base| 6)))) is different from false [2022-10-04 00:52:45,039 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 1) (forall ((v_ArrVal_501 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse3 (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse2 (store (let ((.cse4 (select .cse3 |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (= (select .cse2 .cse1) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (not (= 800 (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (not (<= (+ 3208 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)))))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.offset| 0) (= 7 |c_~#queue~0.base|) (= (select .cse0 (+ 3200 |c_~#queue~0.offset|)) 0) (<= (* (select .cse0 3204) 4) 4) (not (= (select .cse0 3200) 800)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:52:45,050 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= (select .cse0 (+ 3200 |c_~#queue~0.offset|)) 0) (= |c_~#queue~0.offset| 0) (<= (* (select .cse0 3204) 4) 4) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_501 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse3 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse1 (store (let ((.cse4 (select .cse3 |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (= 800 (select .cse1 .cse2)) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (not (<= (+ 3208 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)))))))) (<= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 1) (not (= 800 (select .cse0 3200))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:52:45,055 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= (select .cse0 (+ 3200 |c_~#queue~0.offset|)) 0) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_501 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse3 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_501))) (let ((.cse2 (store (let ((.cse4 (select .cse3 |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (= 800 (select .cse2 .cse1)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (not (= 800 (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (not (<= (+ 3208 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)))))) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#stored_elements~0.base|) (<= (* (select .cse0 3204) 4) 4) (= 7 |c_~#queue~0.base|) (not (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|)) (<= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 1) (not (= 800 (select .cse0 3200))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:52:45,060 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (store (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (= (select .cse1 .cse2) 800) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= 800 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (not (<= (+ 3208 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)))))) (= |c_~#queue~0.offset| 0) (= 7 |c_~#queue~0.base|) (= (select .cse0 (+ 3200 |c_~#queue~0.offset|)) 0) (<= (* (select .cse0 3204) 4) 4) (not (= (select .cse0 3200) 800)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:52:45,065 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (store (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (= (select .cse1 .cse2) 800) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= 800 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (not (<= (+ 3208 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)))))) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_empty_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (= (select .cse0 (+ 3200 |c_~#queue~0.offset|)) 0) (<= (* (select .cse0 3204) 4) 4) (not (= (select .cse0 3200) 800)) (<= |c_~#stored_elements~0.base| 6) (= |c_t1Thread1of1ForFork1_empty_#in~q#1.base| |c_~#queue~0.base|))) is different from false [2022-10-04 00:52:45,071 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (store (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (= (select .cse1 .cse2) 800) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= 800 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (not (<= (+ 3208 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)))))) (= |c_t1Thread1of1ForFork1_empty_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_empty_~q#1.base| |c_~#queue~0.base|) (= 7 |c_~#queue~0.base|) (= (select .cse0 (+ 3200 |c_~#queue~0.offset|)) 0) (<= (* (select .cse0 3204) 4) 4) (not (= (select .cse0 3200) 800)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:52:45,247 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (and (<= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= 800 (select .cse1 3200))) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 0) (= 7 |c_~#queue~0.base|) (= (select .cse0 (+ 3200 |c_~#queue~0.offset|)) 0) (<= (* (select .cse1 3204) 4) 4) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse3 (store (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (store .cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* (select .cse4 .cse2) 4)) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (= (select .cse3 .cse2) 800) (not (= (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store .cse3 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:52:45,253 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (<= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 1) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (store (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (= (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (= 800 (select .cse1 .cse2)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))))) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (<= (* (select .cse4 3204) 4) 4) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= 7 |c_~#queue~0.base|) (= (select .cse0 (+ 3200 |c_~#queue~0.offset|)) 0) (not (= (select .cse4 3200) 800)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:52:45,258 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 4) 4) (<= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 1) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_502) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (= (select .cse1 .cse2) 800) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= 800 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))) (= (select .cse0 (+ 3200 |c_~#queue~0.offset|)) 0) (not (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 3200) 800)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:52:45,263 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (<= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 1) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork1_read~int_#value#1| (select .cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (<= 0 |c_~#queue~0.offset|) (<= (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) 4) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= 7 |c_~#queue~0.base|) (= (select .cse0 (+ 3200 |c_~#queue~0.offset|)) 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_502) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (= (select .cse2 .cse3) 800) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= .cse3 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))) (not (= (select .cse1 3200) 800)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:52:45,267 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (<= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 1) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= (select .cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse3 (store (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_502) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= 800 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (= 800 (select .cse3 .cse2)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))) (= 7 |c_~#queue~0.base|) (= (select .cse0 (+ 3200 |c_~#queue~0.offset|)) 0) (not (= (select .cse1 3200) 800)) (<= |c_~#stored_elements~0.base| 6) (<= (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) 4))) is different from false [2022-10-04 00:52:45,272 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= (select .cse0 (+ 3200 |c_~#queue~0.offset|)) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= 800 (select .cse1 3200))) (= 7 |c_~#queue~0.base|) (= (select .cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse3 (store (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_502) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= (select (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (= 800 (select .cse3 .cse2))))) (<= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 1) (<= |c_~#stored_elements~0.base| 6) (<= (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) 4))) is different from false [2022-10-04 00:52:45,276 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= (select .cse0 (+ 3200 |c_~#queue~0.offset|)) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse3 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_502)))) (let ((.cse1 (store (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (= (select .cse1 .cse2) 800) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (= (select (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))))) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (= 800 (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) 3200))) (= (+ (* (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= 7 |c_~#queue~0.base|) (not (= 3200 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|)) (<= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:52:45,281 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504)) (.cse0 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= 800 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (= 800 (select .cse1 .cse0)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))) (<= (select .cse2 (+ |c_~#queue~0.offset| 3204)) 1) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= 7 |c_~#queue~0.base|) (= (select .cse2 (+ 3200 |c_~#queue~0.offset|)) 0) (not (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 3200) 800)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:52:45,286 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 1) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= 800 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (= 800 (select .cse2 .cse1)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))) (= 7 |c_~#queue~0.base|) (= (select .cse0 (+ 3200 |c_~#queue~0.offset|)) 0) (not (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 3200) 800)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:52:45,292 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= (select .cse0 (+ 3200 |c_~#queue~0.offset|)) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int)) (let ((.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (= 800 (select .cse1 .cse2)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= (select (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))) (= |c_~#queue~0.offset| 0) (not (= 800 (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 3200))) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:52:45,296 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= (select .cse0 (+ 3200 |c_~#queue~0.offset|)) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (= 800 (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) 3200))) (= 7 |c_~#queue~0.base|) (not (= 3200 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|)) (<= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 1) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int)) (let ((.cse3 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_504)))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (= (select .cse1 .cse2) 800) (not (= 800 (select (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:52:45,301 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (or (= (select .cse0 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (<= (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))) (<= (select .cse1 (+ |c_~#queue~0.offset| 3204)) 1) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= 7 |c_~#queue~0.base|) (= (select .cse1 (+ 3200 |c_~#queue~0.offset|)) 0) (not (= (select .cse0 3200) 800)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:52:45,306 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 1) (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (<= (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))) (= 800 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|))) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (= 7 |c_~#queue~0.base|) (= (select .cse0 (+ 3200 |c_~#queue~0.offset|)) 0) (not (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 3200) 800)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:52:45,311 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (<= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 1) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork1_read~int_#value#1| (select .cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= 7 |c_~#queue~0.base|) (= (select .cse0 (+ 3200 |c_~#queue~0.offset|)) 0) (not (= (select .cse1 3200) 800)) (or (= |c_t1Thread1of1ForFork1_read~int_#value#1| 800) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (<= (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:52:45,314 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (<= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 1) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= 7 |c_~#queue~0.base|) (= (select .cse0 (+ 3200 |c_~#queue~0.offset|)) 0) (or (= |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 800) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (<= (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))) (= (select .cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1|) (not (= (select .cse1 3200) 800)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:52:45,318 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 1) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= 7 |c_~#queue~0.base|) (= (select .cse0 (+ 3200 |c_~#queue~0.offset|)) 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (<= (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))) (not (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 3200) 800)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:52:45,325 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= (select .cse0 (+ 3200 |c_~#queue~0.offset|)) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= 800 (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 3200))) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int)) (or (not (= 800 (select (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (not (<= (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))) (<= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:52:46,056 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse2 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int))) (or (not (= (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= (select .cse0 .cse1) 0) (= |c_~#queue~0.offset| 0) (<= (* (select .cse0 3204) 4) 4) (not (= 800 (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) 3200))) (= 7 |c_~#queue~0.base|) (not (= 3200 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|)) (= (select .cse2 .cse1) 0) (<= .cse3 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (not (= (select .cse2 3200) 800)) (<= (select .cse0 .cse3) 1) (not (= 800 (select .cse0 3200))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:52:46,059 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int))) (or (not (= (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.offset| 0) (= 7 |c_~#queue~0.base|) (= (select .cse0 (+ 3200 |c_~#queue~0.offset|)) 0) (not (= (select .cse0 3200) 800)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:52:46,064 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= (select .cse0 (+ 3200 |c_~#queue~0.offset|)) 0) (= |c_~#queue~0.offset| 0) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int)) (or (forall ((v_ArrVal_508 (Array Int Int))) (not (= (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))) (not (= 800 (select .cse0 3200))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:52:53,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:52:53,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:52:53,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:52:53,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:52:53,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:52:53,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-04 00:52:53,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-10-04 00:52:53,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-10-04 00:52:53,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2022-10-04 00:52:53,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-10-04 00:52:53,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:52:53,820 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:52:53,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:52:53,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1284917185, now seen corresponding path program 1 times [2022-10-04 00:52:53,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:52:53,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24293597] [2022-10-04 00:52:53,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:52:53,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:52:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:52:55,330 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:52:55,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:52:55,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24293597] [2022-10-04 00:52:55,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24293597] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:52:55,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010111840] [2022-10-04 00:52:55,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:52:55,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:52:55,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:52:55,332 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-04 00:52:55,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-04 00:52:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:52:55,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 1212 conjuncts, 54 conjunts are in the unsatisfiable core [2022-10-04 00:52:55,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:52:56,091 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-04 00:52:56,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 18 [2022-10-04 00:52:56,364 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-10-04 00:52:56,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 42 [2022-10-04 00:53:02,869 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:53:02,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 00:53:11,671 WARN L233 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 00:53:19,341 WARN L233 SmtUtils]: Spent 7.44s on a formula simplification. DAG size of input: 23 DAG size of output: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 00:53:22,588 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_619 Int)) (or (forall ((v_ArrVal_620 Int) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_subst_2 Int)) (let ((.cse0 (select (store (store |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_619) v_subst_2 v_ArrVal_620) |c_~#stored_elements~0.base|))) (or (< .cse0 (+ |c_~#stored_elements~0.offset| 8)) (< 4 v_ArrVal_620) (< (+ |c_~#stored_elements~0.offset| 11) .cse0)))) (not (<= v_ArrVal_619 |c_ULTIMATE.start_#Ultimate.allocOnStack_~size#1|)))) (<= 0 (+ |c_~#stored_elements~0.offset| 8))) is different from false [2022-10-04 00:53:22,997 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:53:22,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 59 treesize of output 61 [2022-10-04 00:53:23,136 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:53:23,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010111840] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 00:53:23,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 00:53:23,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 27, 17] total 81 [2022-10-04 00:53:23,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645550680] [2022-10-04 00:53:23,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 00:53:23,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-10-04 00:53:23,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:53:23,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-10-04 00:53:23,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=456, Invalid=6027, Unknown=1, NotChecked=158, Total=6642 [2022-10-04 00:53:23,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:23,141 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:53:23,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 81 states have (on average 19.54320987654321) internal successors, (1583), 82 states have internal predecessors, (1583), 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) [2022-10-04 00:53:23,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:23,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:53:23,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:53:23,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:53:23,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:53:23,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-10-04 00:53:23,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-10-04 00:53:23,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2022-10-04 00:53:23,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 122 states. [2022-10-04 00:53:23,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:32,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:32,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:53:32,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:53:32,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:53:32,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:53:32,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-04 00:53:32,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-10-04 00:53:32,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-10-04 00:53:32,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2022-10-04 00:53:32,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-10-04 00:53:32,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-10-04 00:53:32,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:53:32,431 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:53:32,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:53:32,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1224316434, now seen corresponding path program 2 times [2022-10-04 00:53:32,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:53:32,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203170617] [2022-10-04 00:53:32,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:53:32,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:53:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:53:32,543 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2022-10-04 00:53:32,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:53:32,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203170617] [2022-10-04 00:53:32,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203170617] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:53:32,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:53:32,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-04 00:53:32,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772412402] [2022-10-04 00:53:32,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:53:32,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-04 00:53:32,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:53:32,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-04 00:53:32,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-04 00:53:32,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:32,546 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:53:32,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 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) [2022-10-04 00:53:32,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:32,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:53:32,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:53:32,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:53:32,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:53:32,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-10-04 00:53:32,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-10-04 00:53:32,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2022-10-04 00:53:32,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 123 states. [2022-10-04 00:53:32,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-10-04 00:53:32,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:33,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:33,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:53:33,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:53:33,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:53:33,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:53:33,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-04 00:53:33,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-10-04 00:53:33,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-10-04 00:53:33,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2022-10-04 00:53:33,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-10-04 00:53:33,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:53:33,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-04 00:53:33,107 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:53:33,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:53:33,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1198796287, now seen corresponding path program 2 times [2022-10-04 00:53:33,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:53:33,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621877747] [2022-10-04 00:53:33,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:53:33,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:53:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:53:34,970 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 0 proven. 333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:53:34,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:53:34,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621877747] [2022-10-04 00:53:34,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621877747] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:53:34,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463865641] [2022-10-04 00:53:34,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-04 00:53:34,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:53:34,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:53:34,972 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-04 00:53:34,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-04 00:53:35,659 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-04 00:53:35,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-04 00:53:35,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 1340 conjuncts, 56 conjunts are in the unsatisfiable core [2022-10-04 00:53:35,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:53:36,029 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-04 00:53:36,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-10-04 00:53:36,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-10-04 00:53:36,374 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-04 00:53:36,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-10-04 00:53:36,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-10-04 00:53:43,738 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 333 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:53:43,739 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-04 00:53:43,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463865641] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:53:43,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-04 00:53:43,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [45] total 76 [2022-10-04 00:53:43,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630985218] [2022-10-04 00:53:43,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:53:43,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-10-04 00:53:43,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:53:43,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-10-04 00:53:43,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=5541, Unknown=0, NotChecked=0, Total=5852 [2022-10-04 00:53:43,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:43,741 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:53:43,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 19.242424242424242) internal successors, (635), 34 states have internal predecessors, (635), 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) [2022-10-04 00:53:43,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:43,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:53:43,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:53:43,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:53:43,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:53:43,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-10-04 00:53:43,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-10-04 00:53:43,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2022-10-04 00:53:43,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 123 states. [2022-10-04 00:53:43,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-10-04 00:53:43,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:53:43,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.