/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -i ../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line1267.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 15:20:26,124 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 15:20:26,125 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 15:20:26,151 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 15:20:26,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 15:20:26,153 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 15:20:26,156 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 15:20:26,160 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 15:20:26,161 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 15:20:26,165 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 15:20:26,166 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 15:20:26,167 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 15:20:26,167 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 15:20:26,169 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 15:20:26,170 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 15:20:26,172 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 15:20:26,173 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 15:20:26,175 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 15:20:26,176 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 15:20:26,180 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 15:20:26,181 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 15:20:26,182 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 15:20:26,183 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 15:20:26,184 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 15:20:26,189 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 15:20:26,189 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 15:20:26,189 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 15:20:26,190 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 15:20:26,190 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 15:20:26,191 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 15:20:26,191 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 15:20:26,191 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 15:20:26,192 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 15:20:26,192 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 15:20:26,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 15:20:26,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 15:20:26,193 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 15:20:26,193 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 15:20:26,193 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 15:20:26,194 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 15:20:26,194 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 15:20:26,197 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-03 15:20:26,216 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 15:20:26,216 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 15:20:26,217 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 15:20:26,217 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 15:20:26,217 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 15:20:26,217 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 15:20:26,218 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 15:20:26,218 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 15:20:26,218 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 15:20:26,218 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 15:20:26,218 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 15:20:26,218 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 15:20:26,218 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 15:20:26,218 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 15:20:26,218 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 15:20:26,218 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 15:20:26,218 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 15:20:26,219 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 15:20:26,219 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 15:20:26,219 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 15:20:26,219 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 15:20:26,220 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 15:20:26,220 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 15:20:26,221 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 15:20:26,221 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 15:20:26,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 15:20:26,222 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 15:20:26,222 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 15:20:26,222 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 15:20:26,222 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 15:20:26,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 15:20:26,222 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 15:20:26,223 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 15:20:26,223 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 15:20:26,223 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 15:20:26,223 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 15:20:26,223 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 15:20:26,223 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 15:20:26,223 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-03 15:20:26,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 15:20:26,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 15:20:26,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 15:20:26,425 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 15:20:26,425 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 15:20:26,427 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line1267.bpl [2022-10-03 15:20:26,427 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line1267.bpl' [2022-10-03 15:20:26,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 15:20:26,502 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 15:20:26,504 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 15:20:26,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 15:20:26,504 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 15:20:26,515 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo_1w1r.line1267.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:20:26" (1/1) ... [2022-10-03 15:20:26,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo_1w1r.line1267.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:20:26" (1/1) ... [2022-10-03 15:20:26,542 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1267.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:20:26" (1/1) ... [2022-10-03 15:20:26,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1267.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:20:26" (1/1) ... [2022-10-03 15:20:26,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo_1w1r.line1267.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:20:26" (1/1) ... [2022-10-03 15:20:26,585 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo_1w1r.line1267.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:20:26" (1/1) ... [2022-10-03 15:20:26,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo_1w1r.line1267.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:20:26" (1/1) ... [2022-10-03 15:20:26,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 15:20:26,608 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 15:20:26,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 15:20:26,609 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 15:20:26,610 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo_1w1r.line1267.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:20:26" (1/1) ... [2022-10-03 15:20:26,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 15:20:26,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:20:26,634 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-03 15:20:26,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-03 15:20:26,693 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-10-03 15:20:26,694 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-10-03 15:20:26,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 15:20:26,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 15:20:26,695 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-03 15:20:26,899 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 15:20:26,900 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 15:20:27,773 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 15:20:27,795 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 15:20:27,795 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-03 15:20:27,799 INFO L202 PluginConnector]: Adding new model divinefifo_1w1r.line1267.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:20:27 BoogieIcfgContainer [2022-10-03 15:20:27,799 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 15:20:27,802 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 15:20:27,802 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 15:20:27,805 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 15:20:27,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1267.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:20:26" (1/2) ... [2022-10-03 15:20:27,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fbd9969 and model type divinefifo_1w1r.line1267.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:20:27, skipping insertion in model container [2022-10-03 15:20:27,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1267.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:20:27" (2/2) ... [2022-10-03 15:20:27,807 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo_1w1r.line1267.bpl [2022-10-03 15:20:27,812 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 15:20:27,818 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 15:20:27,818 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 15:20:27,818 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 15:20:27,948 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-10-03 15:20:28,001 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 15:20:28,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 15:20:28,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:20:28,004 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-03 15:20:28,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-10-03 15:20:28,025 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 15:20:28,030 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 15:20:28,035 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;@c76aa82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 15:20:28,035 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 15:20:28,335 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:20:28,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:20:28,340 INFO L85 PathProgramCache]: Analyzing trace with hash -828338736, now seen corresponding path program 1 times [2022-10-03 15:20:28,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:20:28,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683873457] [2022-10-03 15:20:28,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:20:28,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:20:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:20:28,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:20:28,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:20:28,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683873457] [2022-10-03 15:20:28,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683873457] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:20:28,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:20:28,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 15:20:28,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740615693] [2022-10-03 15:20:28,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:20:28,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 15:20:28,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:20:28,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 15:20:28,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 15:20:28,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:28,738 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:20:28,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 239.5) internal successors, (479), 2 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:20:28,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:28,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:28,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 15:20:28,857 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:20:28,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:20:28,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1581131246, now seen corresponding path program 1 times [2022-10-03 15:20:28,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:20:28,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113017624] [2022-10-03 15:20:28,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:20:28,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:20:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:20:32,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:20:32,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:20:32,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113017624] [2022-10-03 15:20:32,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113017624] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:20:32,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:20:32,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-10-03 15:20:32,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138994772] [2022-10-03 15:20:32,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:20:32,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-10-03 15:20:32,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:20:32,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-10-03 15:20:32,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=3597, Unknown=0, NotChecked=0, Total=3782 [2022-10-03 15:20:32,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:32,470 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:20:32,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 8.806451612903226) internal successors, (546), 62 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:20:32,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:32,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:47,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:47,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-10-03 15:20:47,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 15:20:47,850 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:20:47,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:20:47,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1566753937, now seen corresponding path program 1 times [2022-10-03 15:20:47,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:20:47,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003686149] [2022-10-03 15:20:47,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:20:47,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:20:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:20:48,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:20:48,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:20:48,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003686149] [2022-10-03 15:20:48,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003686149] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:20:48,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:20:48,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-10-03 15:20:48,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121913790] [2022-10-03 15:20:48,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:20:48,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-10-03 15:20:48,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:20:48,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-10-03 15:20:48,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650 [2022-10-03 15:20:48,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:48,470 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:20:48,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 19.56) internal successors, (489), 26 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:20:48,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:48,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2022-10-03 15:20:48,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:53,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:53,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-10-03 15:20:53,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-10-03 15:20:53,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-03 15:20:53,930 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:20:53,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:20:53,931 INFO L85 PathProgramCache]: Analyzing trace with hash -428128599, now seen corresponding path program 1 times [2022-10-03 15:20:53,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:20:53,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676233697] [2022-10-03 15:20:53,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:20:53,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:20:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:20:56,748 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:20:56,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:20:56,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676233697] [2022-10-03 15:20:56,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676233697] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:20:56,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:20:56,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [74] imperfect sequences [] total 74 [2022-10-03 15:20:56,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099637967] [2022-10-03 15:20:56,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:20:56,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-10-03 15:20:56,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:20:56,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-10-03 15:20:56,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=5174, Unknown=0, NotChecked=0, Total=5402 [2022-10-03 15:20:56,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:56,753 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:20:56,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 10.472972972972974) internal successors, (775), 74 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:20:56,753 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:56,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 95 states. [2022-10-03 15:20:56,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2022-10-03 15:20:56,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:21:16,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:21:16,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-10-03 15:21:16,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-10-03 15:21:16,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-10-03 15:21:16,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-03 15:21:16,831 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:21:16,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:21:16,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1614154555, now seen corresponding path program 1 times [2022-10-03 15:21:16,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:21:16,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305102567] [2022-10-03 15:21:16,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:21:16,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:21:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:21:19,698 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:21:19,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:21:19,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305102567] [2022-10-03 15:21:19,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305102567] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:21:19,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:21:19,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [80] imperfect sequences [] total 80 [2022-10-03 15:21:19,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25375792] [2022-10-03 15:21:19,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:21:19,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-10-03 15:21:19,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:21:19,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-10-03 15:21:19,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=6064, Unknown=0, NotChecked=0, Total=6320 [2022-10-03 15:21:19,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:21:19,702 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:21:19,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 8.7375) internal successors, (699), 80 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:21:19,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:21:19,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 95 states. [2022-10-03 15:21:19,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2022-10-03 15:21:19,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 120 states. [2022-10-03 15:21:19,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:21:44,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:21:44,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-10-03 15:21:44,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-10-03 15:21:44,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2022-10-03 15:21:44,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2022-10-03 15:21:44,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-03 15:21:44,668 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:21:44,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:21:44,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1902780870, now seen corresponding path program 1 times [2022-10-03 15:21:44,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:21:44,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482510997] [2022-10-03 15:21:44,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:21:44,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:21:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:21:45,130 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-03 15:21:45,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:21:45,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482510997] [2022-10-03 15:21:45,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482510997] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:21:45,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:21:45,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-10-03 15:21:45,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216300169] [2022-10-03 15:21:45,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:21:45,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-03 15:21:45,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:21:45,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-03 15:21:45,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2022-10-03 15:21:45,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:21:45,133 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:21:45,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 54.294117647058826) internal successors, (923), 18 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:21:45,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:21:45,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-10-03 15:21:45,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-10-03 15:21:45,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 124 states. [2022-10-03 15:21:45,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 134 states. [2022-10-03 15:21:45,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:21:48,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:21:48,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-10-03 15:21:48,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-10-03 15:21:48,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2022-10-03 15:21:48,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2022-10-03 15:21:48,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-10-03 15:21:48,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-03 15:21:48,764 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:21:48,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:21:48,765 INFO L85 PathProgramCache]: Analyzing trace with hash 416920210, now seen corresponding path program 1 times [2022-10-03 15:21:48,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:21:48,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381021144] [2022-10-03 15:21:48,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:21:48,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:21:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:21:52,581 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 217 proven. 182 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-03 15:21:52,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:21:52,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381021144] [2022-10-03 15:21:52,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381021144] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:21:52,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221759586] [2022-10-03 15:21:52,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:21:52,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:21:52,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:21:52,583 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 15:21:52,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-03 15:21:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:21:53,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 2953 conjuncts, 259 conjunts are in the unsatisfiable core [2022-10-03 15:21:53,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:21:53,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 15:21:53,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:21:53,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-03 15:21:54,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-03 15:21:54,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-03 15:21:56,429 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 15:21:56,430 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 15:21:56,838 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 15:21:59,909 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 15:21:59,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2022-10-03 15:22:02,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:22:02,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:22:02,818 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-10-03 15:22:02,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2022-10-03 15:22:05,729 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 15:22:05,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 40 [2022-10-03 15:22:05,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:22:05,745 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 24 treesize of output 24 [2022-10-03 15:22:06,713 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 161 proven. 269 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-03 15:22:06,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 15:22:07,508 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_471 (Array Int Int))) (let ((.cse0 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_471) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))) (forall ((v_ArrVal_472 (Array Int 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_472) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) is different from false [2022-10-03 15:22:07,526 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_471 (Array Int Int))) (let ((.cse0 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_471) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (forall ((v_ArrVal_472 (Array Int Int))) (let ((.cse1 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_472) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) is different from false [2022-10-03 15:22:07,536 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_472 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_472) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (forall ((v_ArrVal_471 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_471) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) is different from false [2022-10-03 15:22:07,577 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_471 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_471) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (forall ((v_ArrVal_472 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_472) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) is different from false [2022-10-03 15:22:07,593 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_472 (Array Int Int))) (let ((.cse0 (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_472) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))) (forall ((v_ArrVal_471 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) v_ArrVal_471) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) is different from false [2022-10-03 15:22:07,612 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_471 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_471) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))) (forall ((v_ArrVal_472 (Array Int Int))) (let ((.cse1 (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_472) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) is different from false [2022-10-03 15:22:08,894 INFO L356 Elim1Store]: treesize reduction 13, result has 79.0 percent of original size [2022-10-03 15:22:08,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 111 [2022-10-03 15:22:08,900 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 58 treesize of output 52 [2022-10-03 15:22:23,013 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse0)) (not (= (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse0)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) is different from false [2022-10-03 15:22:23,367 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse1 (store (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_468) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse0)) (not (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) is different from false [2022-10-03 15:22:23,392 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse0 (store (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_468) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (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)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse1)))))) is different from false [2022-10-03 15:22:23,406 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_468) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (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)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse1)))))) is different from false [2022-10-03 15:22:23,470 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_468) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (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)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse1)))))) is different from false [2022-10-03 15:22:23,479 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse1 (store (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_468) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (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|)))) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse0)))))) is different from false [2022-10-03 15:22:23,507 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse1 (store (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_468) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse0)) (not (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) is different from false [2022-10-03 15:22:23,966 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse1 (store (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_468) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse0)) (not (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) is different from false [2022-10-03 15:22:23,982 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse1 (store (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_468) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse0)) (not (= (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse0)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) is different from false [2022-10-03 15:22:25,473 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_467 (Array Int Int)) (v_ArrVal_469 Int)) (let ((.cse1 (store (select (let ((.cse2 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_467))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_468)) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|) (not (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (not (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|)))))) is different from false [2022-10-03 15:22:25,498 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_467 (Array Int Int)) (v_ArrVal_469 Int)) (let ((.cse1 (store (select (let ((.cse2 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_467))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_468)) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|)) (not (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) is different from false [2022-10-03 15:22:25,526 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_467 (Array Int Int)) (v_ArrVal_469 Int)) (let ((.cse1 (store (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_467))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_468)) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse0)) (not (= (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse0)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) is different from false [2022-10-03 15:22:25,553 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_467 (Array Int Int)) (v_ArrVal_469 Int)) (let ((.cse0 (store (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_467))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_468)) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (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)) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse1)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) is different from false [2022-10-03 15:22:28,635 INFO L356 Elim1Store]: treesize reduction 34, result has 59.0 percent of original size [2022-10-03 15:22:28,635 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 213 treesize of output 193 [2022-10-03 15:22:28,652 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:22:28,652 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 367 treesize of output 363 [2022-10-03 15:22:28,658 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:22:28,662 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 343 treesize of output 319 [2022-10-03 15:22:28,669 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:22:28,672 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 342 treesize of output 314 [2022-10-03 15:22:28,792 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 15:22:28,807 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 15:22:28,830 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:22:28,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 53 [2022-10-03 15:22:28,877 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:22:28,904 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:22:28,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 169 treesize of output 201 [2022-10-03 15:22:30,569 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:22:30,570 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 15:22:45,385 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 340 not checked. [2022-10-03 15:22:45,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221759586] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 15:22:45,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 15:22:45,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 82, 74] total 246 [2022-10-03 15:22:45,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095338801] [2022-10-03 15:22:45,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 15:22:45,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 246 states [2022-10-03 15:22:45,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:22:45,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 246 interpolants. [2022-10-03 15:22:45,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1161, Invalid=50178, Unknown=39, NotChecked=8892, Total=60270 [2022-10-03 15:22:45,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:22:45,399 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:22:45,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 246 states, 246 states have (on average 12.707317073170731) internal successors, (3126), 246 states have internal predecessors, (3126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:22:45,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:22:45,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-10-03 15:22:45,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-10-03 15:22:45,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 125 states. [2022-10-03 15:22:45,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 139 states. [2022-10-03 15:22:45,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-10-03 15:22:45,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:23:30,188 WARN L233 SmtUtils]: Spent 20.20s on a formula simplification. DAG size of input: 113 DAG size of output: 81 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 15:23:53,113 WARN L233 SmtUtils]: Spent 22.62s on a formula simplification. DAG size of input: 143 DAG size of output: 90 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 15:24:17,145 WARN L233 SmtUtils]: Spent 23.75s on a formula simplification. DAG size of input: 155 DAG size of output: 92 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 15:24:43,397 WARN L233 SmtUtils]: Spent 25.89s on a formula simplification. DAG size of input: 156 DAG size of output: 93 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 15:25:09,512 WARN L233 SmtUtils]: Spent 25.75s on a formula simplification. DAG size of input: 158 DAG size of output: 95 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 15:25:10,034 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse18 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|)) (.cse15 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|)) (.cse4 (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse19 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_init_~self#1.base|)) (.cse13 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|)) (.cse20 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|))) (let ((.cse3 (select .cse20 |c_ULTIMATE.start_fifo_empty_~self#1.offset|)) (.cse16 (select .cse13 |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_init_~self#1.base|)) (.cse0 (select .cse19 |c_ULTIMATE.start_fifo_init_~self#1.offset|)) (.cse12 (< (select |c_#length| |c_ULTIMATE.start_fifo_init_~self#1.base|) (+ 8 |c_ULTIMATE.start_fifo_init_~self#1.offset|))) (.cse5 (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_init_~self#1.base|)) (.cse6 (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_ULTIMATE.start_fifo_init_~self#1.offset|)) (.cse14 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse11 (select |c_#memory_$Pointer$.offset| .cse4)) (.cse17 (select .cse15 |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|)) (.cse2 (select .cse18 |c_ULTIMATE.start_fifo_empty_~self#1.offset|))) (and (<= (select (select |c_#memory_$Pointer$.offset| .cse0) (select .cse1 |c_ULTIMATE.start_fifo_init_~self#1.offset|)) 4) (< |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|) (<= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) 4) (= |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|)) .cse5 .cse6 (= .cse4 (select .cse7 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (not (= .cse4 |c_ULTIMATE.start_main_~#p~0#1.base|)) (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_467 (Array Int Int)) (v_ArrVal_469 Int)) (let ((.cse9 (store (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_467))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_468)) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse8)) (not (= (select .cse9 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse8)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (<= (+ 2 .cse0) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#q~1#1.base|)) (<= (select .cse11 .cse3) 4) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (or .cse12 (and .cse5 .cse6 (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_node_init_#res#1.base|)))) (= |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_init_~self#1.offset|) (= .cse7 .cse13) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= .cse14 .cse15) (or .cse12 (and .cse5 .cse6 (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_node_init_~self#1.base|)))) (<= (+ 2 |c_ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base|) |c_ULTIMATE.start_main_~#q~1#1.base|) (= (select |c_ULTIMATE.start_#Ultimate.allocOnHeap_old_#valid#1| |c_ULTIMATE.start_fifo_init_~self#1.base|) 1) (not (= .cse4 |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)) (= (select |c_#valid| .cse16) 1) (<= (select (select |c_#memory_$Pointer$.offset| .cse16) .cse17) 4) (= .cse14 .cse1) (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| |c_ULTIMATE.start_main_~#q~1#1.base|) 1) (= (select |c_#valid| .cse0) 1) (<= (select .cse11 (select .cse14 |c_ULTIMATE.start_main_~#q~1#1.offset|)) 4) (= .cse18 .cse7) (= (select |c_#valid| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 1) (<= (select |c_#length| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 8) (or .cse12 (and .cse5 .cse6 (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_node_init_#in~self#1.base|)))) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)) (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_main_~#p~0#1.base|)) (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| .cse4) 1) (= |c_ULTIMATE.start_fifo_init_~self#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) (= .cse19 .cse7) (= (select |c_#valid| |c_ULTIMATE.start_fifo_init_~self#1.base|) 1) (<= |c_ULTIMATE.start_#Ultimate.allocOnStack_~size#1| 8) (= .cse20 .cse14) (= |c_ULTIMATE.start_fifo_empty_#in~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (<= (select .cse11 .cse17) 4) (<= (+ .cse4 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) 1) (= (select |c_#valid| .cse2) 1) (<= (select |c_ULTIMATE.start_#Ultimate.allocOnHeap_old_#length#1| |c_ULTIMATE.start_main_~#q~1#1.base|) 8) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|))))) is different from false [2022-10-03 15:25:10,376 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|)) (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_467 (Array Int Int)) (v_ArrVal_469 Int)) (let ((.cse3 (store (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_467))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_468)) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse2)) (not (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse2)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (= |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|)))) is different from false [2022-10-03 15:25:10,663 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse0)) (= |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_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_467 (Array Int Int)) (v_ArrVal_469 Int)) (let ((.cse2 (store (select (let ((.cse3 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_467))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_468)) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse1 |c_ULTIMATE.start_main_~#q~1#1.base|)) (not (= .cse1 (select .cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_main_~#p~0#1.base|)) (= .cse0 (select .cse4 (+ 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 15:25:10,947 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse4 |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|)) (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_467 (Array Int Int)) (v_ArrVal_469 Int)) (let ((.cse2 (store (select (let ((.cse3 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_467))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_468)) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|) (not (= .cse1 (select .cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (not (= .cse1 |c_ULTIMATE.start_main_~#q~1#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) (= .cse0 (select .cse4 (+ 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 15:25:11,275 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_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse3 (store (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_468) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse2)) (not (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse2)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (<= (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 15:25:11,608 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (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) (= |c_ULTIMATE.start_fifo_front_#in~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse3 (store (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_468) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse2)) (not (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse2)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (not (= |c_ULTIMATE.start_fifo_front_#in~self#1.base| .cse4)) (<= (select (select |c_#memory_$Pointer$.offset| .cse4) (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 15:25:11,937 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_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) (<= (select (select |c_#memory_$Pointer$.offset| .cse2) (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|) (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse4 (store (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_468) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse3)) (not (= (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse3)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (not (= |c_ULTIMATE.start_fifo_front_~self#1.base| .cse2)) (<= (+ .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 15:25:12,269 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) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse4 (store (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_468) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse3)) (not (= (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse3)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (<= (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_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= |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 15:25:12,601 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) (= |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|) (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse4 (store (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_468) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse3)) (not (= (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse3)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (<= (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_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= |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 15:25:12,936 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|)) (.cse4 (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) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse3 (store (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_468) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse2)) (not (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse2)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (<= |c_ULTIMATE.start_fifo_front_~self#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| .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#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|) (<= (+ .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| .cse4))))) is different from false [2022-10-03 15:25:13,266 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_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) (<= (select (select |c_#memory_$Pointer$.offset| .cse2) (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|) (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse4 (store (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_468) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse3)) (not (= (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse3)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (<= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (not (= |c_ULTIMATE.start_fifo_front_~self#1.base| .cse2)) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_fifo_front_~self#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 15:25:14,259 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) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse3 (store (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_468) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse2)) (not (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse2)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (<= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= |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|)))) is different from false [2022-10-03 15:25:14,591 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) (<= (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|) (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse3 (store (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_468) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse2)) (not (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse2)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (<= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|)))) is different from false [2022-10-03 15:25:14,929 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) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse3 (store (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_468) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse2)) (not (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse2)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (<= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= |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|)))) is different from false [2022-10-03 15:25:15,260 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) (= |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|)) (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse3 (store (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_468) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse2)) (not (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse2)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (<= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|)))) is different from false [2022-10-03 15:25:15,590 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) (= .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|) (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse3 (store (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_468) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse2)) (not (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse2)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (<= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (<= (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|)))) is different from false [2022-10-03 15:25:15,922 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) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse3 (store (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_468) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse2)) (not (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse2)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (<= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= .cse0 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|)))) is different from false [2022-10-03 15:25:16,252 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) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse3 (store (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_468) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse2)) (not (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse2)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (<= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= |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|)))) is different from false [2022-10-03 15:25:16,581 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) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse3 (store (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_468) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse2)) (not (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse2)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (<= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (<= |c_ULTIMATE.start_fifo_empty_#t~mem8#1.offset| 4) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|)))) is different from false [2022-10-03 15:25:16,916 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) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse3 (store (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_468) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse2)) (not (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse2)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (<= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#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|)) 4) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|)))) is different from false [2022-10-03 15:25:17,378 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_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse4 (store (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_468) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse3)) (not (= .cse3 (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (<= (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 15:25:17,730 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) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse4 (store (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_468) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse3)) (not (= .cse3 (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (<= (+ .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 15:25:18,105 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) (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse6 (store (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_468) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (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|)))) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse5)))))) (= |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_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= (+ .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 15:25:28,007 WARN L233 SmtUtils]: Spent 7.69s on a formula simplification. DAG size of input: 58 DAG size of output: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 15:25:36,971 WARN L233 SmtUtils]: Spent 8.75s on a formula simplification. DAG size of input: 72 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 15:25:44,350 WARN L233 SmtUtils]: Spent 7.13s on a formula simplification. DAG size of input: 62 DAG size of output: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 15:25:52,839 WARN L233 SmtUtils]: Spent 8.28s on a formula simplification. DAG size of input: 67 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 15:26:01,887 WARN L233 SmtUtils]: Spent 8.84s on a formula simplification. DAG size of input: 69 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 15:26:06,781 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse8 (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse3 (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse7 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse4 (select .cse12 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse2 (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse1 (select .cse12 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse5 (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse9 (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|))) (and (= .cse0 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| .cse1) (= |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| .cse2) (<= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) 8) (not (= .cse5 |c_ULTIMATE.start_main_~#q~1#1.base|)) (= .cse2 |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) (<= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| 4) (= .cse5 (select .cse6 .cse7)) (<= (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) (<= (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) (= .cse5 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) (<= |c_ULTIMATE.start_fifo_pop_#t~mem41#1.offset| 4) (<= |c_ULTIMATE.start_write~$Pointer$_#value#1.offset| 8) (= .cse0 |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) (= .cse3 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) (= (select .cse8 .cse7) .cse2) (= |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| .cse4) (<= (+ 2 .cse2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= .cse9 |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse5) .cse1)) (= .cse5 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|)) (<= (+ .cse5 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= .cse9 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset|) (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse11 (store (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_468) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse10)) (not (= .cse10 (select .cse11 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (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 15:26:07,259 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.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_write~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= |c_ULTIMATE.start_write~$Pointer$_#value#1.offset| 8) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) (= (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse0) (<= (+ 2 .cse0) |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|) (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse3 (store (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_468) |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse2)) (not (= .cse2 (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (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 15:26:07,586 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (<= (select (select |c_#memory_$Pointer$.offset| (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) 8) (= .cse1 (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse2)) (not (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse2)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= (+ .cse1 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 15:26:07,910 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (<= (select (select |c_#memory_$Pointer$.offset| (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) 8) (= .cse1 (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse2)) (not (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse2)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (= |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|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= (+ .cse1 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 15:26:08,242 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse2 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (<= (select (select |c_#memory_$Pointer$.offset| (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) 8) (= .cse2 (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse4 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse3)) (not (= (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse3)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= (+ .cse2 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 15:26:08,573 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse2 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (<= (select (select |c_#memory_$Pointer$.offset| (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) 8) (= .cse2 (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse4 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse3)) (not (= (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse3)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (= (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_ULTIMATE.start_fifo_pop_#t~mem43#1.offset|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= (+ .cse2 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 15:26:08,905 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 |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse2 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (<= (select (select |c_#memory_$Pointer$.offset| (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) 8) (= .cse2 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse4 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse3)) (not (= (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse3)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= (+ .cse2 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 15:26:09,236 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| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) 8) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse2)) (not (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse2)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (= |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|) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|)))) is different from false [2022-10-03 15:26:09,595 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| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) |c_ULTIMATE.start_read~$Pointer$_#value#1.offset|) 8) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |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|)) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse2)) (not (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse2)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|)))) is different from false [2022-10-03 15:26:09,972 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) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse2)) (not (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse2)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (<= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem48#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem48#1.offset|) 8) (= .cse0 |c_ULTIMATE.start_fifo_pop_#t~mem48#1.base|) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_pop_#t~mem48#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))))) is different from false [2022-10-03 15:26:10,300 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|)) (<= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) 8) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse2)) (not (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse2)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (= .cse0 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|)))) is different from false [2022-10-03 15:26:10,623 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) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse2)) (not (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse2)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (<= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| 8) (= |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|)))) is different from false [2022-10-03 15:26:10,949 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) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse2)) (not (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse2)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (= (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_pop_#t~mem50#1.offset|) (<= |c_ULTIMATE.start_fifo_pop_#t~mem50#1.offset| 8) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|)))) is different from false [2022-10-03 15:26:11,278 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) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_469 Int)) (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_469))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse2)) (not (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse2)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34|))))) (<= (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|)) 8) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|)))) is different from false [2022-10-03 15:26:43,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:26:43,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-10-03 15:26:43,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-10-03 15:26:43,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2022-10-03 15:26:43,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2022-10-03 15:26:43,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-10-03 15:26:43,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2022-10-03 15:26:43,723 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 15:26:43,914 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,SelfDestructingSolverStorable6 [2022-10-03 15:26:43,914 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:26:43,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:26:43,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1905799689, now seen corresponding path program 1 times [2022-10-03 15:26:43,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:26:43,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038265757] [2022-10-03 15:26:43,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:26:43,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:26:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:26:44,396 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2022-10-03 15:26:44,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:26:44,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038265757] [2022-10-03 15:26:44,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038265757] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:26:44,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:26:44,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-10-03 15:26:44,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205891357] [2022-10-03 15:26:44,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:26:44,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-10-03 15:26:44,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:26:44,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-10-03 15:26:44,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-10-03 15:26:44,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:26:44,399 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:26:44,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 37.04761904761905) internal successors, (778), 21 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:26:44,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:26:44,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-10-03 15:26:44,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-10-03 15:26:44,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 126 states. [2022-10-03 15:26:44,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 144 states. [2022-10-03 15:26:44,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-10-03 15:26:44,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 207 states. [2022-10-03 15:26:44,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:26:50,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:26:50,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-10-03 15:26:50,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-10-03 15:26:50,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2022-10-03 15:26:50,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2022-10-03 15:26:50,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-10-03 15:26:50,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2022-10-03 15:26:50,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-10-03 15:26:50,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-03 15:26:50,165 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:26:50,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:26:50,166 INFO L85 PathProgramCache]: Analyzing trace with hash 929854798, now seen corresponding path program 1 times [2022-10-03 15:26:50,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:26:50,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871249709] [2022-10-03 15:26:50,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:26:50,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:26:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:27:00,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1228 backedges. 806 proven. 343 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-10-03 15:27:00,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:27:00,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871249709] [2022-10-03 15:27:00,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871249709] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:27:00,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705949916] [2022-10-03 15:27:00,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:27:00,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:27:00,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:27:00,450 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 15:27:00,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-03 15:27:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:27:01,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 3887 conjuncts, 244 conjunts are in the unsatisfiable core [2022-10-03 15:27:01,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:27:03,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-03 15:27:03,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-03 15:27:07,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:27:07,065 INFO L356 Elim1Store]: treesize reduction 104, result has 14.0 percent of original size [2022-10-03 15:27:07,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 74 treesize of output 51 [2022-10-03 15:27:07,075 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-10-03 15:27:07,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2022-10-03 15:27:07,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:27:07,083 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 28 treesize of output 18 [2022-10-03 15:27:10,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:27:10,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 53 [2022-10-03 15:27:10,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:27:10,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 53 [2022-10-03 15:27:10,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-10-03 15:27:11,319 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-10-03 15:27:11,319 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 17 treesize of output 17 [2022-10-03 15:27:12,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:27:12,486 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 40 treesize of output 33 [2022-10-03 15:27:12,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:27:12,490 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 41 treesize of output 34 [2022-10-03 15:27:14,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2022-10-03 15:27:14,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-10-03 15:27:14,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1228 backedges. 360 proven. 418 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2022-10-03 15:27:14,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 15:27:19,874 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 10 treesize of output 8 [2022-10-03 15:27:24,902 WARN L833 $PredicateComparison]: unable to prove that (or (not (<= 0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (and (forall ((v_ArrVal_702 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (< (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_702) |c_ULTIMATE.start_fifo_pop_~self#1.base|) .cse0) 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|))) (store .cse1 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| (select .cse1 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset|)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) .cse0))))) (forall ((v_ArrVal_702 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_702) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))) (not (<= 0 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset|)) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|))) (store .cse2 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| (select .cse2 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset|)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_pop_~self#1.base|)) is different from false [2022-10-03 15:27:25,276 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (or (not (<= 0 .cse0)) (not (<= 0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse1 (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse1))) (store .cse2 .cse0 (select .cse2 .cse0))))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (and (forall ((v_ArrVal_702 (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (< (+ 3 (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_702) |c_ULTIMATE.start_fifo_pop_~self#1.base|) .cse4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse3)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store .cse5 .cse6 (select .cse5 .cse6)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) .cse4))))) (forall ((v_ArrVal_702 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) v_ArrVal_702) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) is different from false [2022-10-03 15:27:25,782 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:27:25,784 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 84 treesize of output 88 [2022-10-03 15:27:30,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1228 backedges. 380 proven. 32 refuted. 0 times theorem prover too weak. 816 trivial. 0 not checked. [2022-10-03 15:27:30,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705949916] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 15:27:30,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 15:27:30,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [128, 71, 59] total 256 [2022-10-03 15:27:30,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197594135] [2022-10-03 15:27:30,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 15:27:30,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 256 states [2022-10-03 15:27:30,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:27:30,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 256 interpolants. [2022-10-03 15:27:30,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1118, Invalid=63076, Unknown=76, NotChecked=1010, Total=65280 [2022-10-03 15:27:30,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:27:30,280 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:27:30,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 256 states, 256 states have (on average 14.16796875) internal successors, (3627), 256 states have internal predecessors, (3627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:27:30,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:27:30,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-10-03 15:27:30,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-10-03 15:27:30,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 126 states. [2022-10-03 15:27:30,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 144 states. [2022-10-03 15:27:30,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-10-03 15:27:30,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 218 states. [2022-10-03 15:27:30,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-10-03 15:27:30,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Received shutdown request... [2022-10-03 15:33:49,550 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 15:33:49,553 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 15:33:49,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-10-03 15:33:49,600 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 15:33:49,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:33:49,754 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 607 known predicates. [2022-10-03 15:33:49,756 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-03 15:33:49,760 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-03 15:33:49,761 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT was TIMEOUT (1/2) [2022-10-03 15:33:49,762 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-03 15:33:49,762 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-03 15:33:49,764 INFO L202 PluginConnector]: Adding new model divinefifo_1w1r.line1267.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 03:33:49 BasicIcfg [2022-10-03 15:33:49,764 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-03 15:33:49,764 INFO L158 Benchmark]: Toolchain (without parser) took 803261.82ms. Allocated memory was 184.5MB in the beginning and 721.4MB in the end (delta: 536.9MB). Free memory was 135.3MB in the beginning and 392.1MB in the end (delta: -256.7MB). Peak memory consumption was 591.3MB. Max. memory is 8.0GB. [2022-10-03 15:33:49,764 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 184.5MB. Free memory is still 141.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-03 15:33:49,764 INFO L158 Benchmark]: Boogie Preprocessor took 101.77ms. Allocated memory is still 184.5MB. Free memory was 135.3MB in the beginning and 129.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-10-03 15:33:49,765 INFO L158 Benchmark]: RCFGBuilder took 1190.62ms. Allocated memory was 184.5MB in the beginning and 275.8MB in the end (delta: 91.2MB). Free memory was 128.9MB in the beginning and 236.1MB in the end (delta: -107.2MB). Peak memory consumption was 46.3MB. Max. memory is 8.0GB. [2022-10-03 15:33:49,765 INFO L158 Benchmark]: TraceAbstraction took 801962.15ms. Allocated memory was 275.8MB in the beginning and 721.4MB in the end (delta: 445.6MB). Free memory was 235.5MB in the beginning and 392.1MB in the end (delta: -156.5MB). Peak memory consumption was 599.5MB. Max. memory is 8.0GB. [2022-10-03 15:33:49,765 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.14ms. Allocated memory is still 184.5MB. Free memory is still 141.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 101.77ms. Allocated memory is still 184.5MB. Free memory was 135.3MB in the beginning and 129.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1190.62ms. Allocated memory was 184.5MB in the beginning and 275.8MB in the end (delta: 91.2MB). Free memory was 128.9MB in the beginning and 236.1MB in the end (delta: -107.2MB). Peak memory consumption was 46.3MB. Max. memory is 8.0GB. * TraceAbstraction took 801962.15ms. Allocated memory was 275.8MB in the beginning and 721.4MB in the end (delta: 445.6MB). Free memory was 235.5MB in the beginning and 392.1MB in the end (delta: -156.5MB). Peak memory consumption was 599.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 267, positive: 257, positive conditional: 257, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 28570, positive: 27621, positive conditional: 27621, positive unconditional: 0, negative: 949, negative conditional: 949, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27621, positive: 27621, positive conditional: 0, positive unconditional: 27621, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2459, positive: 2459, positive conditional: 0, positive unconditional: 2459, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 27621, positive: 25162, positive conditional: 0, positive unconditional: 25162, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2459, unknown conditional: 0, unknown unconditional: 2459] , Statistics on independence cache: Total cache size (in pairs): 257, Positive cache size: 257, Positive conditional cache size: 0, Positive unconditional cache size: 257, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 10, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 897, positive: 869, positive conditional: 869, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 28570, positive: 27621, positive conditional: 27621, positive unconditional: 0, negative: 949, negative conditional: 949, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27621, positive: 27621, positive conditional: 0, positive unconditional: 27621, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2459, positive: 2459, positive conditional: 0, positive unconditional: 2459, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 27621, positive: 25162, positive conditional: 0, positive unconditional: 25162, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2459, unknown conditional: 0, unknown unconditional: 2459] , Statistics on independence cache: Total cache size (in pairs): 871, Positive cache size: 871, Positive conditional cache size: 0, Positive unconditional cache size: 871, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 38, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1148, positive: 1108, positive conditional: 1108, positive unconditional: 0, negative: 40, negative conditional: 40, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 28570, positive: 27621, positive conditional: 27621, positive unconditional: 0, negative: 949, negative conditional: 949, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27621, positive: 27621, positive conditional: 0, positive unconditional: 27621, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2459, positive: 2459, positive conditional: 0, positive unconditional: 2459, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 27621, positive: 25162, positive conditional: 0, positive unconditional: 25162, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2459, unknown conditional: 0, unknown unconditional: 2459] , Statistics on independence cache: Total cache size (in pairs): 1119, Positive cache size: 1119, Positive conditional cache size: 0, Positive unconditional cache size: 1119, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 78, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2383, positive: 2306, positive conditional: 2306, positive unconditional: 0, negative: 77, negative conditional: 77, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 28570, positive: 27621, positive conditional: 27621, positive unconditional: 0, negative: 949, negative conditional: 949, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27621, positive: 27621, positive conditional: 0, positive unconditional: 27621, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2459, positive: 2459, positive conditional: 0, positive unconditional: 2459, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 27621, positive: 25162, positive conditional: 0, positive unconditional: 25162, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2459, unknown conditional: 0, unknown unconditional: 2459] , Statistics on independence cache: Total cache size (in pairs): 2013, Positive cache size: 2013, Positive conditional cache size: 0, Positive unconditional cache size: 2013, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 155, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2117, positive: 2047, positive conditional: 2047, positive unconditional: 0, negative: 70, negative conditional: 70, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 28570, positive: 27621, positive conditional: 27621, positive unconditional: 0, negative: 949, negative conditional: 949, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27621, positive: 27621, positive conditional: 0, positive unconditional: 27621, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2459, positive: 2459, positive conditional: 0, positive unconditional: 2459, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 27621, positive: 25162, positive conditional: 0, positive unconditional: 25162, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2459, unknown conditional: 0, unknown unconditional: 2459] , Statistics on independence cache: Total cache size (in pairs): 2030, Positive cache size: 2030, Positive conditional cache size: 0, Positive unconditional cache size: 2030, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 225, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3650, positive: 3529, positive conditional: 3529, positive unconditional: 0, negative: 121, negative conditional: 121, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 28570, positive: 27621, positive conditional: 27621, positive unconditional: 0, negative: 949, negative conditional: 949, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27621, positive: 27621, positive conditional: 0, positive unconditional: 27621, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2459, positive: 2459, positive conditional: 0, positive unconditional: 2459, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 27621, positive: 25162, positive conditional: 0, positive unconditional: 25162, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2459, unknown conditional: 0, unknown unconditional: 2459] , Statistics on independence cache: Total cache size (in pairs): 2327, Positive cache size: 2327, Positive conditional cache size: 0, Positive unconditional cache size: 2327, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 346, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4823, positive: 4665, positive conditional: 4665, positive unconditional: 0, negative: 158, negative conditional: 158, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 28570, positive: 27621, positive conditional: 27621, positive unconditional: 0, negative: 949, negative conditional: 949, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27621, positive: 27621, positive conditional: 0, positive unconditional: 27621, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2459, positive: 2459, positive conditional: 0, positive unconditional: 2459, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 27621, positive: 25162, positive conditional: 0, positive unconditional: 25162, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2459, unknown conditional: 0, unknown unconditional: 2459] , Statistics on independence cache: Total cache size (in pairs): 2337, Positive cache size: 2337, Positive conditional cache size: 0, Positive unconditional cache size: 2337, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 504, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3913, positive: 3782, positive conditional: 3782, positive unconditional: 0, negative: 131, negative conditional: 131, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 28570, positive: 27621, positive conditional: 27621, positive unconditional: 0, negative: 949, negative conditional: 949, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27621, positive: 27621, positive conditional: 0, positive unconditional: 27621, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2459, positive: 2459, positive conditional: 0, positive unconditional: 2459, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 27621, positive: 25162, positive conditional: 0, positive unconditional: 25162, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2459, unknown conditional: 0, unknown unconditional: 2459] , Statistics on independence cache: Total cache size (in pairs): 2392, Positive cache size: 2392, Positive conditional cache size: 0, Positive unconditional cache size: 2392, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 635, Statistics for Abstraction: - StatisticsResult: Independence relation #9 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 5947, positive: 5748, positive conditional: 5748, positive unconditional: 0, negative: 199, negative conditional: 199, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 28570, positive: 27621, positive conditional: 27621, positive unconditional: 0, negative: 949, negative conditional: 949, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27621, positive: 27621, positive conditional: 0, positive unconditional: 27621, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2459, positive: 2459, positive conditional: 0, positive unconditional: 2459, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 27621, positive: 25162, positive conditional: 0, positive unconditional: 25162, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2459, unknown conditional: 0, unknown unconditional: 2459] , Statistics on independence cache: Total cache size (in pairs): 2412, Positive cache size: 2412, Positive conditional cache size: 0, Positive unconditional cache size: 2412, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 834, Statistics for Abstraction: - StatisticsResult: Independence relation #10 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3425, positive: 3310, positive conditional: 3310, positive unconditional: 0, negative: 115, negative conditional: 115, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 28570, positive: 27621, positive conditional: 27621, positive unconditional: 0, negative: 949, negative conditional: 949, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27621, positive: 27621, positive conditional: 0, positive unconditional: 27621, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2459, positive: 2459, positive conditional: 0, positive unconditional: 2459, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 27621, positive: 25162, positive conditional: 0, positive unconditional: 25162, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2459, unknown conditional: 0, unknown unconditional: 2459] , Statistics on independence cache: Total cache size (in pairs): 2459, Positive cache size: 2459, Positive conditional cache size: 0, Positive unconditional cache size: 2459, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 949, Statistics for Abstraction: - TimeoutResultAtElement [Line: 1267]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 607 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 3 procedures, 1438 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 801.8s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 693.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 1065, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 105.3s InterpolantComputationTime, 10650 NumberOfCodeBlocks, 10650 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 13457 ConstructedInterpolants, 963 QuantifiedInterpolants, 256367 SizeOfPredicates, 306 NumberOfNonLiveVariables, 6840 ConjunctsInSsa, 503 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 4155/5739 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown