/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.line1611.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 14:51:04,444 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 14:51:04,446 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 14:51:04,486 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 14:51:04,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 14:51:04,489 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 14:51:04,491 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 14:51:04,493 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 14:51:04,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 14:51:04,499 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 14:51:04,500 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 14:51:04,501 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 14:51:04,501 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 14:51:04,503 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 14:51:04,504 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 14:51:04,506 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 14:51:04,507 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 14:51:04,508 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 14:51:04,509 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 14:51:04,514 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 14:51:04,515 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 14:51:04,516 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 14:51:04,518 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 14:51:04,518 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 14:51:04,524 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 14:51:04,525 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 14:51:04,525 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 14:51:04,526 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 14:51:04,526 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 14:51:04,527 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 14:51:04,527 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 14:51:04,528 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 14:51:04,529 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 14:51:04,530 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 14:51:04,530 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 14:51:04,531 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 14:51:04,531 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 14:51:04,531 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 14:51:04,531 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 14:51:04,532 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 14:51:04,533 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 14:51:04,533 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:51:04,557 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 14:51:04,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 14:51:04,557 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 14:51:04,558 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 14:51:04,558 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 14:51:04,558 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 14:51:04,559 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 14:51:04,559 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 14:51:04,559 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 14:51:04,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 14:51:04,560 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 14:51:04,560 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 14:51:04,560 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 14:51:04,560 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 14:51:04,560 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 14:51:04,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 14:51:04,561 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 14:51:04,561 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 14:51:04,561 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 14:51:04,561 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 14:51:04,561 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 14:51:04,561 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 14:51:04,561 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 14:51:04,561 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 14:51:04,561 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 14:51:04,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 14:51:04,562 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 14:51:04,562 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 14:51:04,562 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 14:51:04,562 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 14:51:04,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 14:51:04,562 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 14:51:04,563 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 14:51:04,563 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 14:51:04,563 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 14:51:04,563 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 14:51:04,563 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 14:51:04,563 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 14:51:04,563 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:51:04,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 14:51:04,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 14:51:04,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 14:51:04,781 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 14:51:04,781 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 14:51:04,782 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.line1611.bpl [2022-10-03 14:51:04,783 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo-bug_1w1r.line1611.bpl' [2022-10-03 14:51:04,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 14:51:04,863 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 14:51:04,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 14:51:04,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 14:51:04,865 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 14:51:04,878 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1611.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:51:04" (1/1) ... [2022-10-03 14:51:04,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1611.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:51:04" (1/1) ... [2022-10-03 14:51:04,905 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1611.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:51:04" (1/1) ... [2022-10-03 14:51:04,905 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1611.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:51:04" (1/1) ... [2022-10-03 14:51:04,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1611.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:51:04" (1/1) ... [2022-10-03 14:51:04,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1611.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:51:04" (1/1) ... [2022-10-03 14:51:04,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1611.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:51:04" (1/1) ... [2022-10-03 14:51:04,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 14:51:04,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 14:51:04,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 14:51:04,997 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 14:51:04,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo-bug_1w1r.line1611.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:51:04" (1/1) ... [2022-10-03 14:51:05,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 14:51:05,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:51:05,024 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:51:05,033 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:51:05,067 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-10-03 14:51:05,067 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-10-03 14:51:05,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 14:51:05,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 14:51:05,069 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:51:05,222 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 14:51:05,223 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 14:51:06,214 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 14:51:06,249 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 14:51:06,250 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-03 14:51:06,253 INFO L202 PluginConnector]: Adding new model divinefifo-bug_1w1r.line1611.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:51:06 BoogieIcfgContainer [2022-10-03 14:51:06,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 14:51:06,278 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 14:51:06,278 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 14:51:06,282 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 14:51:06,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line1611.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:51:04" (1/2) ... [2022-10-03 14:51:06,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ec6f24 and model type divinefifo-bug_1w1r.line1611.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:51:06, skipping insertion in model container [2022-10-03 14:51:06,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line1611.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:51:06" (2/2) ... [2022-10-03 14:51:06,284 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo-bug_1w1r.line1611.bpl [2022-10-03 14:51:06,291 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 14:51:06,297 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 14:51:06,297 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 14:51:06,297 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 14:51:06,444 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-10-03 14:51:06,523 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 14:51:06,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 14:51:06,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:51:06,525 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:51:06,530 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:51:06,564 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 14:51:06,576 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 14:51:06,589 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;@1a53615d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 14:51:06,589 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 14:51:07,162 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:51:07,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:51:07,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1136252429, now seen corresponding path program 1 times [2022-10-03 14:51:07,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:51:07,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796958227] [2022-10-03 14:51:07,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:51:07,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:51:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:51:07,763 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:51:07,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:51:07,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796958227] [2022-10-03 14:51:07,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796958227] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:51:07,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:51:07,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 14:51:07,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051773042] [2022-10-03 14:51:07,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:51:07,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 14:51:07,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:51:07,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 14:51:07,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 14:51:07,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:51:07,794 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:51:07,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 374.5) internal successors, (749), 2 states have internal predecessors, (749), 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:51:07,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:51:08,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:51:08,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 14:51:08,020 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:51:08,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:51:08,022 INFO L85 PathProgramCache]: Analyzing trace with hash 384684533, now seen corresponding path program 1 times [2022-10-03 14:51:08,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:51:08,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574774596] [2022-10-03 14:51:08,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:51:08,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:51:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:51:12,592 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:51:12,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:51:12,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574774596] [2022-10-03 14:51:12,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574774596] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:51:12,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:51:12,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2022-10-03 14:51:12,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339508113] [2022-10-03 14:51:12,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:51:12,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-10-03 14:51:12,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:51:12,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-10-03 14:51:12,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=4082, Unknown=0, NotChecked=0, Total=4290 [2022-10-03 14:51:12,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:51:12,603 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:51:12,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 12.318181818181818) internal successors, (813), 66 states have internal predecessors, (813), 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:51:12,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:51:12,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:51:31,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:51:31,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-10-03 14:51:31,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 14:51:31,741 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:51:31,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:51:31,742 INFO L85 PathProgramCache]: Analyzing trace with hash 153164909, now seen corresponding path program 1 times [2022-10-03 14:51:31,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:51:31,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835237689] [2022-10-03 14:51:31,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:51:31,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:51:31,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:51:34,850 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:51:34,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:51:34,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835237689] [2022-10-03 14:51:34,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835237689] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:51:34,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:51:34,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2022-10-03 14:51:34,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221582699] [2022-10-03 14:51:34,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:51:34,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-10-03 14:51:34,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:51:34,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-10-03 14:51:34,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=4605, Unknown=0, NotChecked=0, Total=4830 [2022-10-03 14:51:34,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:51:34,856 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:51:34,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 12.228571428571428) internal successors, (856), 70 states have internal predecessors, (856), 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:51:34,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:51:34,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 99 states. [2022-10-03 14:51:34,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:51:53,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:51:53,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-10-03 14:51:53,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-10-03 14:51:53,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-03 14:51:53,371 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:51:53,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:51:53,373 INFO L85 PathProgramCache]: Analyzing trace with hash -341259263, now seen corresponding path program 1 times [2022-10-03 14:51:53,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:51:53,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794563321] [2022-10-03 14:51:53,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:51:53,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:51:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:51:56,522 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:51:56,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:51:56,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794563321] [2022-10-03 14:51:56,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794563321] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:51:56,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:51:56,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [75] imperfect sequences [] total 75 [2022-10-03 14:51:56,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107873027] [2022-10-03 14:51:56,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:51:56,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-10-03 14:51:56,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:51:56,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-10-03 14:51:56,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=5315, Unknown=0, NotChecked=0, Total=5550 [2022-10-03 14:51:56,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:51:56,527 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:51:56,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 10.08) internal successors, (756), 75 states have internal predecessors, (756), 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:51:56,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:51:56,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-10-03 14:51:56,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2022-10-03 14:51:56,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:52:18,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:52:18,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-10-03 14:52:18,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-10-03 14:52:18,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2022-10-03 14:52:18,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-03 14:52:18,092 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:52:18,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:52:18,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1136456462, now seen corresponding path program 1 times [2022-10-03 14:52:18,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:52:18,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512754877] [2022-10-03 14:52:18,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:52:18,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:52:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:52:19,384 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:52:19,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:52:19,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512754877] [2022-10-03 14:52:19,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512754877] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:52:19,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:52:19,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-10-03 14:52:19,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226489879] [2022-10-03 14:52:19,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:52:19,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-10-03 14:52:19,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:52:19,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-10-03 14:52:19,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1780, Unknown=0, NotChecked=0, Total=1892 [2022-10-03 14:52:19,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:52:19,390 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:52:19,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 15.813953488372093) internal successors, (680), 44 states have internal predecessors, (680), 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:52:19,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:52:19,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-10-03 14:52:19,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2022-10-03 14:52:19,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 119 states. [2022-10-03 14:52:19,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:52:27,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:52:27,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-10-03 14:52:27,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-10-03 14:52:27,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-10-03 14:52:27,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-10-03 14:52:27,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-03 14:52:27,555 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:52:27,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:52:27,556 INFO L85 PathProgramCache]: Analyzing trace with hash 579707366, now seen corresponding path program 1 times [2022-10-03 14:52:27,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:52:27,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620529238] [2022-10-03 14:52:27,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:52:27,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:52:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:52:31,525 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:52:31,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:52:31,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620529238] [2022-10-03 14:52:31,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620529238] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:52:31,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:52:31,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [88] imperfect sequences [] total 88 [2022-10-03 14:52:31,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493064152] [2022-10-03 14:52:31,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:52:31,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2022-10-03 14:52:31,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:52:31,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2022-10-03 14:52:31,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=7372, Unknown=0, NotChecked=0, Total=7656 [2022-10-03 14:52:31,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:52:31,530 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:52:31,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 11.227272727272727) internal successors, (988), 88 states have internal predecessors, (988), 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:52:31,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:52:31,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-10-03 14:52:31,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2022-10-03 14:52:31,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 120 states. [2022-10-03 14:52:31,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 70 states. [2022-10-03 14:52:31,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:53:12,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:53:12,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-10-03 14:53:12,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-10-03 14:53:12,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2022-10-03 14:53:12,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-10-03 14:53:12,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2022-10-03 14:53:12,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-03 14:53:12,889 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:53:12,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:53:12,889 INFO L85 PathProgramCache]: Analyzing trace with hash -176670754, now seen corresponding path program 1 times [2022-10-03 14:53:12,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:53:12,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738563143] [2022-10-03 14:53:12,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:53:12,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:53:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:53:16,083 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:53:16,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:53:16,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738563143] [2022-10-03 14:53:16,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738563143] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:53:16,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:53:16,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [81] imperfect sequences [] total 81 [2022-10-03 14:53:16,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433263021] [2022-10-03 14:53:16,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:53:16,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-10-03 14:53:16,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:53:16,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-10-03 14:53:16,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=6227, Unknown=0, NotChecked=0, Total=6480 [2022-10-03 14:53:16,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:53:16,088 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:53:16,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 9.160493827160494) internal successors, (742), 81 states have internal predecessors, (742), 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:53:16,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:53:16,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-10-03 14:53:16,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2022-10-03 14:53:16,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 124 states. [2022-10-03 14:53:16,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2022-10-03 14:53:16,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 165 states. [2022-10-03 14:53:16,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:53:49,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:53:49,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-10-03 14:53:49,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-10-03 14:53:49,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2022-10-03 14:53:49,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-10-03 14:53:49,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2022-10-03 14:53:49,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2022-10-03 14:53:49,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-03 14:53:49,443 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:53:49,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:53:49,444 INFO L85 PathProgramCache]: Analyzing trace with hash 595730882, now seen corresponding path program 1 times [2022-10-03 14:53:49,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:53:49,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330369527] [2022-10-03 14:53:49,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:53:49,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:53:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:53:53,869 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 201 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:53:53,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:53:53,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330369527] [2022-10-03 14:53:53,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330369527] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:53:53,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528569043] [2022-10-03 14:53:53,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:53:53,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:53:53,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:53:53,883 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:53:53,884 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:53:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:53:54,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 2948 conjuncts, 198 conjunts are in the unsatisfiable core [2022-10-03 14:53:54,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:53:55,759 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:53:57,364 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 14:53:57,364 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 11 treesize of output 11 [2022-10-03 14:53:57,778 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 29 treesize of output 27 [2022-10-03 14:54:00,225 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 14:54:00,225 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 33 treesize of output 32 [2022-10-03 14:54:03,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:54:03,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:54:03,424 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-10-03 14:54:03,424 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 39 [2022-10-03 14:54:03,805 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 14:54:05,720 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:54:05,721 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 1 case distinctions, treesize of input 37 treesize of output 17 [2022-10-03 14:54:06,034 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 294 proven. 86 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-03 14:54:06,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 14:54:07,870 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 14:55:04,916 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_601 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse1 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_601) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= .cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (not (= (select .cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse0))))))) is different from false [2022-10-03 14:55:04,938 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_601 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse2 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_601) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1)) (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse1)))))) is different from false [2022-10-03 14:55:04,949 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_601 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_601) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse1) (not (= .cse1 (select .cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))))) is different from false [2022-10-03 14:55:04,995 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_601 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_601) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse1) (not (= .cse1 (select .cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))))) is different from false [2022-10-03 14:55:05,003 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_601 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) v_ArrVal_601) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= .cse0 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) is different from false [2022-10-03 14:55:05,025 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_601 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_601) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1)) (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse1)))))) is different from false [2022-10-03 14:55:05,338 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_601 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#in~self#1.base|) |c_ULTIMATE.start_fifo_pop_#in~self#1.offset|) v_ArrVal_601) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1)) (= .cse1 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) is different from false [2022-10-03 14:55:05,350 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_601 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_601) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse1) (not (= (select .cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1))))))) is different from false [2022-10-03 14:55:06,418 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse1 (select (let ((.cse3 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_600))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_601)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= .cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (not (= .cse0 (select .cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))))) is different from false [2022-10-03 14:55:06,446 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse2 (select (let ((.cse3 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_600))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_601)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1)) (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse1)))))) is different from false [2022-10-03 14:55:06,459 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse2 (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_600))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_601)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1)) (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse1)))))) is different from false [2022-10-03 14:55:06,481 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse2 (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_600))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_601)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse0)))))) is different from false [2022-10-03 14:55:09,532 INFO L356 Elim1Store]: treesize reduction 34, result has 59.0 percent of original size [2022-10-03 14:55:09,534 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 245 treesize of output 209 [2022-10-03 14:55:09,554 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:55:09,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 372 treesize of output 366 [2022-10-03 14:55:09,582 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:55:09,583 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 349 treesize of output 319 [2022-10-03 14:55:09,606 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:55:09,607 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 400 treesize of output 372 [2022-10-03 14:55:09,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-10-03 14:55:09,836 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:55:09,836 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 47 [2022-10-03 14:55:09,876 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 10 treesize of output 4 [2022-10-03 14:55:09,932 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:55:09,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 154 treesize of output 192 [2022-10-03 14:55:11,457 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:55:11,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 70 treesize of output 224 [2022-10-03 14:55:13,165 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 268 not checked. [2022-10-03 14:55:13,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528569043] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 14:55:13,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 14:55:13,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 70, 68] total 229 [2022-10-03 14:55:13,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807024946] [2022-10-03 14:55:13,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 14:55:13,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 229 states [2022-10-03 14:55:13,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:55:13,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 229 interpolants. [2022-10-03 14:55:13,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=845, Invalid=45966, Unknown=109, NotChecked=5292, Total=52212 [2022-10-03 14:55:13,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:55:13,182 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:55:13,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 229 states, 229 states have (on average 13.161572052401747) internal successors, (3014), 229 states have internal predecessors, (3014), 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:55:13,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:55:13,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 107 states. [2022-10-03 14:55:13,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 107 states. [2022-10-03 14:55:13,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 125 states. [2022-10-03 14:55:13,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2022-10-03 14:55:13,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 179 states. [2022-10-03 14:55:13,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 143 states. [2022-10-03 14:55:13,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:56:19,938 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse11 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|)) (.cse4 (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|)) (.cse10 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (select .cse10 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse15 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|) |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|)) (.cse2 (select .cse6 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) (.cse9 (select .cse7 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_init_~self#1.base|) |c_ULTIMATE.start_fifo_init_~self#1.offset|)) (.cse8 (select |c_#memory_$Pointer$.offset| .cse4)) (.cse3 (select .cse11 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) (.cse14 (+ |c_ULTIMATE.start_fifo_node_init_~self#1.offset| 4)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|) |c_ULTIMATE.start_fifo_empty_~self#1.offset|))) (and (<= (select (select |c_#memory_$Pointer$.offset| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_init_~self#1.base|) |c_ULTIMATE.start_fifo_init_~self#1.offset|)) 4) (= .cse1 |c_ULTIMATE.start_fifo_empty_#t~mem6#1.offset|) (<= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) 4) (= .cse4 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| .cse5) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) (<= (+ |c_ULTIMATE.start_write~$Pointer$_#value#1.base| 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= .cse6 .cse7) (<= (select (select |c_#memory_$Pointer$.offset| .cse5) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|) |c_ULTIMATE.start_fifo_empty_~self#1.offset|)) 4) (= (select |c_#valid| |c_ULTIMATE.start_write~$Pointer$_#value#1.base|) 1) (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|) (not (= .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|)) (= (select .cse8 .cse1) |c_ULTIMATE.start_fifo_empty_#t~mem8#1.offset|) (<= (+ 2 |c_ULTIMATE.start_fifo_node_init_#in~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_init_~self#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_ULTIMATE.start_fifo_init_~self#1.offset|) (= .cse4 .cse9) (= (select |c_#valid| |c_ULTIMATE.start_fifo_node_init_~self#1.base|) 1) (<= (+ 2 .cse0) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= .cse4 |c_ULTIMATE.start_fifo_empty_#t~mem6#1.base|) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#q~1#1.base|)) (= .cse10 .cse11) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (<= (+ 2 |c_ULTIMATE.start_fifo_node_init_#res#1.base|) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| .cse1) (= |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_init_~self#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_fifo_empty_#t~mem6#1.base|) 1) (<= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) |c_ULTIMATE.start_read~$Pointer$_#value#1.offset|) 4) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base|)) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse13 (select (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|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse12 (select .cse13 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse12 (select .cse13 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= .cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|)))))) (<= (select (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_node_init_~self#1.base|) |c_ULTIMATE.start_fifo_node_init_~self#1.offset|) .cse14) (= (select |c_#valid| |c_ULTIMATE.start_fifo_node_init_#in~self#1.base|) 1) (<= (+ 2 |c_ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base|) |c_ULTIMATE.start_main_~#q~1#1.base|) (= (select |c_#valid| .cse4) 1) (= (select |c_#valid| .cse15) 1) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_node_init_#in~self#1.base|)) (<= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_#t~mem6#1.base|) |c_ULTIMATE.start_fifo_empty_#t~mem6#1.offset|) 4) (<= (select (select |c_#memory_$Pointer$.offset| .cse15) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|) |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|)) 4) (= (select |c_ULTIMATE.start_#Ultimate.allocOnHeap_old_#valid#1| |c_ULTIMATE.start_main_~#q~1#1.base|) 1) (<= |c_ULTIMATE.start_fifo_empty_#t~mem8#1.offset| 4) (= (select |c_#valid| .cse2) 1) (= .cse9 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= .cse9 |c_ULTIMATE.start_fifo_empty_#t~mem5#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_fifo_init_#in~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= .cse4 |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) 1) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (<= (+ 2 |c_ULTIMATE.start_fifo_node_init_~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_node_init_~self#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base|) 1) (= |c_ULTIMATE.start_fifo_init_#in~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_init_~self#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) (not (= |c_ULTIMATE.start_write~$Pointer$_#value#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse17 (select (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|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse16 (select .cse17 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse16 (select .cse17 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|)) (= .cse16 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|))))) (<= (select .cse8 .cse3) 4) (<= (select (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#value#1.base|) |c_ULTIMATE.start_write~$Pointer$_#value#1.offset|) 4) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_fifo_init_~self#1.base|) 1) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_fifo_node_init_#in~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_empty_#in~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (= .cse5 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (<= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_node_init_~self#1.base|) |c_ULTIMATE.start_fifo_node_init_~self#1.offset|) .cse14) (= |c_ULTIMATE.start_fifo_node_init_~self#1.offset| 0) (<= (+ .cse4 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) 1) (= |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= (select |c_#valid| .cse5) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|))))) is different from false [2022-10-03 14:56:21,197 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|)) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse4 (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_600))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_601)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse3 (store .cse4 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse2 (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse2)))))) (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| |c_ULTIMATE.start_main_~#q~1#1.base|) 1) (<= (select (select |c_#memory_$Pointer$.offset| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) 4) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)) (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| .cse0) 1) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|)))) is different from false [2022-10-03 14:56:21,648 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|)) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse4 (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_600))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_601)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse3 (store .cse4 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse2 (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse2)))))) (<= (select (select |c_#memory_$Pointer$.offset| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) 4) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|)))) is different from false [2022-10-03 14:56:22,096 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|)) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (not (= .cse0 |c_ULTIMATE.start_main_~#p~0#1.base|)) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= (select (select |c_#memory_$Pointer$.offset| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) 4) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_main_~#p~0#1.base|)) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse4 (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_600))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_601)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (store .cse4 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse3)) (= (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse3))))))))) is different from false [2022-10-03 14:56:22,545 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse0)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse3 (select (let ((.cse4 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_600))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_601)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse2)) (= (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse2)))))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= (select (select |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.offset| .cse0) (select (select |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) 4) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_main_~#p~0#1.base|)) (= .cse0 (select .cse5 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (not (= .cse0 |c_ULTIMATE.start_main_~#p~0#1.base|)) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|)))) is different from false [2022-10-03 14:56:23,010 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse0)) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= (select (select |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.offset| .cse0) (select (select |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) 4) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse2 (select (let ((.cse4 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_600))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_601)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= .cse1 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (not (= .cse1 (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))))) (= .cse0 (select .cse5 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (not (= .cse0 |c_ULTIMATE.start_write~int_#ptr#1.base|)) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|)))) is different from false [2022-10-03 14:56:23,429 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|)) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (forall ((v_ArrVal_601 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_601) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse3) (not (= (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse3))))))) (<= (select (select |c_#memory_$Pointer$.offset| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) 4) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|)))) is different from false [2022-10-03 14:56:23,850 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_#in~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (forall ((v_ArrVal_601 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_601) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse3) (not (= (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse3))))))) (= |c_ULTIMATE.start_fifo_front_#in~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (not (= |c_ULTIMATE.start_fifo_front_#in~self#1.base| .cse5)) (<= (select (select |c_#memory_$Pointer$.offset| .cse5) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_front_#in~self#1.base|) |c_ULTIMATE.start_fifo_front_#in~self#1.offset|)) 4) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_front_#in~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|)))) is different from false [2022-10-03 14:56:24,271 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (forall ((v_ArrVal_601 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_601) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse3) (not (= (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse3))))))) (<= (select (select |c_#memory_$Pointer$.offset| .cse5) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|)) 4) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (not (= |c_ULTIMATE.start_fifo_front_~self#1.base| .cse5)) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:56:24,698 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse1 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (not (= |c_ULTIMATE.start_fifo_empty_#in~self#1.base| .cse0)) (= |c_ULTIMATE.start_fifo_empty_#in~self#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= .cse1 (select .cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (forall ((v_ArrVal_601 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse3 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_601) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse5 (store .cse3 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse4) (not (= (select .cse5 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse4))))))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (<= (select (select |c_#memory_$Pointer$.offset| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|)) 4) (= |c_ULTIMATE.start_fifo_empty_#in~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (<= (+ .cse1 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:56:25,126 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse1 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (not (= |c_ULTIMATE.start_fifo_empty_~self#1.base| .cse0)) (= .cse1 (select .cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (forall ((v_ArrVal_601 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse3 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_601) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse5 (store .cse3 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse4) (not (= (select .cse5 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse4))))))) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (<= (select (select |c_#memory_$Pointer$.offset| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|)) 4) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (<= (+ .cse1 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:56:25,549 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (forall ((v_ArrVal_601 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_601) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse3) (not (= (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse3))))))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (<= (select (select |c_#memory_$Pointer$.offset| .cse5) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|)) 4) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (not (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| .cse5))))) is different from false [2022-10-03 14:56:27,005 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|) (not (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|)) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (forall ((v_ArrVal_601 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_601) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse3) (not (= (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse3))))))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= |c_ULTIMATE.start_fifo_empty_#in~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (<= (select (select |c_#memory_$Pointer$.offset| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|) |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|)) 4) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:56:27,429 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|)) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (forall ((v_ArrVal_601 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_601) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse3) (not (= (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse3))))))) (<= (select (select |c_#memory_$Pointer$.offset| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|) |c_ULTIMATE.start_fifo_empty_~self#1.offset|)) 4) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:56:27,857 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|)) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (forall ((v_ArrVal_601 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_601) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse3) (not (= (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse3))))))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (<= (select (select |c_#memory_$Pointer$.offset| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) 4) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:56:28,281 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= .cse0 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (<= (select (select |c_#memory_$Pointer$.offset| .cse0) |c_ULTIMATE.start_read~$Pointer$_#value#1.offset|) 4) (not (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|)) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (forall ((v_ArrVal_601 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_601) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse3) (not (= (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse3))))))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:56:28,715 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_ULTIMATE.start_fifo_empty_#t~mem6#1.offset|) (not (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|)) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (forall ((v_ArrVal_601 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_601) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse3) (not (= (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse3))))))) (= .cse0 |c_ULTIMATE.start_fifo_empty_#t~mem6#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (<= (select (select |c_#memory_$Pointer$.offset| .cse0) |c_ULTIMATE.start_fifo_empty_#t~mem6#1.offset|) 4) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:56:29,145 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) (not (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|)) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (<= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) 4) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (forall ((v_ArrVal_601 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_601) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse3) (not (= (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse3))))))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= .cse0 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:56:29,572 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|)) (<= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| 4) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (forall ((v_ArrVal_601 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_601) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse3) (not (= (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse3))))))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:56:29,995 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) |c_ULTIMATE.start_fifo_empty_#t~mem8#1.offset|) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (forall ((v_ArrVal_601 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_601) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse3) (not (= (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse3))))))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (<= |c_ULTIMATE.start_fifo_empty_#t~mem8#1.offset| 4) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:56:30,435 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|)) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (forall ((v_ArrVal_601 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_601) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse3) (not (= (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse3))))))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (<= (select (select |c_#memory_$Pointer$.offset| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) 4) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:56:30,899 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#in~self#1.base|) |c_ULTIMATE.start_fifo_pop_#in~self#1.offset|)) (.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse2)) (= |c_ULTIMATE.start_fifo_pop_#in~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (forall ((v_ArrVal_601 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse5 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#in~self#1.base|) |c_ULTIMATE.start_fifo_pop_#in~self#1.offset|) v_ArrVal_601) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse3 (store .cse5 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse4)) (= .cse4 (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) (<= (select (select |c_#memory_$Pointer$.offset| .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#in~self#1.base|) |c_ULTIMATE.start_fifo_pop_#in~self#1.offset|)) 4) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_#in~self#1.base|) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|)))) is different from false [2022-10-03 14:56:31,326 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (<= (select (select |c_#memory_$Pointer$.offset| .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) 4) (not (= .cse2 |c_ULTIMATE.start_main_~#q~1#1.base|)) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (forall ((v_ArrVal_601 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse5 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_601) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse3 (store .cse5 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse4)) (= (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse4)))))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:56:31,815 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|)) (.cse4 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse0 (select .cse2 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (and (<= (select (select |c_#memory_$Pointer$.offset| .cse0) (select .cse1 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) 4) (= .cse2 .cse3) (= .cse4 (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse1) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (forall ((v_ArrVal_601 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse7 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) v_ArrVal_601) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse6 (store .cse7 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse5 (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse5 (select .cse6 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= .cse5 (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) (<= (+ .cse4 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse0)) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:56:32,242 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|)) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (<= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) |c_ULTIMATE.start_read~$Pointer$_#value#1.offset|) 4) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (forall ((v_ArrVal_601 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_601) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse3) (not (= .cse3 (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:56:32,677 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset|) 4) (forall ((v_ArrVal_601 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_601) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse3) (not (= .cse3 (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))))) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) (= |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|)) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:56:33,106 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (<= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) 4) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (forall ((v_ArrVal_601 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_601) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse3) (not (= .cse3 (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))))) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) (= |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|)) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:56:33,538 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (<= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| 4) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (forall ((v_ArrVal_601 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_601) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse3) (not (= .cse3 (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))))) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) (= |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|)) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:56:33,956 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= |c_ULTIMATE.start_fifo_pop_#t~mem41#1.offset| 4) (forall ((v_ArrVal_601 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_601) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse3) (not (= .cse3 (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))))) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) (= |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|)) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:56:34,378 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= |c_ULTIMATE.start_fifo_pop_#t~mem41#1.offset| 4) (= (select (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) (= (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1) (<= (+ 2 .cse1) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|)) (= (select (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset|) (forall ((v_ArrVal_601 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse4 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_601) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (store .cse4 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse3)) (= (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse3)))))) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:56:34,818 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= (select (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (forall ((v_ArrVal_601 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_602 Int)) (let ((.cse1 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_601) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_602))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= .cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (not (= (select .cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse0))))))) (<= |c_ULTIMATE.start_write~$Pointer$_#value#1.offset| 8) (= (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse4) (<= (+ 2 .cse4) |c_ULTIMATE.start_main_~#q~1#1.base|) (= (select (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|)) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:58:05,013 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-10-03 14:58:05,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-10-03 14:58:05,034 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:58:05,214 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,SelfDestructingSolverStorable7 [2022-10-03 14:58:05,215 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:894) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:152) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.next(NestedIterator.java:94) at java.base/java.util.Iterator.forEachRemaining(Iterator.java:133) at java.base/java.util.Spliterators$IteratorSpliterator.forEachRemaining(Spliterators.java:1801) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEachOrdered(ReferencePipeline.java:502) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:235) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:164) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:97) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:121) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:322) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 58 more [2022-10-03 14:58:05,218 INFO L158 Benchmark]: Toolchain (without parser) took 420354.27ms. Allocated memory was 191.9MB in the beginning and 843.1MB in the end (delta: 651.2MB). Free memory was 145.8MB in the beginning and 153.8MB in the end (delta: -8.1MB). Peak memory consumption was 642.9MB. Max. memory is 8.0GB. [2022-10-03 14:58:05,218 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.12ms. Allocated memory is still 191.9MB. Free memory is still 151.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-03 14:58:05,218 INFO L158 Benchmark]: Boogie Preprocessor took 129.65ms. Allocated memory is still 191.9MB. Free memory was 145.8MB in the beginning and 139.3MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-10-03 14:58:05,218 INFO L158 Benchmark]: RCFGBuilder took 1256.64ms. Allocated memory is still 191.9MB. Free memory was 139.2MB in the beginning and 100.8MB in the end (delta: 38.3MB). Peak memory consumption was 37.5MB. Max. memory is 8.0GB. [2022-10-03 14:58:05,219 INFO L158 Benchmark]: TraceAbstraction took 418938.87ms. Allocated memory was 232.8MB in the beginning and 843.1MB in the end (delta: 610.3MB). Free memory was 201.9MB in the beginning and 153.8MB in the end (delta: 48.1MB). Peak memory consumption was 657.9MB. Max. memory is 8.0GB. [2022-10-03 14:58:05,220 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.12ms. Allocated memory is still 191.9MB. Free memory is still 151.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 129.65ms. Allocated memory is still 191.9MB. Free memory was 145.8MB in the beginning and 139.3MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1256.64ms. Allocated memory is still 191.9MB. Free memory was 139.2MB in the beginning and 100.8MB in the end (delta: 38.3MB). Peak memory consumption was 37.5MB. Max. memory is 8.0GB. * TraceAbstraction took 418938.87ms. Allocated memory was 232.8MB in the beginning and 843.1MB in the end (delta: 610.3MB). Free memory was 201.9MB in the beginning and 153.8MB in the end (delta: 48.1MB). Peak memory consumption was 657.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-10-03 14:58:05,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 Received shutdown request...