/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_ok_longest.line519.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-04 01:00:08,536 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-04 01:00:08,539 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-04 01:00:08,560 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-04 01:00:08,560 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-04 01:00:08,561 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-04 01:00:08,562 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-04 01:00:08,563 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-04 01:00:08,564 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-04 01:00:08,565 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-04 01:00:08,565 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-04 01:00:08,566 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-04 01:00:08,566 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-04 01:00:08,567 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-04 01:00:08,567 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-04 01:00:08,568 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-04 01:00:08,568 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-04 01:00:08,569 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-04 01:00:08,570 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-04 01:00:08,571 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-04 01:00:08,572 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-04 01:00:08,573 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-04 01:00:08,573 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-04 01:00:08,574 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-04 01:00:08,576 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-04 01:00:08,576 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-04 01:00:08,576 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-04 01:00:08,577 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-04 01:00:08,577 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-04 01:00:08,578 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-04 01:00:08,578 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-04 01:00:08,578 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-04 01:00:08,579 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-04 01:00:08,579 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-04 01:00:08,580 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-04 01:00:08,580 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-04 01:00:08,580 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-04 01:00:08,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-04 01:00:08,581 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-04 01:00:08,581 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-04 01:00:08,591 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-04 01:00:08,592 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-04 01:00:08,611 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-04 01:00:08,612 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-04 01:00:08,612 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-04 01:00:08,612 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-04 01:00:08,612 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-04 01:00:08,613 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-04 01:00:08,613 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-04 01:00:08,613 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-04 01:00:08,613 INFO L138 SettingsManager]: * Use SBE=true [2022-10-04 01:00:08,613 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-04 01:00:08,614 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-04 01:00:08,614 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-04 01:00:08,614 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-04 01:00:08,614 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-04 01:00:08,614 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-04 01:00:08,614 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-04 01:00:08,614 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-04 01:00:08,614 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-04 01:00:08,614 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-04 01:00:08,615 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-04 01:00:08,615 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-04 01:00:08,615 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-04 01:00:08,615 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-04 01:00:08,615 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-04 01:00:08,615 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-04 01:00:08,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-04 01:00:08,615 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-04 01:00:08,616 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-04 01:00:08,616 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-04 01:00:08,616 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-04 01:00:08,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-04 01:00:08,616 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-04 01:00:08,616 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-04 01:00:08,616 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-04 01:00:08,616 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-04 01:00:08,616 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-04 01:00:08,617 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-04 01:00:08,617 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-04 01:00:08,617 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 01:00:08,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-04 01:00:08,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-04 01:00:08,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-04 01:00:08,804 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-04 01:00:08,809 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-04 01:00:08,809 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_ok_longest.line519.bpl [2022-10-04 01:00:08,810 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_ok_longest.line519.bpl' [2022-10-04 01:00:08,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-04 01:00:08,859 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-04 01:00:08,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-04 01:00:08,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-04 01:00:08,861 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-04 01:00:08,871 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue_ok_longest.line519.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:00:08" (1/1) ... [2022-10-04 01:00:08,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue_ok_longest.line519.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:00:08" (1/1) ... [2022-10-04 01:00:08,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue_ok_longest.line519.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:00:08" (1/1) ... [2022-10-04 01:00:08,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue_ok_longest.line519.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:00:08" (1/1) ... [2022-10-04 01:00:08,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue_ok_longest.line519.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:00:08" (1/1) ... [2022-10-04 01:00:08,922 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue_ok_longest.line519.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:00:08" (1/1) ... [2022-10-04 01:00:08,925 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue_ok_longest.line519.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:00:08" (1/1) ... [2022-10-04 01:00:08,929 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-04 01:00:08,940 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-04 01:00:08,940 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-04 01:00:08,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-04 01:00:08,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue_ok_longest.line519.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:00:08" (1/1) ... [2022-10-04 01:00:08,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-04 01:00:08,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 01:00:08,996 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 01:00:09,015 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 01:00:09,032 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-10-04 01:00:09,032 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-10-04 01:00:09,032 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-10-04 01:00:09,032 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-10-04 01:00:09,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-04 01:00:09,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-04 01:00:09,034 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 01:00:09,196 INFO L234 CfgBuilder]: Building ICFG [2022-10-04 01:00:09,197 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-04 01:00:09,579 INFO L275 CfgBuilder]: Performing block encoding [2022-10-04 01:00:09,592 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-04 01:00:09,592 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-04 01:00:09,594 INFO L202 PluginConnector]: Adding new model queue_ok_longest.line519.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 01:00:09 BoogieIcfgContainer [2022-10-04 01:00:09,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-04 01:00:09,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-04 01:00:09,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-04 01:00:09,599 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-04 01:00:09,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_ok_longest.line519.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:00:08" (1/2) ... [2022-10-04 01:00:09,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d978534 and model type queue_ok_longest.line519.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 01:00:09, skipping insertion in model container [2022-10-04 01:00:09,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_ok_longest.line519.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 01:00:09" (2/2) ... [2022-10-04 01:00:09,601 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.line519.bpl [2022-10-04 01:00:09,606 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-04 01:00:09,613 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-04 01:00:09,613 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-04 01:00:09,613 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-04 01:00:09,715 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-10-04 01:00:09,757 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 01:00:09,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 01:00:09,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 01:00:09,759 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 01:00:09,777 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 01:00:09,794 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 01:00:09,812 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-04 01:00:09,817 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;@4ceddb71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 01:00:09,817 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 01:00:09,886 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-04 01:00:09,897 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 01:00:09,898 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (1/4) [2022-10-04 01:00:09,905 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 01:00:09,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 01:00:09,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 01:00:09,917 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 01:00:09,918 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 01:00:09,921 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 01:00:09,922 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-04 01:00:09,923 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;@4ceddb71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 01:00:09,923 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 01:00:10,207 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-04 01:00:10,210 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 01:00:10,213 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/4) [2022-10-04 01:00:10,223 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 01:00:10,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 01:00:10,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 01:00:10,300 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 01:00:10,302 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 01:00:10,306 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 01:00:10,307 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Err0ASSERT_VIOLATIONASSERT ======== [2022-10-04 01:00:10,307 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;@4ceddb71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 01:00:10,307 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 01:00:10,308 WARN L124 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-10-04 01:00:10,308 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-04 01:00:10,308 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 01:00:10,308 INFO L307 ceAbstractionStarter]: Result for error location t2Err0ASSERT_VIOLATIONASSERT was SAFE (3/4) [2022-10-04 01:00:10,312 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 01:00:10,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 01:00:10,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 01:00:10,332 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 01:00:10,335 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 01:00:10,341 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 01:00:10,341 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Err0ASSERT_VIOLATIONASSERT ======== [2022-10-04 01:00:10,342 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;@4ceddb71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 01:00:10,342 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 01:00:10,429 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 01:00:10,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 01:00:10,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1694365332, now seen corresponding path program 1 times [2022-10-04 01:00:10,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 01:00:10,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346226320] [2022-10-04 01:00:10,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 01:00:10,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 01:00:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 01:00:10,679 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 01:00:10,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 01:00:10,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346226320] [2022-10-04 01:00:10,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346226320] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 01:00:10,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 01:00:10,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-04 01:00:10,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979979540] [2022-10-04 01:00:10,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 01:00:10,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-04 01:00:10,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 01:00:10,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-04 01:00:10,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-04 01:00:10,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:10,708 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 01:00:10,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 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 01:00:10,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:10,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:10,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-04 01:00:10,726 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 01:00:10,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 01:00:10,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1858318944, now seen corresponding path program 1 times [2022-10-04 01:00:10,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 01:00:10,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971890282] [2022-10-04 01:00:10,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 01:00:10,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 01:00:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 01:00:10,892 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 01:00:10,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 01:00:10,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971890282] [2022-10-04 01:00:10,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971890282] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 01:00:10,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 01:00:10,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-04 01:00:10,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785896311] [2022-10-04 01:00:10,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 01:00:10,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-04 01:00:10,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 01:00:10,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-04 01:00:10,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-04 01:00:10,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:10,895 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 01:00:10,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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 01:00:10,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:10,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:10,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:10,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:00:10,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-04 01:00:10,934 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 01:00:10,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 01:00:10,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1962206620, now seen corresponding path program 1 times [2022-10-04 01:00:10,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 01:00:10,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142810524] [2022-10-04 01:00:10,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 01:00:10,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 01:00:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 01:00:11,008 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 01:00:11,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 01:00:11,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142810524] [2022-10-04 01:00:11,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142810524] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 01:00:11,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 01:00:11,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-04 01:00:11,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145090363] [2022-10-04 01:00:11,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 01:00:11,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-04 01:00:11,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 01:00:11,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-04 01:00:11,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-04 01:00:11,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:11,010 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 01:00:11,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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 01:00:11,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:11,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:00:11,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:11,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:11,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:00:11,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:00:11,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-04 01:00:11,056 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 01:00:11,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 01:00:11,057 INFO L85 PathProgramCache]: Analyzing trace with hash -308886063, now seen corresponding path program 1 times [2022-10-04 01:00:11,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 01:00:11,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60152894] [2022-10-04 01:00:11,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 01:00:11,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 01:00:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 01:00:11,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-04 01:00:11,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 01:00:11,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60152894] [2022-10-04 01:00:11,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60152894] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 01:00:11,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 01:00:11,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-04 01:00:11,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398607103] [2022-10-04 01:00:11,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 01:00:11,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-04 01:00:11,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 01:00:11,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-04 01:00:11,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-04 01:00:11,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:11,199 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 01:00:11,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 60.666666666666664) internal successors, (364), 6 states have internal predecessors, (364), 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 01:00:11,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:11,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:00:11,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:00:11,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:11,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:11,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:00:11,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:00:11,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 01:00:11,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-04 01:00:11,313 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 01:00:11,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 01:00:11,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1033126061, now seen corresponding path program 2 times [2022-10-04 01:00:11,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 01:00:11,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268947196] [2022-10-04 01:00:11,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 01:00:11,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 01:00:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 01:00:11,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 01:00:11,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 01:00:11,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268947196] [2022-10-04 01:00:11,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268947196] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 01:00:11,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414429993] [2022-10-04 01:00:11,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-04 01:00:11,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 01:00:11,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 01:00:11,567 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 01:00:11,598 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 01:00:11,744 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-04 01:00:11,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-04 01:00:11,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-04 01:00:11,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 01:00:11,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-04 01:00:11,803 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-04 01:00:11,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414429993] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 01:00:11,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-04 01:00:11,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-10-04 01:00:11,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141008469] [2022-10-04 01:00:11,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 01:00:11,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-04 01:00:11,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 01:00:11,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-04 01:00:11,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-04 01:00:11,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:11,807 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 01:00:11,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 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 01:00:11,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:11,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:00:11,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:00:11,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 01:00:11,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:11,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:11,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:00:11,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:00:11,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 01:00:11,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-04 01:00:11,899 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 01:00:12,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 01:00:12,099 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 01:00:12,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 01:00:12,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1374952097, now seen corresponding path program 1 times [2022-10-04 01:00:12,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 01:00:12,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636324835] [2022-10-04 01:00:12,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 01:00:12,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 01:00:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 01:00:12,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 01:00:12,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 01:00:12,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636324835] [2022-10-04 01:00:12,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636324835] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 01:00:12,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113700811] [2022-10-04 01:00:12,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 01:00:12,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 01:00:12,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 01:00:12,184 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 01:00:12,200 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 01:00:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 01:00:12,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-04 01:00:12,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 01:00:12,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 01:00:12,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 01:00:12,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 01:00:12,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113700811] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 01:00:12,599 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 01:00:12,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-10-04 01:00:12,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218173176] [2022-10-04 01:00:12,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 01:00:12,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-04 01:00:12,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 01:00:12,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-04 01:00:12,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-10-04 01:00:12,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:12,602 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 01:00:12,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 52.5) internal successors, (525), 10 states have internal predecessors, (525), 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 01:00:12,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:12,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:00:12,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:00:12,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 01:00:12,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-10-04 01:00:12,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:12,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:12,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:00:12,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:00:12,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 01:00:12,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-04 01:00:12,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-04 01:00:12,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-04 01:00:12,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 01:00:12,931 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 01:00:12,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 01:00:12,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1814467147, now seen corresponding path program 2 times [2022-10-04 01:00:12,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 01:00:12,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581556084] [2022-10-04 01:00:12,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 01:00:12,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 01:00:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 01:00:13,164 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 01:00:13,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 01:00:13,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581556084] [2022-10-04 01:00:13,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581556084] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 01:00:13,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368443768] [2022-10-04 01:00:13,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-04 01:00:13,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 01:00:13,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 01:00:13,196 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 01:00:13,197 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 01:00:13,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-04 01:00:13,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-04 01:00:13,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-04 01:00:13,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 01:00:13,826 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 01:00:13,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 01:00:14,122 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 01:00:14,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368443768] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 01:00:14,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 01:00:14,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-10-04 01:00:14,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995703372] [2022-10-04 01:00:14,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 01:00:14,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-04 01:00:14,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 01:00:14,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-04 01:00:14,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-10-04 01:00:14,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:14,126 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 01:00:14,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 46.94444444444444) internal successors, (845), 18 states have internal predecessors, (845), 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 01:00:14,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:14,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:00:14,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:00:14,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 01:00:14,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-10-04 01:00:14,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-10-04 01:00:14,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:14,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:14,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:00:14,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:00:14,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 01:00:14,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-04 01:00:14,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-04 01:00:14,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-04 01:00:14,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-04 01:00:14,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 01:00:14,531 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 01:00:14,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 01:00:14,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1840392607, now seen corresponding path program 3 times [2022-10-04 01:00:14,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 01:00:14,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811469549] [2022-10-04 01:00:14,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 01:00:14,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 01:00:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 01:00:14,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1687 backedges. 0 proven. 1687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 01:00:14,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 01:00:14,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811469549] [2022-10-04 01:00:14,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811469549] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 01:00:14,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234274085] [2022-10-04 01:00:14,969 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-04 01:00:14,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 01:00:14,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 01:00:14,971 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-04 01:00:14,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-04 01:00:15,333 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-10-04 01:00:15,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-04 01:00:15,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 964 conjuncts, 72 conjunts are in the unsatisfiable core [2022-10-04 01:00:15,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 01:00:17,773 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 01:00:17,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 01:00:17,868 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 01:00:18,137 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 01:00:18,154 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-04 01:00:18,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-10-04 01:00:18,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 01:00:18,284 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 01:00:18,360 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 01:00:18,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-10-04 01:00:18,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1687 backedges. 487 proven. 370 refuted. 0 times theorem prover too weak. 830 trivial. 0 not checked. [2022-10-04 01:00:18,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 01:00:22,409 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_466 Int) (v_ArrVal_463 (Array Int Int))) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_463) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_466)) .cse1))))) is different from false [2022-10-04 01:00:22,429 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_466 Int) (v_ArrVal_463 (Array Int Int))) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| v_ArrVal_463) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_466)) .cse1))))))) is different from false [2022-10-04 01:00:22,461 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| Int) (v_ArrVal_466 Int) (v_ArrVal_463 (Array Int Int))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| |c_~#stored_elements~0.base|)) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| v_ArrVal_463) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_466)) .cse1)))))) is different from false [2022-10-04 01:00:22,517 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:00:22,517 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 38 [2022-10-04 01:00:22,542 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:00:22,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 63 [2022-10-04 01:00:22,547 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 63 treesize of output 51 [2022-10-04 01:00:22,565 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 01:00:22,572 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:00:22,572 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 49 treesize of output 45 [2022-10-04 01:00:23,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1687 backedges. 442 proven. 350 refuted. 0 times theorem prover too weak. 830 trivial. 65 not checked. [2022-10-04 01:00:23,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234274085] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 01:00:23,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 01:00:23,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23, 23] total 58 [2022-10-04 01:00:23,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37268107] [2022-10-04 01:00:23,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 01:00:23,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-10-04 01:00:23,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 01:00:23,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-10-04 01:00:23,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=2748, Unknown=8, NotChecked=324, Total=3306 [2022-10-04 01:00:23,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:23,564 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 01:00:23,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 28.0) internal successors, (1624), 58 states have internal predecessors, (1624), 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 01:00:23,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:23,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:00:23,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:00:23,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 01:00:23,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-10-04 01:00:23,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-10-04 01:00:23,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-10-04 01:00:23,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:23,911 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_write~int_#value#1| 1) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| Int) (v_ArrVal_466 Int) (v_ArrVal_463 (Array Int Int))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| |c_~#stored_elements~0.base|)) (not (= 800 (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse1 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| v_ArrVal_463) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|) v_ArrVal_466)) .cse2)))))) (= .cse0 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= |c_t1Thread1of1ForFork1_~i~0#1| 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 01:00:23,915 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| Int) (v_ArrVal_466 Int) (v_ArrVal_463 (Array Int Int))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| |c_~#stored_elements~0.base|)) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| v_ArrVal_463) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_466)) .cse1)))))) (= |c_t1Thread1of1ForFork1_~i~0#1| 0) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:00:23,918 WARN L833 $PredicateComparison]: unable to prove that (and (<= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_466 Int) (v_ArrVal_463 (Array Int Int))) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| v_ArrVal_463) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_466)) .cse1))))))) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_~i~0#1| 0) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:00:25,955 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_write~int_#value#1| 1) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| Int) (v_ArrVal_466 Int) (v_ArrVal_463 (Array Int Int))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| |c_~#stored_elements~0.base|)) (not (= 800 (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse1 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| v_ArrVal_463) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|) v_ArrVal_466)) .cse2)))))) (<= |c_t1Thread1of1ForFork1_~i~0#1| 2) (= .cse0 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 01:00:25,958 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| Int) (v_ArrVal_466 Int) (v_ArrVal_463 (Array Int Int))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| |c_~#stored_elements~0.base|)) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| v_ArrVal_463) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_466)) .cse1)))))) (<= |c_t1Thread1of1ForFork1_~i~0#1| 2) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:00:25,961 WARN L833 $PredicateComparison]: unable to prove that (and (<= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_466 Int) (v_ArrVal_463 (Array Int Int))) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| v_ArrVal_463) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_466)) .cse1))))))) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_~i~0#1| 2) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:00:27,896 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_write~int_#value#1| 1) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| Int) (v_ArrVal_466 Int) (v_ArrVal_463 (Array Int Int))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| |c_~#stored_elements~0.base|)) (not (= 800 (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse1 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| v_ArrVal_463) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|) v_ArrVal_466)) .cse2)))))) (= .cse0 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (<= |c_t1Thread1of1ForFork1_~i~0#1| 4) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 01:00:27,899 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| Int) (v_ArrVal_466 Int) (v_ArrVal_463 (Array Int Int))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| |c_~#stored_elements~0.base|)) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| v_ArrVal_463) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_466)) .cse1)))))) (<= |c_t1Thread1of1ForFork1_~i~0#1| 4) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:00:27,902 WARN L833 $PredicateComparison]: unable to prove that (and (<= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_466 Int) (v_ArrVal_463 (Array Int Int))) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| v_ArrVal_463) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_466)) .cse1))))))) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_~i~0#1| 4) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:00:29,749 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_write~int_#value#1| 1) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| Int) (v_ArrVal_466 Int) (v_ArrVal_463 (Array Int Int))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| |c_~#stored_elements~0.base|)) (not (= 800 (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse1 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| v_ArrVal_463) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|) v_ArrVal_466)) .cse2)))))) (= .cse0 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork1_~i~0#1| 6))) is different from false [2022-10-04 01:00:29,752 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| Int) (v_ArrVal_466 Int) (v_ArrVal_463 (Array Int Int))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| |c_~#stored_elements~0.base|)) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| v_ArrVal_463) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_466)) .cse1)))))) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork1_~i~0#1| 6)) is different from false [2022-10-04 01:00:29,756 WARN L833 $PredicateComparison]: unable to prove that (and (<= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_466 Int) (v_ArrVal_463 (Array Int Int))) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| v_ArrVal_463) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_466)) .cse1))))))) (= |c_~#queue~0.offset| 0) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork1_~i~0#1| 6)) is different from false [2022-10-04 01:00:31,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:31,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:00:31,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:00:31,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 01:00:31,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-04 01:00:31,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-04 01:00:31,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-04 01:00:31,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2022-10-04 01:00:31,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-10-04 01:00:31,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-10-04 01:00:31,427 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 01:00:31,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 01:00:31,428 INFO L85 PathProgramCache]: Analyzing trace with hash -82736524, now seen corresponding path program 1 times [2022-10-04 01:00:31,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 01:00:31,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953898242] [2022-10-04 01:00:31,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 01:00:31,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 01:00:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 01:00:31,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2170 backedges. 0 proven. 2170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 01:00:31,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 01:00:31,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953898242] [2022-10-04 01:00:31,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953898242] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 01:00:31,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432159953] [2022-10-04 01:00:31,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 01:00:31,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 01:00:31,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 01:00:31,906 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-04 01:00:31,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-04 01:00:32,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 01:00:32,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 2082 conjuncts, 18 conjunts are in the unsatisfiable core [2022-10-04 01:00:32,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 01:00:32,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2170 backedges. 0 proven. 2170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 01:00:32,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 01:00:33,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2170 backedges. 0 proven. 2170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 01:00:33,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432159953] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 01:00:33,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 01:00:33,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 38 [2022-10-04 01:00:33,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725234743] [2022-10-04 01:00:33,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 01:00:33,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-10-04 01:00:33,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 01:00:33,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-10-04 01:00:33,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=1026, Unknown=0, NotChecked=0, Total=1406 [2022-10-04 01:00:33,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:33,292 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 01:00:33,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 45.60526315789474) internal successors, (1733), 38 states have internal predecessors, (1733), 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 01:00:33,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:33,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:00:33,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:00:33,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 01:00:33,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-10-04 01:00:33,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-10-04 01:00:33,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-10-04 01:00:33,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 149 states. [2022-10-04 01:00:33,294 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:33,797 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_write~int_#value#1| 1) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| Int) (v_ArrVal_466 Int) (v_ArrVal_463 (Array Int Int))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| |c_~#stored_elements~0.base|)) (not (= 800 (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse1 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| v_ArrVal_463) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|) v_ArrVal_466)) .cse2)))))) (= .cse0 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 01:00:33,800 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| Int) (v_ArrVal_466 Int) (v_ArrVal_463 (Array Int Int))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| |c_~#stored_elements~0.base|)) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| v_ArrVal_463) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_466)) .cse1)))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:00:33,802 WARN L833 $PredicateComparison]: unable to prove that (and (<= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_466 Int) (v_ArrVal_463 (Array Int Int))) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| v_ArrVal_463) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_466)) .cse1))))))) (= |c_~#queue~0.offset| 0) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:00:34,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:34,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:00:34,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:00:34,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 01:00:34,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-04 01:00:34,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-04 01:00:34,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-04 01:00:34,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2022-10-04 01:00:34,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-10-04 01:00:34,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-10-04 01:00:35,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 01:00:35,098 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 01:00:35,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 01:00:35,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1150484001, now seen corresponding path program 2 times [2022-10-04 01:00:35,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 01:00:35,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122221740] [2022-10-04 01:00:35,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 01:00:35,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 01:00:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 01:00:36,492 INFO L134 CoverageAnalysis]: Checked inductivity of 10557 backedges. 0 proven. 10557 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 01:00:36,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 01:00:36,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122221740] [2022-10-04 01:00:36,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122221740] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 01:00:36,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254768287] [2022-10-04 01:00:36,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-04 01:00:36,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 01:00:36,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 01:00:36,494 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-04 01:00:36,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-10-04 01:00:37,128 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-04 01:00:37,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-04 01:00:37,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 3719 conjuncts, 36 conjunts are in the unsatisfiable core [2022-10-04 01:00:37,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 01:00:38,204 INFO L134 CoverageAnalysis]: Checked inductivity of 10557 backedges. 0 proven. 10557 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 01:00:38,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 01:00:39,656 INFO L134 CoverageAnalysis]: Checked inductivity of 10557 backedges. 0 proven. 10557 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 01:00:39,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254768287] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 01:00:39,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 01:00:39,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 74 [2022-10-04 01:00:39,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865244102] [2022-10-04 01:00:39,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 01:00:39,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-10-04 01:00:39,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 01:00:39,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-10-04 01:00:39,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1406, Invalid=3996, Unknown=0, NotChecked=0, Total=5402 [2022-10-04 01:00:39,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:39,666 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 01:00:39,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 44.067567567567565) internal successors, (3261), 74 states have internal predecessors, (3261), 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 01:00:39,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:39,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:00:39,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:00:39,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 01:00:39,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-10-04 01:00:39,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-10-04 01:00:39,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-10-04 01:00:39,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 169 states. [2022-10-04 01:00:39,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2022-10-04 01:00:39,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:41,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:41,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:00:41,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:00:41,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 01:00:41,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-04 01:00:41,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-04 01:00:41,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-04 01:00:41,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2022-10-04 01:00:41,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-10-04 01:00:41,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-10-04 01:00:41,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-10-04 01:00:41,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-10-04 01:00:41,853 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 01:00:41,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 01:00:41,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1542925642, now seen corresponding path program 3 times [2022-10-04 01:00:41,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 01:00:41,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549862971] [2022-10-04 01:00:41,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 01:00:41,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 01:00:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 01:00:46,645 INFO L134 CoverageAnalysis]: Checked inductivity of 46377 backedges. 0 proven. 46377 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 01:00:46,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 01:00:46,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549862971] [2022-10-04 01:00:46,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549862971] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 01:00:46,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208017788] [2022-10-04 01:00:46,647 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-04 01:00:46,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 01:00:46,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 01:00:46,648 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-04 01:00:46,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-10-04 01:00:47,264 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-10-04 01:00:47,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-04 01:00:47,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 121 conjunts are in the unsatisfiable core [2022-10-04 01:00:47,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 01:00:58,193 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 01:00:58,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 01:00:58,383 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 01:00:59,061 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 01:00:59,069 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-04 01:00:59,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-10-04 01:00:59,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 01:00:59,361 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 01:00:59,547 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 01:00:59,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-10-04 01:00:59,824 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 01:01:00,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 01:01:00,029 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 01:01:00,639 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 01:01:00,646 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-04 01:01:00,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-10-04 01:01:00,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 01:01:00,920 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 01:01:01,122 INFO L134 CoverageAnalysis]: Checked inductivity of 46377 backedges. 5347 proven. 2142 refuted. 0 times theorem prover too weak. 38888 trivial. 0 not checked. [2022-10-04 01:01:01,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 01:01:24,842 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1569 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_1569) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800)) is different from false [2022-10-04 01:01:24,860 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1569 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| v_ArrVal_1569) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800)))) is different from false [2022-10-04 01:01:24,872 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1569 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| Int)) (or (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| v_ArrVal_1569) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 01:01:24,941 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:01:24,942 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-10-04 01:01:24,947 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:01:24,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2022-10-04 01:01:24,950 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 11 treesize of output 7 [2022-10-04 01:02:19,024 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_~#stored_elements~0.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1562 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| v_ArrVal_1562) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 799))))) is different from false [2022-10-04 01:02:19,037 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1562 (Array Int Int))) (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| v_ArrVal_1562) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 799)))) (< |c_~#stored_elements~0.base| |c_~#queue~0.base|)) is different from false [2022-10-04 01:02:19,077 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:02:19,078 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-10-04 01:02:19,084 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:02:19,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 46 [2022-10-04 01:02:19,088 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 28 treesize of output 24 [2022-10-04 01:02:23,964 INFO L134 CoverageAnalysis]: Checked inductivity of 46377 backedges. 4771 proven. 2002 refuted. 0 times theorem prover too weak. 38888 trivial. 716 not checked. [2022-10-04 01:02:23,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208017788] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 01:02:23,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 01:02:23,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 37, 39] total 144 [2022-10-04 01:02:23,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43355376] [2022-10-04 01:02:23,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 01:02:23,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 144 states [2022-10-04 01:02:23,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 01:02:23,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2022-10-04 01:02:23,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1817, Invalid=17251, Unknown=134, NotChecked=1390, Total=20592 [2022-10-04 01:02:23,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:02:23,979 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 01:02:23,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 144 states, 144 states have (on average 29.6875) internal successors, (4275), 144 states have internal predecessors, (4275), 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 01:02:23,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:02:23,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:02:23,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:02:23,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 01:02:23,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-10-04 01:02:23,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-10-04 01:02:23,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-10-04 01:02:23,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 169 states. [2022-10-04 01:02:23,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2022-10-04 01:02:23,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2022-10-04 01:02:23,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:02:24,477 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1562 (Array Int Int))) (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| v_ArrVal_1562) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 799)))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_write~int_#value#1| 1) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (< |c_~#stored_elements~0.base| |c_~#queue~0.base|) (= .cse0 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= |c_t1Thread1of1ForFork1_~i~0#1| 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 01:02:24,480 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1562 (Array Int Int))) (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| v_ArrVal_1562) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 799)))) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (< |c_~#stored_elements~0.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork1_~i~0#1| 0) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:02:24,485 WARN L833 $PredicateComparison]: unable to prove that (and (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (< |c_~#stored_elements~0.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork1_~i~0#1| 0) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1562 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| v_ArrVal_1562) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 799)))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:02:25,676 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1)) (.cse0 (+ |c_~#queue~0.offset| 3204))) (and (<= |c_t1Thread1of1ForFork1_~i~0#1| 1) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| 1) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int) (v_ArrVal_1566 Int)) (or (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185|) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| .cse2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| (+ (* .cse2 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse0) 1) (<= |c_~#stored_elements~0.base| 6)))) is different from false [2022-10-04 01:02:26,713 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (<= |c_t1Thread1of1ForFork1_~i~0#1| 1) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (<= |c_t1Thread1of1ForFork1_write~int_#value#1| 2) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| 1) (<= |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1) (= .cse0 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 2) (forall ((v_ArrVal_1569 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| Int)) (or (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| v_ArrVal_1569) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| |c_~#stored_elements~0.base|)))) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse0) 1) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 01:02:26,716 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork1_~i~0#1| 1) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (forall ((v_ArrVal_1569 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| Int)) (or (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| v_ArrVal_1569) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| |c_~#stored_elements~0.base|)))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:02:26,721 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork1_~i~0#1| 1) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1569 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| v_ArrVal_1569) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800)))) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:02:27,465 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |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|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184| Int)) (or (forall ((v_ArrVal_1566 Int)) (< (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184|)))) (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799) (<= |c_t1Thread1of1ForFork1_~i~0#1| 2) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse0) 2) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204)) 799) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 01:02:27,882 WARN L833 $PredicateComparison]: unable to prove that (and (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 799) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int) (v_ArrVal_1566 Int)) (or (< (+ (* (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_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185|) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799))) (= |c_~#queue~0.offset| 0) (= (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (<= |c_t1Thread1of1ForFork1_~i~0#1| 2) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:02:28,235 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int) (v_ArrVal_1566 Int)) (or (< (+ (* (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_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185|) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799))) (= |c_~#queue~0.offset| 0) (= (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (<= |c_t1Thread1of1ForFork1_~i~0#1| 2) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:02:28,593 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int) (v_ArrVal_1566 Int)) (or (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185|) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799))) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (<= |c_t1Thread1of1ForFork1_~i~0#1| 2) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:02:28,938 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int)) (or (forall ((v_ArrVal_1566 Int)) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))))) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_~i~0#1| 2) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:02:29,290 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (<= |c_t1Thread1of1ForFork1_~i~0#1| 2) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int)) (or (forall ((v_ArrVal_1566 Int)) (< (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:02:29,833 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184| Int)) (or (forall ((v_ArrVal_1566 Int)) (< (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184|)))) (<= |c_t1Thread1of1ForFork1_~i~0#1| 2) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse0) 2) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 01:02:30,136 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184| Int)) (or (forall ((v_ArrVal_1566 Int)) (< (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184|)))) (<= |c_t1Thread1of1ForFork1_~i~0#1| 2) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:02:30,802 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 799) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int) (v_ArrVal_1566 Int)) (or (< (+ (* (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_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185|) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799))) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (<= |c_t1Thread1of1ForFork1_~i~0#1| 2) (forall ((v_ArrVal_1566 Int)) (< (select (select (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_1566)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse0) 2) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 01:02:31,299 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int) (v_ArrVal_1566 Int)) (or (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185|) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799))) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| .cse0) (< |c_t1Thread1of1ForFork1_read~int_#value#1| 799) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| .cse0) (<= |c_t1Thread1of1ForFork1_~i~0#1| 2) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 01:02:31,739 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork1_~i~0#1| 3) (< |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 799) (< |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 799) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (< |c_t1Thread1of1ForFork1_read~int_#value#1| 799) (< |c_t1Thread1of1ForFork1_write~int_#value#1| 800) (= (+ |c_~#queue~0.offset| 3204) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1569 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| Int)) (or (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| v_ArrVal_1569) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| |c_~#stored_elements~0.base|)))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:02:31,750 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork1_~i~0#1| 3) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_1569 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| Int)) (or (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| v_ArrVal_1569) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| |c_~#stored_elements~0.base|)))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:02:31,757 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork1_~i~0#1| 3) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1569 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| v_ArrVal_1569) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800)))) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:02:31,761 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork1_~i~0#1| 3) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_1569 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_1569) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800)) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:02:32,549 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |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_~i~0#1| 4) (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 800) (forall ((v_ArrVal_1573 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_181| Int)) (or (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_181| v_ArrVal_1573) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800) (< (+ (* (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_t1Thread1of1ForFork1_write~int_#ptr#1.offset_181|))) (<= |c_~#stored_elements~0.base| 6) (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204)) 800)) is different from false [2022-10-04 01:04:02,042 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_1573 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_181| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_181| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (< (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_181| v_ArrVal_1573) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800))) (forall ((v_ArrVal_1573 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_181| Int)) (or (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_181| v_ArrVal_1573) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_181| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))))) (< (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800) (<= |c_t1Thread1of1ForFork1_~i~0#1| 4) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:04:23,745 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1562 (Array Int Int))) (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| v_ArrVal_1562) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 799)))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork1_~i~0#1| 5) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_write~int_#value#1| 1) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (< |c_~#stored_elements~0.base| |c_~#queue~0.base|) (= .cse0 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 01:04:23,748 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1562 (Array Int Int))) (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| v_ArrVal_1562) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 799)))) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (< |c_~#stored_elements~0.base| |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork1_~i~0#1| 6)) is different from false [2022-10-04 01:04:23,752 WARN L833 $PredicateComparison]: unable to prove that (and (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (< |c_~#stored_elements~0.base| |c_~#queue~0.base|) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1562 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| v_ArrVal_1562) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 799)))) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork1_~i~0#1| 6)) is different from false [2022-10-04 01:04:27,935 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |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|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184| Int)) (or (forall ((v_ArrVal_1566 Int)) (< (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184|)))) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse0) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_t1Thread1of1ForFork1_~i~0#1| 7) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 01:04:30,993 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1)) (.cse0 (+ |c_~#queue~0.offset| 3204))) (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| 1) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int) (v_ArrVal_1566 Int)) (or (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185|) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799))) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| .cse2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_t1Thread1of1ForFork1_~i~0#1| 7) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| (+ (* .cse2 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse0) 1) (<= |c_~#stored_elements~0.base| 6)))) is different from false [2022-10-04 01:04:34,245 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (<= |c_t1Thread1of1ForFork1_write~int_#value#1| 2) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| 1) (<= |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1) (= .cse0 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 2) (<= |c_t1Thread1of1ForFork1_~i~0#1| 7) (forall ((v_ArrVal_1569 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| Int)) (or (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| v_ArrVal_1569) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| |c_~#stored_elements~0.base|)))) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse0) 1) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 01:04:34,248 WARN L833 $PredicateComparison]: unable to prove that (and (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (<= |c_t1Thread1of1ForFork1_~i~0#1| 7) (forall ((v_ArrVal_1569 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| Int)) (or (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| v_ArrVal_1569) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| |c_~#stored_elements~0.base|)))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:04:34,253 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1569 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| v_ArrVal_1569) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800)))) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (<= |c_t1Thread1of1ForFork1_~i~0#1| 7) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:04:41,096 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (<= |c_t1Thread1of1ForFork1_~i~0#1| 8) (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 799) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| 6) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int) (v_ArrVal_1566 Int)) (or (< (+ (* (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_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185|) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799))) (= |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|) (forall ((v_ArrVal_1562 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_1562) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 799)) (= (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (forall ((v_ArrVal_1566 Int)) (< (select (select (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_1566)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)) (< |c_~#stored_elements~0.base| |c_~#queue~0.base|) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse0) 2) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204)) 799) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 01:04:41,440 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork1_~i~0#1| 8) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int) (v_ArrVal_1566 Int)) (or (< (+ (* (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_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185|) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799))) (= |c_~#queue~0.offset| 0) (= (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:04:41,797 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork1_~i~0#1| 8) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int) (v_ArrVal_1566 Int)) (or (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185|) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799))) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:04:42,140 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork1_~i~0#1| 8) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int)) (or (forall ((v_ArrVal_1566 Int)) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))))) (= |c_~#queue~0.offset| 0) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:04:42,519 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork1_~i~0#1| 8) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int)) (or (forall ((v_ArrVal_1566 Int)) (< (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:04:45,184 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (<= |c_t1Thread1of1ForFork1_~i~0#1| 8) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184| Int)) (or (forall ((v_ArrVal_1566 Int)) (< (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184|)))) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse0) 2) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 01:04:45,483 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork1_~i~0#1| 8) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184| Int)) (or (forall ((v_ArrVal_1566 Int)) (< (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184|)))) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:04:48,584 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (<= |c_t1Thread1of1ForFork1_~i~0#1| 8) (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 799) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int) (v_ArrVal_1566 Int)) (or (< (+ (* (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_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185|) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799))) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (forall ((v_ArrVal_1566 Int)) (< (select (select (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_1566)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse0) 2) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 01:04:50,160 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork1_~i~0#1| 8) (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 799) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int) (v_ArrVal_1566 Int)) (or (< (+ (* (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_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185|) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799))) (= |c_~#queue~0.offset| 0) (= (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:04:50,585 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))) (and (<= |c_t1Thread1of1ForFork1_~i~0#1| 8) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int) (v_ArrVal_1566 Int)) (or (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185|) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799))) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| .cse0) (< |c_t1Thread1of1ForFork1_read~int_#value#1| 799) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| .cse0) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 01:04:54,549 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (< |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 799) (< |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 799) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (< |c_t1Thread1of1ForFork1_read~int_#value#1| 799) (< |c_t1Thread1of1ForFork1_write~int_#value#1| 800) (= .cse0 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (< (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 800) (<= |c_t1Thread1of1ForFork1_~i~0#1| 9) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1569 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| Int)) (or (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| v_ArrVal_1569) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| |c_~#stored_elements~0.base|)))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 01:04:54,553 WARN L833 $PredicateComparison]: unable to prove that (and (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_~i~0#1| 9) (forall ((v_ArrVal_1569 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| Int)) (or (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| v_ArrVal_1569) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| |c_~#stored_elements~0.base|)))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:04:54,563 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1569 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| v_ArrVal_1569) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800)))) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_~i~0#1| 9) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:04:54,567 WARN L833 $PredicateComparison]: unable to prove that (and (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_1569 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_1569) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800)) (<= |c_t1Thread1of1ForFork1_~i~0#1| 9) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:04:58,555 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |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|) (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 800) (forall ((v_ArrVal_1573 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_181| Int)) (or (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_181| v_ArrVal_1573) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800) (< (+ (* (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_t1Thread1of1ForFork1_write~int_#ptr#1.offset_181|))) (<= |c_~#stored_elements~0.base| 6) (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204)) 800) (<= |c_t1Thread1of1ForFork1_~i~0#1| 10)) is different from false [2022-10-04 01:07:10,506 WARN L233 SmtUtils]: Spent 5.27s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:07:10,970 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_1573 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_181| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_181| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (< (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_181| v_ArrVal_1573) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800))) (forall ((v_ArrVal_1573 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_181| Int)) (or (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_181| v_ArrVal_1573) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_181| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))))) (< (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800) (forall ((v_ArrVal_1573 Int)) (< (select (select (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_1573)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800)) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork1_~i~0#1| 10)) is different from false [2022-10-04 01:07:49,849 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (<= |c_t1Thread1of1ForFork1_~i~0#1| 11) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1562 (Array Int Int))) (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| v_ArrVal_1562) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 799)))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_write~int_#value#1| 1) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (< |c_~#stored_elements~0.base| |c_~#queue~0.base|) (= .cse0 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 01:07:49,852 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (<= |c_t1Thread1of1ForFork1_~i~0#1| 12) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1562 (Array Int Int))) (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| v_ArrVal_1562) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 799)))) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (< |c_~#stored_elements~0.base| |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:07:49,857 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork1_~i~0#1| 12) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (< |c_~#stored_elements~0.base| |c_~#queue~0.base|) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1562 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| v_ArrVal_1562) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 799)))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:07:59,866 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse2)) (.cse3 (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse0))) (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| .cse1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (<= |c_t1Thread1of1ForFork1_~i~0#1| 13) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| 6) (= |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|) (forall ((v_ArrVal_1562 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_1562) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 799)) (= .cse2 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| .cse1) (forall ((v_ArrVal_1566 Int)) (< (select (select (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_1566)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)) (< |c_~#stored_elements~0.base| |c_~#queue~0.base|) (<= .cse3 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= .cse3 1) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int)) (or (forall ((v_ArrVal_1566 Int)) (< (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))))) (<= |c_~#stored_elements~0.base| 6)))) is different from false [2022-10-04 01:08:11,678 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (<= |c_t1Thread1of1ForFork1_~i~0#1| 13) (<= |c_t1Thread1of1ForFork1_write~int_#value#1| 2) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| 1) (<= |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1) (= .cse0 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 2) (forall ((v_ArrVal_1569 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| Int)) (or (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| v_ArrVal_1569) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| |c_~#stored_elements~0.base|)))) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse0) 1) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 01:08:11,682 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork1_~i~0#1| 13) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (forall ((v_ArrVal_1569 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| Int)) (or (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| v_ArrVal_1569) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| |c_~#stored_elements~0.base|)))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:08:11,688 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1569 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| v_ArrVal_1569) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800)))) (<= |c_t1Thread1of1ForFork1_~i~0#1| 13) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:08:24,709 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 799) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| 6) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int) (v_ArrVal_1566 Int)) (or (< (+ (* (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_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185|) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799))) (= |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|) (forall ((v_ArrVal_1562 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_1562) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 799)) (= (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (forall ((v_ArrVal_1566 Int)) (< (select (select (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_1566)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)) (< |c_~#stored_elements~0.base| |c_~#queue~0.base|) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse0) 2) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_t1Thread1of1ForFork1_~i~0#1| 14) (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204)) 799) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 01:08:25,054 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int) (v_ArrVal_1566 Int)) (or (< (+ (* (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_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185|) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799))) (= |c_~#queue~0.offset| 0) (= (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_t1Thread1of1ForFork1_~i~0#1| 14) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:08:25,401 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int) (v_ArrVal_1566 Int)) (or (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185|) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799))) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_t1Thread1of1ForFork1_~i~0#1| 14) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:08:25,761 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int)) (or (forall ((v_ArrVal_1566 Int)) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))))) (= |c_~#queue~0.offset| 0) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_t1Thread1of1ForFork1_~i~0#1| 14) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:08:26,107 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_t1Thread1of1ForFork1_~i~0#1| 14) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int)) (or (forall ((v_ArrVal_1566 Int)) (< (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:08:30,379 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184| Int)) (or (forall ((v_ArrVal_1566 Int)) (< (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184|)))) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse0) 2) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_t1Thread1of1ForFork1_~i~0#1| 14) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 01:08:30,690 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184| Int)) (or (forall ((v_ArrVal_1566 Int)) (< (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184|)))) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_t1Thread1of1ForFork1_~i~0#1| 14) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:08:36,006 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 799) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int) (v_ArrVal_1566 Int)) (or (< (+ (* (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_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185|) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799))) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (forall ((v_ArrVal_1566 Int)) (< (select (select (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_1566)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse0) 2) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_t1Thread1of1ForFork1_~i~0#1| 14) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 01:08:39,319 WARN L833 $PredicateComparison]: unable to prove that (and (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 799) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int) (v_ArrVal_1566 Int)) (or (< (+ (* (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_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185|) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799))) (= |c_~#queue~0.offset| 0) (= (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_t1Thread1of1ForFork1_~i~0#1| 14) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:08:39,756 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int) (v_ArrVal_1566 Int)) (or (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185|) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799))) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| .cse0) (< |c_t1Thread1of1ForFork1_read~int_#value#1| 799) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| .cse0) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_t1Thread1of1ForFork1_~i~0#1| 14) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 01:08:48,904 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (< |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 799) (< |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 799) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_~i~0#1| 15) (< |c_t1Thread1of1ForFork1_read~int_#value#1| 799) (< |c_t1Thread1of1ForFork1_write~int_#value#1| 800) (= .cse0 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (< (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 800) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1569 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| Int)) (or (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| v_ArrVal_1569) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| |c_~#stored_elements~0.base|)))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 01:08:48,908 WARN L833 $PredicateComparison]: unable to prove that (and (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_~i~0#1| 15) (forall ((v_ArrVal_1569 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| Int)) (or (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| v_ArrVal_1569) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| |c_~#stored_elements~0.base|)))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:08:48,933 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1569 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| v_ArrVal_1569) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800)))) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_~i~0#1| 15) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:08:48,937 WARN L833 $PredicateComparison]: unable to prove that (and (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_~i~0#1| 15) (forall ((v_ArrVal_1569 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_1569) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800)) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:08:55,297 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |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_~i~0#1| 16) (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 800) (forall ((v_ArrVal_1573 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_181| Int)) (or (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_181| v_ArrVal_1573) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800) (< (+ (* (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_t1Thread1of1ForFork1_write~int_#ptr#1.offset_181|))) (<= |c_~#stored_elements~0.base| 6) (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204)) 800)) is different from false [2022-10-04 01:10:53,024 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_1573 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_181| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_181| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (< (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_181| v_ArrVal_1573) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800))) (forall ((v_ArrVal_1573 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_181| Int)) (or (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_181| v_ArrVal_1573) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_181| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))))) (<= |c_t1Thread1of1ForFork1_~i~0#1| 16) (< (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:11:47,100 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1562 (Array Int Int))) (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| v_ArrVal_1562) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 799)))) (<= |c_t1Thread1of1ForFork1_~i~0#1| 17) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_write~int_#value#1| 1) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (< |c_~#stored_elements~0.base| |c_~#queue~0.base|) (= .cse0 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 01:11:47,104 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1562 (Array Int Int))) (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| v_ArrVal_1562) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 799)))) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (< |c_~#stored_elements~0.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork1_~i~0#1| 18) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:11:47,108 WARN L833 $PredicateComparison]: unable to prove that (and (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (< |c_~#stored_elements~0.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork1_~i~0#1| 18) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1562 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| v_ArrVal_1562) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 799)))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:12:01,188 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse2)) (.cse0 (+ |c_~#queue~0.offset| 3204))) (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| .cse1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |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_write~int_#ptr#1.base| |c_~#stored_elements~0.base|) (<= |c_t1Thread1of1ForFork1_~i~0#1| 19) (= .cse2 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| .cse1) (forall ((v_ArrVal_1566 Int)) (< (select (select (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_1566)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse0) 1) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int)) (or (forall ((v_ArrVal_1566 Int)) (< (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))))) (<= |c_~#stored_elements~0.base| 6)))) is different from false [2022-10-04 01:12:20,296 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (<= |c_t1Thread1of1ForFork1_write~int_#value#1| 2) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| 1) (<= |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1) (<= |c_t1Thread1of1ForFork1_~i~0#1| 19) (= .cse0 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 2) (forall ((v_ArrVal_1569 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| Int)) (or (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| v_ArrVal_1569) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| |c_~#stored_elements~0.base|)))) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse0) 1) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 01:12:20,299 WARN L833 $PredicateComparison]: unable to prove that (and (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_~i~0#1| 19) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (forall ((v_ArrVal_1569 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| Int)) (or (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| v_ArrVal_1569) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| |c_~#stored_elements~0.base|)))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:12:20,304 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1569 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| v_ArrVal_1569) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800)))) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_~i~0#1| 19) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:12:39,614 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 799) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| 6) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int) (v_ArrVal_1566 Int)) (or (< (+ (* (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_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185|) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799))) (= |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|) (forall ((v_ArrVal_1562 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_1562) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 799)) (= (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (forall ((v_ArrVal_1566 Int)) (< (select (select (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_1566)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)) (< |c_~#stored_elements~0.base| |c_~#queue~0.base|) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse0) 2) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_t1Thread1of1ForFork1_~i~0#1| 20) (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204)) 799) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 01:12:39,957 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int) (v_ArrVal_1566 Int)) (or (< (+ (* (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_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185|) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799))) (= |c_~#queue~0.offset| 0) (= (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_t1Thread1of1ForFork1_~i~0#1| 20) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:12:40,327 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int) (v_ArrVal_1566 Int)) (or (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185|) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799))) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_t1Thread1of1ForFork1_~i~0#1| 20) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:12:40,671 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int)) (or (forall ((v_ArrVal_1566 Int)) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))))) (= |c_~#queue~0.offset| 0) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_t1Thread1of1ForFork1_~i~0#1| 20) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:12:41,046 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_t1Thread1of1ForFork1_~i~0#1| 20) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int)) (or (forall ((v_ArrVal_1566 Int)) (< (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:12:47,613 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184| Int)) (or (forall ((v_ArrVal_1566 Int)) (< (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184|)))) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse0) 2) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_t1Thread1of1ForFork1_~i~0#1| 20) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 01:12:47,917 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184| Int)) (or (forall ((v_ArrVal_1566 Int)) (< (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184|)))) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_t1Thread1of1ForFork1_~i~0#1| 20) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:12:55,750 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 799) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int) (v_ArrVal_1566 Int)) (or (< (+ (* (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_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185|) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799))) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (forall ((v_ArrVal_1566 Int)) (< (select (select (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_1566)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse0) 2) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_t1Thread1of1ForFork1_~i~0#1| 20) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 01:13:00,130 WARN L833 $PredicateComparison]: unable to prove that (and (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 799) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int) (v_ArrVal_1566 Int)) (or (< (+ (* (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_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185|) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799))) (= |c_~#queue~0.offset| 0) (= (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_t1Thread1of1ForFork1_~i~0#1| 20) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:13:00,567 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| Int) (v_ArrVal_1566 Int)) (or (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185|) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_185| v_ArrVal_1566) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799))) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| .cse0) (< |c_t1Thread1of1ForFork1_read~int_#value#1| 799) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| .cse0) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_t1Thread1of1ForFork1_~i~0#1| 20) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 01:13:13,077 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (< |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 799) (< |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 799) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork1_~i~0#1| 21) (= |c_~#queue~0.offset| 0) (< |c_t1Thread1of1ForFork1_read~int_#value#1| 799) (< |c_t1Thread1of1ForFork1_write~int_#value#1| 800) (= .cse0 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (< (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 800) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1569 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| Int)) (or (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| v_ArrVal_1569) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| |c_~#stored_elements~0.base|)))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 01:13:13,083 WARN L833 $PredicateComparison]: unable to prove that (and (<= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork1_~i~0#1| 21) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_1569 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| Int)) (or (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| v_ArrVal_1569) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| |c_~#stored_elements~0.base|)))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:13:13,091 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1569 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_192| v_ArrVal_1569) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800)))) (<= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork1_~i~0#1| 21) (= |c_~#queue~0.offset| 0) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:13:13,095 WARN L833 $PredicateComparison]: unable to prove that (and (<= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork1_~i~0#1| 21) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_1569 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_1569) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800)) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:13:22,778 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (<= |c_t1Thread1of1ForFork1_~i~0#1| 22) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |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|) (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 800) (forall ((v_ArrVal_1573 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_181| Int)) (or (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_181| v_ArrVal_1573) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800) (< (+ (* (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_t1Thread1of1ForFork1_write~int_#ptr#1.offset_181|))) (<= |c_~#stored_elements~0.base| 6) (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204)) 800)) is different from false Received shutdown request... [2022-10-04 01:14:45,162 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-04 01:14:45,167 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-04 01:14:45,190 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-04 01:14:45,190 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-04 01:14:45,190 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-04 01:14:45,190 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-04 01:14:45,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-10-04 01:14:45,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-10-04 01:14:45,382 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 522 known predicates. [2022-10-04 01:14:45,382 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-04 01:14:45,383 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1] [2022-10-04 01:14:45,384 INFO L307 ceAbstractionStarter]: Result for error location t2Err0ASSERT_VIOLATIONASSERT was TIMEOUT (4/4) [2022-10-04 01:14:45,386 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-04 01:14:45,386 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-04 01:14:45,392 INFO L202 PluginConnector]: Adding new model queue_ok_longest.line519.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 01:14:45 BasicIcfg [2022-10-04 01:14:45,392 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-04 01:14:45,392 INFO L158 Benchmark]: Toolchain (without parser) took 876533.69ms. Allocated memory was 208.7MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 158.7MB in the beginning and 405.1MB in the end (delta: -246.4MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-10-04 01:14:45,393 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.16ms. Allocated memory is still 208.7MB. Free memory is still 162.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-04 01:14:45,393 INFO L158 Benchmark]: Boogie Preprocessor took 68.67ms. Allocated memory is still 208.7MB. Free memory was 158.7MB in the beginning and 155.3MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-04 01:14:45,393 INFO L158 Benchmark]: RCFGBuilder took 654.15ms. Allocated memory is still 208.7MB. Free memory was 155.3MB in the beginning and 153.2MB in the end (delta: 2.1MB). Peak memory consumption was 14.9MB. Max. memory is 8.0GB. [2022-10-04 01:14:45,395 INFO L158 Benchmark]: TraceAbstraction took 875796.47ms. Allocated memory was 208.7MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 152.6MB in the beginning and 405.1MB in the end (delta: -252.4MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-10-04 01:14:45,396 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.16ms. Allocated memory is still 208.7MB. Free memory is still 162.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 68.67ms. Allocated memory is still 208.7MB. Free memory was 158.7MB in the beginning and 155.3MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 654.15ms. Allocated memory is still 208.7MB. Free memory was 155.3MB in the beginning and 153.2MB in the end (delta: 2.1MB). Peak memory consumption was 14.9MB. Max. memory is 8.0GB. * TraceAbstraction took 875796.47ms. Allocated memory was 208.7MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 152.6MB in the beginning and 405.1MB in the end (delta: -252.4MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 2, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1728, positive: 1647, positive conditional: 1647, positive unconditional: 0, negative: 81, negative conditional: 81, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1728, positive: 1647, positive conditional: 1647, positive unconditional: 0, negative: 81, negative conditional: 81, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1661, positive: 1647, positive conditional: 0, positive unconditional: 1647, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1625, positive: 1611, positive conditional: 0, positive unconditional: 1611, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1661, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1625, unknown conditional: 0, unknown unconditional: 1625] , Statistics on independence cache: Total cache size (in pairs): 1625, Positive cache size: 1611, Positive conditional cache size: 0, Positive unconditional cache size: 1611, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Independence queries for same thread: 67, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 221, positive: 214, positive conditional: 214, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 28310, positive: 27825, positive conditional: 27825, positive unconditional: 0, negative: 485, negative conditional: 485, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27851, positive: 27825, positive conditional: 0, positive unconditional: 27825, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1139, positive: 1136, positive conditional: 0, positive unconditional: 1136, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 27851, positive: 26689, positive conditional: 0, positive unconditional: 26689, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 1139, unknown conditional: 0, unknown unconditional: 1139] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 151, Positive conditional cache size: 0, Positive unconditional cache size: 151, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 7, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 216, positive: 211, positive conditional: 211, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 28310, positive: 27825, positive conditional: 27825, positive unconditional: 0, negative: 485, negative conditional: 485, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27851, positive: 27825, positive conditional: 0, positive unconditional: 27825, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1139, positive: 1136, positive conditional: 0, positive unconditional: 1136, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 27851, positive: 26689, positive conditional: 0, positive unconditional: 26689, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 1139, unknown conditional: 0, unknown unconditional: 1139] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 151, Positive conditional cache size: 0, Positive unconditional cache size: 151, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 12, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 209, positive: 196, positive conditional: 196, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 28310, positive: 27825, positive conditional: 27825, positive unconditional: 0, negative: 485, negative conditional: 485, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27851, positive: 27825, positive conditional: 0, positive unconditional: 27825, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1139, positive: 1136, positive conditional: 0, positive unconditional: 1136, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 27851, positive: 26689, positive conditional: 0, positive unconditional: 26689, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 1139, unknown conditional: 0, unknown unconditional: 1139] , Statistics on independence cache: Total cache size (in pairs): 277, Positive cache size: 275, Positive conditional cache size: 0, Positive unconditional cache size: 275, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Independence queries for same thread: 23, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 377, positive: 362, positive conditional: 362, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 28310, positive: 27825, positive conditional: 27825, positive unconditional: 0, negative: 485, negative conditional: 485, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27851, positive: 27825, positive conditional: 0, positive unconditional: 27825, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1139, positive: 1136, positive conditional: 0, positive unconditional: 1136, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 27851, positive: 26689, positive conditional: 0, positive unconditional: 26689, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 1139, unknown conditional: 0, unknown unconditional: 1139] , Statistics on independence cache: Total cache size (in pairs): 445, Positive cache size: 443, Positive conditional cache size: 0, Positive unconditional cache size: 443, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Independence queries for same thread: 36, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1442, positive: 1426, positive conditional: 1426, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 28310, positive: 27825, positive conditional: 27825, positive unconditional: 0, negative: 485, negative conditional: 485, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27851, positive: 27825, positive conditional: 0, positive unconditional: 27825, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1139, positive: 1136, positive conditional: 0, positive unconditional: 1136, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 27851, positive: 26689, positive conditional: 0, positive unconditional: 26689, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 1139, unknown conditional: 0, unknown unconditional: 1139] , Statistics on independence cache: Total cache size (in pairs): 685, Positive cache size: 682, Positive conditional cache size: 0, Positive unconditional cache size: 682, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Independence queries for same thread: 49, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1687, positive: 1670, positive conditional: 1670, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 28310, positive: 27825, positive conditional: 27825, positive unconditional: 0, negative: 485, negative conditional: 485, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27851, positive: 27825, positive conditional: 0, positive unconditional: 27825, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1139, positive: 1136, positive conditional: 0, positive unconditional: 1136, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 27851, positive: 26689, positive conditional: 0, positive unconditional: 26689, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 1139, unknown conditional: 0, unknown unconditional: 1139] , Statistics on independence cache: Total cache size (in pairs): 928, Positive cache size: 925, Positive conditional cache size: 0, Positive unconditional cache size: 925, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Independence queries for same thread: 63, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2027, positive: 2002, positive conditional: 2002, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 28310, positive: 27825, positive conditional: 27825, positive unconditional: 0, negative: 485, negative conditional: 485, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27851, positive: 27825, positive conditional: 0, positive unconditional: 27825, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1139, positive: 1136, positive conditional: 0, positive unconditional: 1136, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 27851, positive: 26689, positive conditional: 0, positive unconditional: 26689, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 1139, unknown conditional: 0, unknown unconditional: 1139] , Statistics on independence cache: Total cache size (in pairs): 934, Positive cache size: 931, Positive conditional cache size: 0, Positive unconditional cache size: 931, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Independence queries for same thread: 85, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2707, positive: 2666, positive conditional: 2666, positive unconditional: 0, negative: 41, negative conditional: 41, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 28310, positive: 27825, positive conditional: 27825, positive unconditional: 0, negative: 485, negative conditional: 485, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27851, positive: 27825, positive conditional: 0, positive unconditional: 27825, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1139, positive: 1136, positive conditional: 0, positive unconditional: 1136, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 27851, positive: 26689, positive conditional: 0, positive unconditional: 26689, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 1139, unknown conditional: 0, unknown unconditional: 1139] , Statistics on independence cache: Total cache size (in pairs): 934, Positive cache size: 931, Positive conditional cache size: 0, Positive unconditional cache size: 931, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Independence queries for same thread: 123, Statistics for Abstraction: - StatisticsResult: Independence relation #9 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2965, positive: 2920, positive conditional: 2920, positive unconditional: 0, negative: 45, negative conditional: 45, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 28310, positive: 27825, positive conditional: 27825, positive unconditional: 0, negative: 485, negative conditional: 485, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27851, positive: 27825, positive conditional: 0, positive unconditional: 27825, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1139, positive: 1136, positive conditional: 0, positive unconditional: 1136, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 27851, positive: 26689, positive conditional: 0, positive unconditional: 26689, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 1139, unknown conditional: 0, unknown unconditional: 1139] , Statistics on independence cache: Total cache size (in pairs): 1127, Positive cache size: 1124, Positive conditional cache size: 0, Positive unconditional cache size: 1124, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Independence queries for same thread: 165, Statistics for Abstraction: - StatisticsResult: Independence relation #10 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4583, positive: 4502, positive conditional: 4502, positive unconditional: 0, negative: 81, negative conditional: 81, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 28310, positive: 27825, positive conditional: 27825, positive unconditional: 0, negative: 485, negative conditional: 485, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27851, positive: 27825, positive conditional: 0, positive unconditional: 27825, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1139, positive: 1136, positive conditional: 0, positive unconditional: 1136, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 27851, positive: 26689, positive conditional: 0, positive unconditional: 26689, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 1139, unknown conditional: 0, unknown unconditional: 1139] , Statistics on independence cache: Total cache size (in pairs): 1127, Positive cache size: 1124, Positive conditional cache size: 0, Positive unconditional cache size: 1124, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Independence queries for same thread: 243, Statistics for Abstraction: - StatisticsResult: Independence relation #11 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 7841, positive: 7688, positive conditional: 7688, positive unconditional: 0, negative: 153, negative conditional: 153, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 28310, positive: 27825, positive conditional: 27825, positive unconditional: 0, negative: 485, negative conditional: 485, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27851, positive: 27825, positive conditional: 0, positive unconditional: 27825, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1139, positive: 1136, positive conditional: 0, positive unconditional: 1136, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 27851, positive: 26689, positive conditional: 0, positive unconditional: 26689, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 1139, unknown conditional: 0, unknown unconditional: 1139] , Statistics on independence cache: Total cache size (in pairs): 1127, Positive cache size: 1124, Positive conditional cache size: 0, Positive unconditional cache size: 1124, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Independence queries for same thread: 393, Statistics for Abstraction: - StatisticsResult: Independence relation #12 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4035, positive: 3968, positive conditional: 3968, positive unconditional: 0, negative: 67, negative conditional: 67, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 28310, positive: 27825, positive conditional: 27825, positive unconditional: 0, negative: 485, negative conditional: 485, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27851, positive: 27825, positive conditional: 0, positive unconditional: 27825, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1139, positive: 1136, positive conditional: 0, positive unconditional: 1136, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 27851, positive: 26689, positive conditional: 0, positive unconditional: 26689, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 1139, unknown conditional: 0, unknown unconditional: 1139] , Statistics on independence cache: Total cache size (in pairs): 1139, Positive cache size: 1136, Positive conditional cache size: 0, Positive unconditional cache size: 1136, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Independence queries for same thread: 459, Statistics for Abstraction: - TimeoutResultAtElement [Line: 519]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 522 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 810 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 810 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t2Err0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 5 procedures, 810 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t2Err0ASSERT_VIOLATIONASSERT with 2 thread instances CFG has 5 procedures, 810 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 875.0s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 753.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 771, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 115.5s InterpolantComputationTime, 17282 NumberOfCodeBlocks, 14066 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 24955 ConstructedInterpolants, 114 QuantifiedInterpolants, 97739 SizeOfPredicates, 174 NumberOfNonLiveVariables, 10470 ConjunctsInSsa, 264 ConjunctsInUnsatCore, 24 InterpolantComputations, 5 PerfectInterpolantSequences, 90485/183108 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown