/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_1w1r.line1538.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 15:38:07,935 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 15:38:07,938 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 15:38:07,987 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 15:38:07,987 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 15:38:07,991 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 15:38:07,995 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 15:38:08,001 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 15:38:08,003 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 15:38:08,006 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 15:38:08,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 15:38:08,008 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 15:38:08,008 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 15:38:08,012 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 15:38:08,013 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 15:38:08,014 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 15:38:08,014 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 15:38:08,015 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 15:38:08,016 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 15:38:08,018 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 15:38:08,019 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 15:38:08,023 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 15:38:08,025 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 15:38:08,027 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 15:38:08,033 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 15:38:08,033 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 15:38:08,033 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 15:38:08,034 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 15:38:08,035 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 15:38:08,036 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 15:38:08,036 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 15:38:08,036 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 15:38:08,037 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 15:38:08,038 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 15:38:08,038 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 15:38:08,039 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 15:38:08,039 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 15:38:08,039 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 15:38:08,040 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 15:38:08,040 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 15:38:08,041 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 15:38:08,047 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-03 15:38:08,069 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 15:38:08,069 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 15:38:08,069 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 15:38:08,070 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 15:38:08,070 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 15:38:08,070 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 15:38:08,071 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 15:38:08,071 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 15:38:08,071 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 15:38:08,071 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 15:38:08,071 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 15:38:08,072 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 15:38:08,072 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 15:38:08,072 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 15:38:08,072 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 15:38:08,072 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 15:38:08,072 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 15:38:08,072 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 15:38:08,072 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 15:38:08,072 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 15:38:08,073 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 15:38:08,073 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 15:38:08,073 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 15:38:08,073 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 15:38:08,073 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 15:38:08,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 15:38:08,073 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 15:38:08,074 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 15:38:08,074 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 15:38:08,074 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 15:38:08,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 15:38:08,074 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 15:38:08,074 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 15:38:08,074 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 15:38:08,075 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 15:38:08,075 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 15:38:08,075 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 15:38:08,075 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 15:38:08,075 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 15:38:08,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 15:38:08,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 15:38:08,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 15:38:08,359 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 15:38:08,360 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 15:38:08,361 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_1w1r.line1538.bpl [2022-10-03 15:38:08,362 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line1538.bpl' [2022-10-03 15:38:08,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 15:38:08,451 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 15:38:08,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 15:38:08,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 15:38:08,453 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 15:38:08,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo_1w1r.line1538.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:38:08" (1/1) ... [2022-10-03 15:38:08,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo_1w1r.line1538.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:38:08" (1/1) ... [2022-10-03 15:38:08,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1538.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:38:08" (1/1) ... [2022-10-03 15:38:08,505 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1538.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:38:08" (1/1) ... [2022-10-03 15:38:08,571 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo_1w1r.line1538.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:38:08" (1/1) ... [2022-10-03 15:38:08,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo_1w1r.line1538.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:38:08" (1/1) ... [2022-10-03 15:38:08,588 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo_1w1r.line1538.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:38:08" (1/1) ... [2022-10-03 15:38:08,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 15:38:08,613 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 15:38:08,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 15:38:08,613 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 15:38:08,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo_1w1r.line1538.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:38:08" (1/1) ... [2022-10-03 15:38:08,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 15:38:08,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:38:08,673 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 15:38:08,680 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 15:38:08,715 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-10-03 15:38:08,716 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-10-03 15:38:08,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 15:38:08,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 15:38:08,718 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 15:38:08,941 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 15:38:08,942 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 15:38:09,914 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 15:38:09,949 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 15:38:09,950 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-03 15:38:09,954 INFO L202 PluginConnector]: Adding new model divinefifo_1w1r.line1538.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:38:09 BoogieIcfgContainer [2022-10-03 15:38:09,955 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 15:38:09,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 15:38:09,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 15:38:09,963 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 15:38:09,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1538.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:38:08" (1/2) ... [2022-10-03 15:38:09,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee85d99 and model type divinefifo_1w1r.line1538.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:38:09, skipping insertion in model container [2022-10-03 15:38:09,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1538.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:38:09" (2/2) ... [2022-10-03 15:38:09,972 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo_1w1r.line1538.bpl [2022-10-03 15:38:09,980 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 15:38:09,992 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 15:38:09,992 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 15:38:09,992 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 15:38:10,194 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-10-03 15:38:10,272 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 15:38:10,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 15:38:10,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:38:10,275 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 15:38:10,276 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 15:38:10,303 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 15:38:10,310 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 15:38:10,316 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;@7226daca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 15:38:10,316 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 15:38:10,855 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:38:10,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:38:10,862 INFO L85 PathProgramCache]: Analyzing trace with hash 333835649, now seen corresponding path program 1 times [2022-10-03 15:38:10,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:38:10,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361194479] [2022-10-03 15:38:10,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:38:10,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:38:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:38:11,497 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 15:38:11,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:38:11,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361194479] [2022-10-03 15:38:11,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361194479] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:38:11,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:38:11,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 15:38:11,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402258260] [2022-10-03 15:38:11,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:38:11,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 15:38:11,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:38:11,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 15:38:11,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 15:38:11,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:38:11,531 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:38:11,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 346.0) internal successors, (692), 2 states have internal predecessors, (692), 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 15:38:11,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:38:11,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:38:11,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 15:38:11,774 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:38:11,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:38:11,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1156957074, now seen corresponding path program 1 times [2022-10-03 15:38:11,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:38:11,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949742089] [2022-10-03 15:38:11,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:38:11,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:38:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:38:13,054 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 15:38:13,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:38:13,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949742089] [2022-10-03 15:38:13,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949742089] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:38:13,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:38:13,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-10-03 15:38:13,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432810770] [2022-10-03 15:38:13,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:38:13,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-10-03 15:38:13,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:38:13,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-10-03 15:38:13,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-10-03 15:38:13,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:38:13,064 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:38:13,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 47.3125) internal successors, (757), 17 states have internal predecessors, (757), 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 15:38:13,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:38:13,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:38:15,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:38:15,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-10-03 15:38:15,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 15:38:15,520 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:38:15,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:38:15,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1950093279, now seen corresponding path program 1 times [2022-10-03 15:38:15,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:38:15,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383889270] [2022-10-03 15:38:15,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:38:15,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:38:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:38:16,418 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 228 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-03 15:38:16,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:38:16,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383889270] [2022-10-03 15:38:16,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383889270] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:38:16,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018374238] [2022-10-03 15:38:16,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:38:16,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:38:16,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:38:16,427 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 15:38:16,458 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 15:38:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:38:17,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 2700 conjuncts, 415 conjunts are in the unsatisfiable core [2022-10-03 15:38:17,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:38:17,260 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 15:38:17,505 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 15:38:17,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:38:17,620 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 15:38:18,584 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 15:38:18,592 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 15:38:21,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:38:21,344 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-10-03 15:38:21,351 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 15:38:21,495 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 15:38:21,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 20 treesize of output 20 [2022-10-03 15:38:21,919 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 37 treesize of output 33 [2022-10-03 15:38:28,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:38:28,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:38:28,972 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-10-03 15:38:28,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 49 [2022-10-03 15:38:29,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 12 treesize of output 11 [2022-10-03 15:38:31,567 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:38:31,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-10-03 15:38:32,594 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-10-03 15:38:32,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-10-03 15:38:33,147 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 15:38:33,147 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 71 treesize of output 64 [2022-10-03 15:38:33,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:38:33,157 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2022-10-03 15:38:34,950 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 62 treesize of output 45 [2022-10-03 15:38:34,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:38:34,962 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2022-10-03 15:38:36,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:38:36,257 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2022-10-03 15:38:36,266 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 42 treesize of output 37 [2022-10-03 15:38:40,025 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 15:38:40,025 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 85 [2022-10-03 15:38:40,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:38:40,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:38:40,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:38:40,034 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:38:40,042 INFO L356 Elim1Store]: treesize reduction 37, result has 7.5 percent of original size [2022-10-03 15:38:40,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 50 [2022-10-03 15:38:40,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:38:40,413 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:38:40,414 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 53 treesize of output 31 [2022-10-03 15:38:41,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:38:41,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 18 [2022-10-03 15:38:41,534 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 124 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:38:41,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 15:38:42,412 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 Int)) (or (let ((.cse1 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| v_ArrVal_314)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_315) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))) (not (<= |c_ULTIMATE.start_write~$Pointer$_#value#1.offset| v_ArrVal_314)))) is different from false [2022-10-03 15:38:42,451 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 Int)) (or (< v_ArrVal_314 (+ |c_ULTIMATE.start_fifo_pop_#t~mem41#1.offset| 4)) (let ((.cse1 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_314)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_315) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))))) is different from false [2022-10-03 15:38:42,465 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 Int)) (or (< v_ArrVal_314 (+ |c_ULTIMATE.start_fifo_pop_#t~mem41#1.offset| 4)) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_314)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_315) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))))) is different from false [2022-10-03 15:38:42,486 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 Int)) (or (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_314)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_315) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))) (< v_ArrVal_314 (+ |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| 4)))) is different from false [2022-10-03 15:38:42,497 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 Int)) (or (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_314)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_315) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))) (< v_ArrVal_314 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) 4)))) is different from false [2022-10-03 15:38:42,529 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 Int)) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|))) (or (< v_ArrVal_314 (+ (select .cse0 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset|) 4)) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store .cse0 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_314)))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse1 12) (select (select .cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_315) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse1))))))) is different from false [2022-10-03 15:38:42,555 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 Int)) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|))) (or (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| (store .cse2 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| v_ArrVal_314)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_315) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))) (< v_ArrVal_314 (+ (select .cse2 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset|) 4))))) is different from false [2022-10-03 15:38:42,565 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| .cse4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (or (< v_ArrVal_314 (+ (select .cse0 .cse1) 4)) (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse4 (store .cse0 .cse1 v_ArrVal_314)))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ 12 .cse2) (select (select .cse3 (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_315) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse2)))))))) is different from false [2022-10-03 15:38:42,597 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| .cse2)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse2 (store .cse3 .cse4 v_ArrVal_314)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_315) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))) (< v_ArrVal_314 (+ (select .cse3 .cse4) 4)))))) is different from false [2022-10-03 15:38:45,410 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_312 Int) (v_ArrVal_310 Int) (v_ArrVal_314 Int)) (let ((.cse7 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| v_ArrVal_310)))) (let ((.cse0 (select .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse8 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| v_ArrVal_312)))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse2 (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse3 (select .cse8 .cse2)) (.cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse4 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select .cse0 .cse1) .cse2)) (< v_ArrVal_314 (+ (select .cse3 .cse4) 4)) (let ((.cse6 (store .cse8 .cse2 (store .cse3 .cse4 v_ArrVal_314)))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse5 12) (select (select .cse6 (select (select (store .cse7 .cse2 v_ArrVal_315) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse5)))) (not (= (select .cse9 .cse1) .cse4)))))))) is different from false [2022-10-03 15:38:45,481 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_312 Int) (v_ArrVal_310 Int) (v_ArrVal_314 Int)) (let ((.cse2 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_310)))) (let ((.cse7 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse4 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_312)))) (let ((.cse9 (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse3 (select .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse5 (select .cse4 .cse3)) (.cse6 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse8 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (or (let ((.cse1 (store .cse4 .cse3 (store .cse5 .cse6 v_ArrVal_314)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store .cse2 .cse3 v_ArrVal_315) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))) (< v_ArrVal_314 (+ (select .cse5 .cse6) 4)) (not (= (select .cse7 .cse8) .cse3)) (not (= .cse6 (select .cse9 .cse8))))))))) is different from false [2022-10-03 15:38:45,520 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_312 Int) (v_ArrVal_310 Int) (v_ArrVal_314 Int)) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_310)))) (let ((.cse9 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_312)))) (let ((.cse1 (select .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse6 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse8 (select .cse7 .cse6)) (.cse0 (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (or (not (= .cse0 (select .cse1 .cse2))) (let ((.cse4 (store .cse7 .cse6 (store .cse8 .cse0 v_ArrVal_314)))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse3 12) (select (select .cse4 (select (select (store .cse5 .cse6 v_ArrVal_315) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse3)))) (< v_ArrVal_314 (+ (select .cse8 .cse0) 4)) (not (= .cse6 (select .cse9 .cse2))))))))) is different from false [2022-10-03 15:38:46,011 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_312 Int) (v_ArrVal_310 Int) (v_ArrVal_314 Int)) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset| v_ArrVal_310)))) (let ((.cse3 (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset| v_ArrVal_312)))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse2 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse4 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse0 (select .cse9 .cse2)) (.cse1 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (< v_ArrVal_314 (+ (select .cse0 .cse1) 4)) (not (= .cse2 (select .cse3 .cse4))) (not (= (select .cse5 .cse4) .cse1)) (let ((.cse7 (store .cse9 .cse2 (store .cse0 .cse1 v_ArrVal_314)))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ 12 .cse6) (select (select .cse7 (select (select (store .cse8 .cse2 v_ArrVal_315) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse6)))))))))) is different from false [2022-10-03 15:38:46,835 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_306 Int) (v_ArrVal_305 Int) (v_ArrVal_314 Int)) (let ((.cse9 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| v_ArrVal_305)))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse8 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse2 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| v_ArrVal_306)))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse7 (select .cse10 .cse8))) (let ((.cse5 (store .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse7))) (.cse4 (select .cse3 .cse8))) (let ((.cse6 (select .cse5 .cse4))) (or (let ((.cse1 (store .cse5 .cse4 (store .cse6 .cse7 v_ArrVal_314)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ 12 .cse0) (select (select .cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse4)) .cse4 v_ArrVal_315) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))) (< v_ArrVal_314 (+ (select .cse6 .cse7) 4))))))))) is different from false [2022-10-03 15:38:46,903 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_306 Int) (v_ArrVal_305 Int) (v_ArrVal_314 Int)) (let ((.cse9 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_305)))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse8 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse4 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_306)))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse1 (select .cse10 .cse8))) (let ((.cse7 (store .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse1))) (.cse6 (select .cse5 .cse8))) (let ((.cse0 (select .cse7 .cse6))) (or (< v_ArrVal_314 (+ 4 (select .cse0 .cse1))) (let ((.cse3 (store .cse7 .cse6 (store .cse0 .cse1 v_ArrVal_314)))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ 12 .cse2) (select (select .cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse6)) .cse6 v_ArrVal_315) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse2))))))))))) is different from false [2022-10-03 15:38:46,932 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_306 Int) (v_ArrVal_305 Int) (v_ArrVal_314 Int)) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_305)))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse8 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_306)))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse7 (select .cse10 .cse8))) (let ((.cse5 (store .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse7))) (.cse4 (select .cse3 .cse8))) (let ((.cse6 (select .cse5 .cse4))) (or (let ((.cse1 (store .cse5 .cse4 (store .cse6 .cse7 v_ArrVal_314)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse4)) .cse4 v_ArrVal_315) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))) (< v_ArrVal_314 (+ (select .cse6 .cse7) 4))))))))) is different from false [2022-10-03 15:38:47,272 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_306 Int) (v_ArrVal_305 Int) (v_ArrVal_314 Int)) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset| v_ArrVal_305)))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse8 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset| v_ArrVal_306)))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse1 (select .cse10 .cse8))) (let ((.cse7 (store .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse1))) (.cse6 (select .cse5 .cse8))) (let ((.cse0 (select .cse7 .cse6))) (or (< v_ArrVal_314 (+ (select .cse0 .cse1) 4)) (let ((.cse3 (store .cse7 .cse6 (store .cse0 .cse1 v_ArrVal_314)))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ 12 .cse2) (select (select .cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse6)) .cse6 v_ArrVal_315) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse2))))))))))) is different from false [2022-10-03 15:38:47,740 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_315 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_314 Int)) (let ((.cse9 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_303))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse8 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse2 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_304))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse7 (select .cse10 .cse8))) (let ((.cse5 (store .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse7))) (.cse4 (select .cse3 .cse8))) (let ((.cse6 (select .cse5 .cse4))) (or (let ((.cse1 (store .cse5 .cse4 (store .cse6 .cse7 v_ArrVal_314)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse4)) .cse4 v_ArrVal_315) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))) (< v_ArrVal_314 (+ (select .cse6 .cse7) 4))))))))) is different from false [2022-10-03 15:38:47,776 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_315 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_314 Int)) (let ((.cse9 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_303))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse8 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse4 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_304))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse1 (select .cse10 .cse8))) (let ((.cse7 (store .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse1))) (.cse6 (select .cse5 .cse8))) (let ((.cse0 (select .cse7 .cse6))) (or (< v_ArrVal_314 (+ (select .cse0 .cse1) 4)) (let ((.cse3 (store .cse7 .cse6 (store .cse0 .cse1 v_ArrVal_314)))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ 12 .cse2) (select (select .cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse6)) .cse6 v_ArrVal_315) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse2))))))))))) is different from false [2022-10-03 15:38:47,801 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_315 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_314 Int)) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_303))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse8 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_304))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse7 (select .cse10 .cse8))) (let ((.cse5 (store .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse7))) (.cse4 (select .cse3 .cse8))) (let ((.cse6 (select .cse5 .cse4))) (or (let ((.cse1 (store .cse5 .cse4 (store .cse6 .cse7 v_ArrVal_314)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse4)) .cse4 v_ArrVal_315) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))) (< v_ArrVal_314 (+ (select .cse6 .cse7) 4))))))))) is different from false [2022-10-03 15:38:52,795 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 18 treesize of output 12 [2022-10-03 15:40:44,170 WARN L233 SmtUtils]: Spent 30.79s on a formula simplification. DAG size of input: 76 DAG size of output: 64 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-10-03 15:40:44,171 INFO L356 Elim1Store]: treesize reduction 276, result has 70.4 percent of original size [2022-10-03 15:40:44,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 5428539622442 treesize of output 5313875087446