/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/divinefifo-bug_1w1r.line1491.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 14:43:44,159 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 14:43:44,161 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 14:43:44,184 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 14:43:44,185 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 14:43:44,185 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 14:43:44,186 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 14:43:44,188 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 14:43:44,189 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 14:43:44,189 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 14:43:44,190 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 14:43:44,191 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 14:43:44,191 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 14:43:44,197 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 14:43:44,198 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 14:43:44,201 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 14:43:44,202 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 14:43:44,203 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 14:43:44,207 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 14:43:44,210 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 14:43:44,211 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 14:43:44,212 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 14:43:44,214 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 14:43:44,214 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 14:43:44,218 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 14:43:44,218 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 14:43:44,218 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 14:43:44,219 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 14:43:44,219 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 14:43:44,219 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 14:43:44,220 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 14:43:44,220 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 14:43:44,220 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 14:43:44,221 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 14:43:44,221 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 14:43:44,221 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 14:43:44,222 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 14:43:44,222 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 14:43:44,222 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 14:43:44,223 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 14:43:44,223 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 14:43:44,224 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-03 14:43:44,236 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 14:43:44,236 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 14:43:44,236 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 14:43:44,236 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 14:43:44,237 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 14:43:44,237 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 14:43:44,237 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 14:43:44,237 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 14:43:44,237 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 14:43:44,237 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 14:43:44,237 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 14:43:44,238 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 14:43:44,238 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 14:43:44,238 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 14:43:44,238 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 14:43:44,238 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 14:43:44,238 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 14:43:44,238 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 14:43:44,238 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 14:43:44,238 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 14:43:44,238 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 14:43:44,238 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 14:43:44,238 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 14:43:44,239 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 14:43:44,239 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 14:43:44,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 14:43:44,239 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 14:43:44,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 14:43:44,251 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 14:43:44,251 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 14:43:44,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 14:43:44,252 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 14:43:44,252 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 14:43:44,252 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 14:43:44,252 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 14:43:44,252 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 14:43:44,252 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 14:43:44,252 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 14:43:44,252 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-03 14:43:44,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 14:43:44,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 14:43:44,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 14:43:44,421 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 14:43:44,422 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 14:43:44,423 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo-bug_1w1r.line1491.bpl [2022-10-03 14:43:44,423 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo-bug_1w1r.line1491.bpl' [2022-10-03 14:43:44,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 14:43:44,503 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 14:43:44,504 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 14:43:44,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 14:43:44,504 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 14:43:44,514 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1491.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:43:44" (1/1) ... [2022-10-03 14:43:44,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1491.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:43:44" (1/1) ... [2022-10-03 14:43:44,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1491.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:43:44" (1/1) ... [2022-10-03 14:43:44,536 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1491.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:43:44" (1/1) ... [2022-10-03 14:43:44,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1491.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:43:44" (1/1) ... [2022-10-03 14:43:44,589 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1491.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:43:44" (1/1) ... [2022-10-03 14:43:44,593 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1491.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:43:44" (1/1) ... [2022-10-03 14:43:44,599 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 14:43:44,600 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 14:43:44,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 14:43:44,601 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 14:43:44,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo-bug_1w1r.line1491.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:43:44" (1/1) ... [2022-10-03 14:43:44,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 14:43:44,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:43:44,636 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-03 14:43:44,646 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-03 14:43:44,671 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-10-03 14:43:44,671 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-10-03 14:43:44,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 14:43:44,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 14:43:44,673 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-03 14:43:44,794 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 14:43:44,795 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 14:43:45,632 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 14:43:45,656 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 14:43:45,656 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-03 14:43:45,661 INFO L202 PluginConnector]: Adding new model divinefifo-bug_1w1r.line1491.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:43:45 BoogieIcfgContainer [2022-10-03 14:43:45,661 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 14:43:45,663 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 14:43:45,663 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 14:43:45,666 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 14:43:45,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line1491.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:43:44" (1/2) ... [2022-10-03 14:43:45,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12077df4 and model type divinefifo-bug_1w1r.line1491.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:43:45, skipping insertion in model container [2022-10-03 14:43:45,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line1491.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:43:45" (2/2) ... [2022-10-03 14:43:45,671 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo-bug_1w1r.line1491.bpl [2022-10-03 14:43:45,676 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 14:43:45,684 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 14:43:45,684 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 14:43:45,684 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 14:43:45,813 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-10-03 14:43:45,870 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 14:43:45,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 14:43:45,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:43:45,872 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-03 14:43:45,876 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-03 14:43:45,899 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 14:43:45,909 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 14:43:45,915 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;@2e96fb3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 14:43:45,916 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 14:43:46,312 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:43:46,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:43:46,319 INFO L85 PathProgramCache]: Analyzing trace with hash 882236145, now seen corresponding path program 1 times [2022-10-03 14:43:46,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:43:46,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039759027] [2022-10-03 14:43:46,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:43:46,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:43:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:43:46,719 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-03 14:43:46,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:43:46,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039759027] [2022-10-03 14:43:46,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039759027] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:43:46,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:43:46,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 14:43:46,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053774876] [2022-10-03 14:43:46,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:43:46,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 14:43:46,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:43:46,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 14:43:46,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 14:43:46,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:43:46,753 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:43:46,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 325.0) internal successors, (650), 2 states have internal predecessors, (650), 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-03 14:43:46,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:43:46,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:43:46,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 14:43:46,965 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:43:46,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:43:46,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1857594210, now seen corresponding path program 1 times [2022-10-03 14:43:46,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:43:46,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605510193] [2022-10-03 14:43:46,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:43:46,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:43:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:43:47,886 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-03 14:43:47,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:43:47,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605510193] [2022-10-03 14:43:47,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605510193] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:43:47,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:43:47,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-10-03 14:43:47,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147796530] [2022-10-03 14:43:47,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:43:47,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-03 14:43:47,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:43:47,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-03 14:43:47,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-10-03 14:43:47,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:43:47,890 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:43:47,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 51.07142857142857) internal successors, (715), 15 states have internal predecessors, (715), 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-03 14:43:47,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:43:47,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:43:49,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:43:49,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-03 14:43:49,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 14:43:49,319 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:43:49,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:43:49,320 INFO L85 PathProgramCache]: Analyzing trace with hash 882628608, now seen corresponding path program 1 times [2022-10-03 14:43:49,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:43:49,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352849518] [2022-10-03 14:43:49,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:43:49,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:43:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:43:49,859 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 200 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-03 14:43:49,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:43:49,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352849518] [2022-10-03 14:43:49,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352849518] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:43:49,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511928341] [2022-10-03 14:43:49,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:43:49,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:43:49,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:43:49,863 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 14:43:49,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-03 14:43:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:43:50,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 2641 conjuncts, 362 conjunts are in the unsatisfiable core [2022-10-03 14:43:50,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:43:50,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 14:43:50,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 14:43:50,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:43:50,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-03 14:43:51,419 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 6 treesize of output 5 [2022-10-03 14:43:51,425 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 11 treesize of output 7 [2022-10-03 14:43:54,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:43:54,407 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-10-03 14:43:54,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-10-03 14:43:54,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-03 14:43:55,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:43:55,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 58 [2022-10-03 14:43:55,052 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-10-03 14:43:55,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 85 [2022-10-03 14:44:01,328 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2022-10-03 14:44:01,328 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-03 14:44:01,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511928341] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:44:01,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-03 14:44:01,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [78] imperfect sequences [12] total 89 [2022-10-03 14:44:01,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780870577] [2022-10-03 14:44:01,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:44:01,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-10-03 14:44:01,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:44:01,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-10-03 14:44:01,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=7457, Unknown=0, NotChecked=0, Total=7832 [2022-10-03 14:44:01,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:44:01,334 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:44:01,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 11.076923076923077) internal successors, (864), 78 states have internal predecessors, (864), 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-03 14:44:01,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:44:01,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-10-03 14:44:01,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:44:34,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:44:34,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-03 14:44:34,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2022-10-03 14:44:34,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-10-03 14:44:34,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-10-03 14:44:34,536 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:44:34,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:44:34,536 INFO L85 PathProgramCache]: Analyzing trace with hash 901402802, now seen corresponding path program 1 times [2022-10-03 14:44:34,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:44:34,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933763186] [2022-10-03 14:44:34,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:44:34,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:44:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:44:34,897 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-03 14:44:34,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:44:34,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933763186] [2022-10-03 14:44:34,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933763186] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:44:34,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:44:34,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-10-03 14:44:34,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122087207] [2022-10-03 14:44:34,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:44:34,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-03 14:44:34,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:44:34,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-03 14:44:34,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-10-03 14:44:34,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:44:34,902 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:44:34,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 59.76923076923077) internal successors, (777), 14 states have internal predecessors, (777), 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-03 14:44:34,902 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:44:34,902 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-10-03 14:44:34,902 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 131 states. [2022-10-03 14:44:34,902 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:44:36,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:44:36,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-03 14:44:36,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2022-10-03 14:44:36,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-03 14:44:36,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-03 14:44:36,549 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:44:36,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:44:36,550 INFO L85 PathProgramCache]: Analyzing trace with hash 65769782, now seen corresponding path program 1 times [2022-10-03 14:44:36,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:44:36,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250760392] [2022-10-03 14:44:36,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:44:36,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:44:36,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:44:37,174 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 200 proven. 41 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-03 14:44:37,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:44:37,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250760392] [2022-10-03 14:44:37,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250760392] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:44:37,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538999310] [2022-10-03 14:44:37,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:44:37,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:44:37,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:44:37,176 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 14:44:37,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-03 14:44:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:44:37,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 3099 conjuncts, 393 conjunts are in the unsatisfiable core [2022-10-03 14:44:37,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:44:38,335 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-03 14:44:38,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:44:38,479 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 27 treesize of output 20 [2022-10-03 14:44:38,484 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 11 treesize of output 7 [2022-10-03 14:44:39,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 14:44:39,320 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-03 14:44:39,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 29 [2022-10-03 14:44:39,330 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-03 14:44:39,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-10-03 14:44:39,350 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 5 treesize of output 3 [2022-10-03 14:44:39,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:44:39,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-03 14:44:44,869 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 14:44:44,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 32 [2022-10-03 14:44:59,280 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 6 treesize of output 5 [2022-10-03 14:44:59,304 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 6 treesize of output 5 [2022-10-03 14:44:59,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:44:59,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2022-10-03 14:44:59,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:44:59,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-10-03 14:45:00,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:45:00,310 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-03 14:45:00,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 42 [2022-10-03 14:45:00,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:45:00,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2022-10-03 14:45:00,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:45:00,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:45:00,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2022-10-03 14:45:00,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:45:00,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2022-10-03 14:45:01,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:45:01,711 INFO L356 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2022-10-03 14:45:01,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 47 [2022-10-03 14:45:01,723 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 14:45:01,723 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-10-03 14:45:01,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:45:01,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2022-10-03 14:45:02,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:45:02,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 25 treesize of output 23 [2022-10-03 14:45:02,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:45:02,292 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 27 treesize of output 25 [2022-10-03 14:45:02,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:45:02,515 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 14:45:02,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2022-10-03 14:45:03,487 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 14:45:03,488 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 43 treesize of output 40 [2022-10-03 14:45:03,839 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 11 treesize of output 7 [2022-10-03 14:45:03,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2022-10-03 14:45:05,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:45:05,323 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 14:45:05,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2022-10-03 14:45:05,328 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 14:45:05,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:45:05,329 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 14:45:05,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 21 [2022-10-03 14:45:05,605 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 180 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:45:05,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 14:45:06,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 70 [2022-10-03 14:45:06,647 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int))) (not (let ((.cse0 (select (let ((.cse1 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_645))) (store .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) is different from false [2022-10-03 14:45:06,657 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int))) (not (let ((.cse0 (select (let ((.cse1 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| v_ArrVal_645))) (store .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) is different from false [2022-10-03 14:45:06,662 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int))) (not (let ((.cse0 (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| v_ArrVal_645))) (store .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) is different from false [2022-10-03 14:45:06,682 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int))) (not (let ((.cse0 (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_read~$Pointer$_#value#1.base| v_ArrVal_645))) (store .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) is different from false [2022-10-03 14:45:06,686 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int))) (not (let ((.cse0 (select (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_read~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_read~$Pointer$_#ptr#1.offset|) v_ArrVal_645))) (store .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) is different from false [2022-10-03 14:45:06,698 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int))) (not (let ((.cse0 (select (let ((.cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) v_ArrVal_645))) (store .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) is different from false [2022-10-03 14:45:07,184 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int))) (not (let ((.cse0 (select (let ((.cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse1 (let ((.cse3 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_644))) (store .cse3 (select (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) v_ArrVal_645)))) (store .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) (forall ((v_ArrVal_643 (Array Int Int))) (= (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_643) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int))) (let ((.cse7 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_644)) (.cse6 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse8 (select (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6))) (or (not (let ((.cse4 (select (let ((.cse5 (store .cse7 .cse8 v_ArrVal_645))) (store .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse4 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (= .cse8 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)))))) is different from false [2022-10-03 14:45:07,223 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int))) (not (let ((.cse0 (select (let ((.cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse1 (let ((.cse3 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_644))) (store .cse3 (select (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) v_ArrVal_645)))) (store .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (forall ((v_ArrVal_643 (Array Int Int))) (= (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_643) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int))) (let ((.cse8 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_644)) (.cse7 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse4 (select (select .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7))) (or (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse4) (not (let ((.cse5 (select (let ((.cse6 (store .cse8 .cse4 v_ArrVal_645))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))))))) is different from false [2022-10-03 14:45:07,242 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_643 (Array Int Int))) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_643) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)))) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int))) (not (let ((.cse0 (select (let ((.cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_644))) (store .cse3 (select (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) v_ArrVal_645)))) (store .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_644)) (.cse7 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse4 (select (select .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7))) (or (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse4) (not (let ((.cse5 (select (let ((.cse6 (store .cse8 .cse4 v_ArrVal_645))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))))))) is different from false [2022-10-03 14:45:07,334 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_643 (Array Int Int)) (v_ArrVal_642 (Array Int Int))) (= (select (select (store (store |c_pusherThread1of1ForFork0_write~int_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~int_#ptr#1.base| v_ArrVal_642) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_643) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 (Array Int Int))) (not (let ((.cse0 (select (let ((.cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse1 (let ((.cse3 (store (store |c_pusherThread1of1ForFork0_write~int_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~int_#ptr#1.base| v_ArrVal_641) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_644))) (store .cse3 (select (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) v_ArrVal_645)))) (store .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 (Array Int Int))) (let ((.cse8 (store (store |c_pusherThread1of1ForFork0_write~int_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~int_#ptr#1.base| v_ArrVal_641) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_644)) (.cse7 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse4 (select (select .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7))) (or (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse4) (not (let ((.cse5 (select (let ((.cse6 (store .cse8 .cse4 v_ArrVal_645))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))))))) is different from false [2022-10-03 14:45:07,369 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 (Array Int Int))) (not (let ((.cse0 (select (let ((.cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse1 (let ((.cse3 (store (store |c_pusherThread1of1ForFork0_write~int_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| v_ArrVal_641) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_644))) (store .cse3 (select (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) v_ArrVal_645)))) (store .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) (forall ((v_ArrVal_643 (Array Int Int)) (v_ArrVal_642 (Array Int Int))) (= (select (select (store (store |c_pusherThread1of1ForFork0_write~int_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| v_ArrVal_642) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_643) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 (Array Int Int))) (let ((.cse8 (store (store |c_pusherThread1of1ForFork0_write~int_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| v_ArrVal_641) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_644)) (.cse7 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse4 (select (select .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7))) (or (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse4) (not (let ((.cse5 (select (let ((.cse6 (store .cse8 .cse4 v_ArrVal_645))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))))))) is different from false [2022-10-03 14:45:07,390 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 (Array Int Int))) (not (let ((.cse0 (select (let ((.cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse1 (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| v_ArrVal_641) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_644))) (store .cse3 (select (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) v_ArrVal_645)))) (store .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (forall ((v_ArrVal_643 (Array Int Int)) (v_ArrVal_642 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| v_ArrVal_642) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_643) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| v_ArrVal_641) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_644)) (.cse6 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse8 (select (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6))) (or (not (let ((.cse4 (select (let ((.cse5 (store .cse7 .cse8 v_ArrVal_645))) (store .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse4 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))) (= .cse8 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)))))) is different from false [2022-10-03 14:45:07,409 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_read~$Pointer$_#value#1.base| v_ArrVal_641) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_644)) (.cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse4 (select (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2))) (or (not (let ((.cse0 (select (let ((.cse1 (store .cse3 .cse4 v_ArrVal_645))) (store .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (= .cse4 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))))) (or (forall ((v_ArrVal_643 (Array Int Int)) (v_ArrVal_642 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_read~$Pointer$_#value#1.base| v_ArrVal_642) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_643) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 (Array Int Int))) (not (let ((.cse5 (select (let ((.cse7 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse6 (let ((.cse8 (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_read~$Pointer$_#value#1.base| v_ArrVal_641) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_644))) (store .cse8 (select (select .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7) v_ArrVal_645)))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))))) is different from false [2022-10-03 14:45:07,422 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_643 (Array Int Int)) (v_ArrVal_642 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_read~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_read~$Pointer$_#ptr#1.offset|) v_ArrVal_642) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_643) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 (Array Int Int))) (not (let ((.cse0 (select (let ((.cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse1 (let ((.cse3 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_read~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_read~$Pointer$_#ptr#1.offset|) v_ArrVal_641) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_644))) (store .cse3 (select (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) v_ArrVal_645)))) (store .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_read~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_read~$Pointer$_#ptr#1.offset|) v_ArrVal_641) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_644)) (.cse6 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse8 (select (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6))) (or (not (let ((.cse4 (select (let ((.cse5 (store .cse7 .cse8 v_ArrVal_645))) (store .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse4 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse8)))))) is different from false [2022-10-03 14:45:07,464 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_643 (Array Int Int)) (v_ArrVal_642 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) (+ 12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) v_ArrVal_642) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_643) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 (Array Int Int))) (not (let ((.cse0 (select (let ((.cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse1 (let ((.cse3 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) (+ 12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) v_ArrVal_641) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_644))) (store .cse3 (select (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) v_ArrVal_645)))) (store .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) (+ 12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) v_ArrVal_641) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_644)) (.cse7 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse4 (select (select .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7))) (or (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse4) (not (let ((.cse5 (select (let ((.cse6 (store .cse8 .cse4 v_ArrVal_645))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))))))) is different from false [2022-10-03 14:45:07,502 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base|) (+ 12 |c_pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset|)) v_ArrVal_641) |c_pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base| v_ArrVal_644)) (.cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse4 (select (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2))) (or (not (let ((.cse0 (select (let ((.cse1 (store .cse3 .cse4 v_ArrVal_645))) (store .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base|))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (= .cse4 |c_pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base|))))) (or (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 (Array Int Int))) (not (let ((.cse5 (select (let ((.cse7 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse6 (let ((.cse8 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base|) (+ 12 |c_pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset|)) v_ArrVal_641) |c_pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base| v_ArrVal_644))) (store .cse8 (select (select .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7) v_ArrVal_645)))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base|)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) (forall ((v_ArrVal_643 (Array Int Int)) (v_ArrVal_642 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base|) (+ 12 |c_pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset|)) v_ArrVal_642) |c_pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base| v_ArrVal_643) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset|)))) is different from false [2022-10-03 14:45:07,523 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.offset| 12)) v_ArrVal_641) |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base| v_ArrVal_644)) (.cse3 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (select (select .cse4 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3))) (or (= .cse0 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|) (not (let ((.cse1 (select (let ((.cse2 (store .cse4 .cse0 v_ArrVal_645))) (store .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))))) (or (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 (Array Int Int))) (not (let ((.cse5 (select (let ((.cse7 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse6 (let ((.cse8 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.offset| 12)) v_ArrVal_641) |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base| v_ArrVal_644))) (store .cse8 (select (select .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7) v_ArrVal_645)))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) (forall ((v_ArrVal_643 (Array Int Int)) (v_ArrVal_642 (Array Int Int))) (= |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.offset| 12)) v_ArrVal_642) |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base| v_ArrVal_643) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)))))) is different from false [2022-10-03 14:45:07,537 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 (Array Int Int))) (not (let ((.cse0 (select (let ((.cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse1 (let ((.cse3 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_641) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_644))) (store .cse3 (select (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) v_ArrVal_645)))) (store .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (forall ((v_ArrVal_643 (Array Int Int)) (v_ArrVal_642 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_642) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_643) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_641) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_644)) (.cse7 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse4 (select (select .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7))) (or (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse4) (not (let ((.cse5 (select (let ((.cse6 (store .cse8 .cse4 v_ArrVal_645))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))))))) is different from false [2022-10-03 14:45:07,564 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_ArrVal_639 Int) (v_ArrVal_641 (Array Int Int))) (let ((.cse3 (store (let ((.cse5 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| v_ArrVal_639)))) (store .cse5 (select (select .cse5 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_641)) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_644)) (.cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse4 (select (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2))) (or (not (let ((.cse0 (select (let ((.cse1 (store .cse3 .cse4 v_ArrVal_645))) (store .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse4))))) (forall ((v_ArrVal_638 (Array Int Int)) (v_ArrVal_639 Int)) (or (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 (Array Int Int))) (not (let ((.cse6 (select (let ((.cse8 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse7 (let ((.cse9 (store (let ((.cse10 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| v_ArrVal_639)))) (store .cse10 (select (select .cse10 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_641)) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_644))) (store .cse9 (select (select .cse9 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8) v_ArrVal_645)))) (store .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse6 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) (forall ((v_ArrVal_643 (Array Int Int)) (v_ArrVal_642 (Array Int Int))) (= (select (select (store (store (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_638) (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| v_ArrVal_639)) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_642) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_643) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))))) is different from false [2022-10-03 14:45:07,639 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42| Int)) (or (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42|)) (forall ((v_ArrVal_638 (Array Int Int)) (v_ArrVal_639 Int)) (or (forall ((v_ArrVal_643 (Array Int Int)) (v_ArrVal_642 (Array Int Int))) (= (select (select (store (store (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_638) (select (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42| v_ArrVal_639) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_642) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_643) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 (Array Int Int))) (not (let ((.cse0 (select (let ((.cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse1 (let ((.cse3 (store (let ((.cse4 (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42| v_ArrVal_639))) (store (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse4) (select .cse4 (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_641)) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_644))) (store .cse3 (select (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) v_ArrVal_645)))) (store .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))))))) (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42| Int)) (or (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42|)) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_ArrVal_639 Int) (v_ArrVal_641 (Array Int Int))) (let ((.cse8 (store (let ((.cse10 (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42| v_ArrVal_639))) (store (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse10) (select .cse10 (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_641)) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_644)) (.cse7 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse9 (select (select .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7))) (or (not (let ((.cse5 (select (let ((.cse6 (store .cse8 .cse9 v_ArrVal_645))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse9)))))))) is different from false [2022-10-03 14:45:07,689 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42| Int)) (or (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42|)) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_ArrVal_639 Int) (v_ArrVal_641 (Array Int Int))) (let ((.cse3 (store (let ((.cse5 (store (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42| v_ArrVal_639))) (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse5) (select .cse5 (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_641)) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_644)) (.cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse4 (select (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2))) (or (not (let ((.cse0 (select (let ((.cse1 (store .cse3 .cse4 v_ArrVal_645))) (store .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse4))))))) (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42| Int)) (or (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42|)) (forall ((v_ArrVal_638 (Array Int Int)) (v_ArrVal_639 Int)) (or (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 (Array Int Int))) (not (let ((.cse6 (select (let ((.cse8 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse7 (let ((.cse9 (store (let ((.cse10 (store (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42| v_ArrVal_639))) (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse10) (select .cse10 (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_641)) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_644))) (store .cse9 (select (select .cse9 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8) v_ArrVal_645)))) (store .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse6 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (forall ((v_ArrVal_643 (Array Int Int)) (v_ArrVal_642 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_638) (select (store (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42| v_ArrVal_639) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_642) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_643) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))))))) is different from false [2022-10-03 14:45:07,751 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42| Int)) (or (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42|)) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_ArrVal_639 Int) (v_ArrVal_641 (Array Int Int))) (let ((.cse3 (store (let ((.cse5 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse6 (store (select .cse5 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42| v_ArrVal_639))) (store (store .cse5 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse6) (select .cse6 (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_641))) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_644)) (.cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse4 (select (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2))) (or (not (let ((.cse0 (select (let ((.cse1 (store .cse3 .cse4 v_ArrVal_645))) (store .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse4))))))) (forall ((v_ArrVal_637 (Array Int Int)) (|pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42| Int)) (or (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42|)) (forall ((v_ArrVal_638 (Array Int Int)) (v_ArrVal_639 Int)) (or (forall ((v_ArrVal_643 (Array Int Int)) (v_ArrVal_642 (Array Int Int))) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| (select (select (store (store (store (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_637) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_638) (select (store (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42| v_ArrVal_639) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_642) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_643) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)))) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 (Array Int Int))) (not (let ((.cse7 (select (let ((.cse9 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse8 (let ((.cse10 (store (let ((.cse11 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse12 (store (select .cse11 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42| v_ArrVal_639))) (store (store .cse11 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse12) (select .cse12 (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_641))) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_644))) (store .cse10 (select (select .cse10 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse9) v_ArrVal_645)))) (store .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse9 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse7 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))))))) is different from false [2022-10-03 14:45:07,868 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42| Int)) (or (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42|)) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_ArrVal_639 Int) (v_ArrVal_641 (Array Int Int))) (let ((.cse4 (store (let ((.cse5 (store (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42| v_ArrVal_639))) (store (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse5) (select .cse5 (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_641)) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_644)) (.cse3 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (select (select .cse4 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3))) (or (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse0) (not (let ((.cse1 (select (let ((.cse2 (store .cse4 .cse0 v_ArrVal_645))) (store .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))))))) (forall ((|pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42| Int)) (or (forall ((v_ArrVal_638 (Array Int Int)) (v_ArrVal_639 Int)) (or (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 (Array Int Int))) (not (let ((.cse6 (select (let ((.cse8 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse7 (let ((.cse9 (store (let ((.cse10 (store (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42| v_ArrVal_639))) (store (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse10) (select .cse10 (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_641)) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_644))) (store .cse9 (select (select .cse9 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8) v_ArrVal_645)))) (store .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse6 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) (forall ((v_ArrVal_643 (Array Int Int)) (v_ArrVal_642 (Array Int Int))) (= (select (select (store (store (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_638) (select (store (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42| v_ArrVal_639) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_642) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_643) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)))) (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42|))))) is different from false [2022-10-03 14:45:07,921 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42| Int)) (or (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42|)) (forall ((v_ArrVal_638 (Array Int Int)) (v_ArrVal_639 Int)) (or (forall ((v_ArrVal_643 (Array Int Int)) (v_ArrVal_642 (Array Int Int))) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_638) (select (store (store (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42| v_ArrVal_639) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_642) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_643) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)))) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 (Array Int Int))) (not (let ((.cse0 (select (let ((.cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse1 (let ((.cse3 (store (let ((.cse4 (store (store (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42| v_ArrVal_639))) (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse4) (select .cse4 (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_641)) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_644))) (store .cse3 (select (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) v_ArrVal_645)))) (store .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))))))) (forall ((|pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42| Int)) (or (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_ArrVal_639 Int) (v_ArrVal_641 (Array Int Int))) (let ((.cse9 (store (let ((.cse10 (store (store (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42| v_ArrVal_639))) (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse10) (select .cse10 (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_641)) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_644)) (.cse8 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse5 (select (select .cse9 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8))) (or (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse5) (not (let ((.cse6 (select (let ((.cse7 (store .cse9 .cse5 v_ArrVal_645))) (store .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse6 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))))) (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_42|))))) is different from false [2022-10-03 14:45:14,552 WARN L233 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 77 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 14:45:46,396 WARN L233 SmtUtils]: Spent 8.11s on a formula simplification. DAG size of input: 58 DAG size of output: 49 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-10-03 14:45:46,397 INFO L356 Elim1Store]: treesize reduction 54, result has 64.0 percent of original size [2022-10-03 14:45:46,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 97259278068629 treesize of output 92650127464803 Received shutdown request... [2022-10-03 14:58:04,816 WARN L249 SmtUtils]: Removed 1 from assertion stack [2022-10-03 14:58:04,819 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-03 14:58:04,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-10-03 14:58:04,852 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-03 14:58:04,852 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-03 14:58:04,852 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 14:58:05,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:58:05,024 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 1225 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-2-2-2-2-1 context. [2022-10-03 14:58:05,027 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-10-03 14:58:05,028 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT was TIMEOUT (1/2) [2022-10-03 14:58:05,029 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-03 14:58:05,029 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-03 14:58:05,030 INFO L202 PluginConnector]: Adding new model divinefifo-bug_1w1r.line1491.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:58:05 BasicIcfg [2022-10-03 14:58:05,031 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-03 14:58:05,031 INFO L158 Benchmark]: Toolchain (without parser) took 860527.93ms. Allocated memory was 199.2MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 155.6MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 4.9GB. Max. memory is 8.0GB. [2022-10-03 14:58:05,031 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 199.2MB. Free memory was 162.1MB in the beginning and 161.9MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-03 14:58:05,031 INFO L158 Benchmark]: Boogie Preprocessor took 95.85ms. Allocated memory is still 199.2MB. Free memory was 155.6MB in the beginning and 149.2MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-10-03 14:58:05,032 INFO L158 Benchmark]: RCFGBuilder took 1060.83ms. Allocated memory is still 199.2MB. Free memory was 149.1MB in the beginning and 112.0MB in the end (delta: 37.1MB). Peak memory consumption was 36.9MB. Max. memory is 8.0GB. [2022-10-03 14:58:05,032 INFO L158 Benchmark]: TraceAbstraction took 859367.98ms. Allocated memory was 199.2MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 111.5MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 4.9GB. Max. memory is 8.0GB. [2022-10-03 14:58:05,032 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.10ms. Allocated memory is still 199.2MB. Free memory was 162.1MB in the beginning and 161.9MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 95.85ms. Allocated memory is still 199.2MB. Free memory was 155.6MB in the beginning and 149.2MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1060.83ms. Allocated memory is still 199.2MB. Free memory was 149.1MB in the beginning and 112.0MB in the end (delta: 37.1MB). Peak memory consumption was 36.9MB. Max. memory is 8.0GB. * TraceAbstraction took 859367.98ms. Allocated memory was 199.2MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 111.5MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 4.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 446, positive: 430, positive conditional: 430, 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: 26018, positive: 25178, positive conditional: 25178, positive unconditional: 0, negative: 840, negative conditional: 840, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25189, positive: 25178, positive conditional: 0, positive unconditional: 25178, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7745, positive: 7738, positive conditional: 0, positive unconditional: 7738, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 25189, positive: 17440, positive conditional: 0, positive unconditional: 17440, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 7745, unknown conditional: 0, unknown unconditional: 7745] , Statistics on independence cache: Total cache size (in pairs): 430, Positive cache size: 430, Positive conditional cache size: 0, Positive unconditional cache size: 430, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 16, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1446, positive: 1404, positive conditional: 1404, positive unconditional: 0, negative: 42, negative conditional: 42, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 26018, positive: 25178, positive conditional: 25178, positive unconditional: 0, negative: 840, negative conditional: 840, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25189, positive: 25178, positive conditional: 0, positive unconditional: 25178, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7745, positive: 7738, positive conditional: 0, positive unconditional: 7738, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 25189, positive: 17440, positive conditional: 0, positive unconditional: 17440, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 7745, unknown conditional: 0, unknown unconditional: 7745] , Statistics on independence cache: Total cache size (in pairs): 1404, Positive cache size: 1404, Positive conditional cache size: 0, Positive unconditional cache size: 1404, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 58, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4808, positive: 4657, positive conditional: 4657, positive unconditional: 0, negative: 151, negative conditional: 151, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 26018, positive: 25178, positive conditional: 25178, positive unconditional: 0, negative: 840, negative conditional: 840, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25189, positive: 25178, positive conditional: 0, positive unconditional: 25178, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7745, positive: 7738, positive conditional: 0, positive unconditional: 7738, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 25189, positive: 17440, positive conditional: 0, positive unconditional: 17440, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 7745, unknown conditional: 0, unknown unconditional: 7745] , Statistics on independence cache: Total cache size (in pairs): 3296, Positive cache size: 3295, Positive conditional cache size: 0, Positive unconditional cache size: 3295, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Independence queries for same thread: 208, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 7961, positive: 7696, positive conditional: 7696, positive unconditional: 0, negative: 265, negative conditional: 265, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 26018, positive: 25178, positive conditional: 25178, positive unconditional: 0, negative: 840, negative conditional: 840, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25189, positive: 25178, positive conditional: 0, positive unconditional: 25178, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7745, positive: 7738, positive conditional: 0, positive unconditional: 7738, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 25189, positive: 17440, positive conditional: 0, positive unconditional: 17440, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 7745, unknown conditional: 0, unknown unconditional: 7745] , Statistics on independence cache: Total cache size (in pairs): 6804, Positive cache size: 6799, Positive conditional cache size: 0, Positive unconditional cache size: 6799, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Independence queries for same thread: 469, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 11357, positive: 10991, positive conditional: 10991, positive unconditional: 0, negative: 366, negative conditional: 366, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 26018, positive: 25178, positive conditional: 25178, positive unconditional: 0, negative: 840, negative conditional: 840, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25189, positive: 25178, positive conditional: 0, positive unconditional: 25178, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7745, positive: 7738, positive conditional: 0, positive unconditional: 7738, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 25189, positive: 17440, positive conditional: 0, positive unconditional: 17440, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 7745, unknown conditional: 0, unknown unconditional: 7745] , Statistics on independence cache: Total cache size (in pairs): 7745, Positive cache size: 7738, Positive conditional cache size: 0, Positive unconditional cache size: 7738, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Independence queries for same thread: 829, Statistics for Abstraction: - TimeoutResultAtElement [Line: 1491]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PartialOrderCegarLoop was analyzing trace of length 1225 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-2-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 3 procedures, 1463 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 859.2s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 36.7s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 167, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 4274 NumberOfCodeBlocks, 4274 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 4269 ConstructedInterpolants, 0 QuantifiedInterpolants, 43364 SizeOfPredicates, 116 NumberOfNonLiveVariables, 2641 ConjunctsInSsa, 362 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 405/406 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