/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -i ../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo-bug_1w1r.line1600.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 14:50:20,104 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 14:50:20,106 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 14:50:20,131 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 14:50:20,132 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 14:50:20,133 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 14:50:20,134 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 14:50:20,135 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 14:50:20,136 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 14:50:20,137 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 14:50:20,138 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 14:50:20,139 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 14:50:20,139 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 14:50:20,140 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 14:50:20,141 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 14:50:20,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 14:50:20,142 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 14:50:20,143 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 14:50:20,144 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 14:50:20,146 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 14:50:20,147 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 14:50:20,148 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 14:50:20,149 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 14:50:20,150 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 14:50:20,153 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 14:50:20,153 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 14:50:20,153 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 14:50:20,154 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 14:50:20,154 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 14:50:20,155 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 14:50:20,155 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 14:50:20,156 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 14:50:20,157 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 14:50:20,157 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 14:50:20,158 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 14:50:20,158 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 14:50:20,159 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 14:50:20,159 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 14:50:20,159 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 14:50:20,160 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 14:50:20,161 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 14:50:20,161 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-03 14:50:20,182 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 14:50:20,182 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 14:50:20,182 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 14:50:20,183 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 14:50:20,183 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 14:50:20,183 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 14:50:20,184 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 14:50:20,184 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 14:50:20,184 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 14:50:20,184 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 14:50:20,185 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 14:50:20,185 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 14:50:20,185 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 14:50:20,185 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 14:50:20,185 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 14:50:20,185 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 14:50:20,185 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 14:50:20,185 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 14:50:20,185 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 14:50:20,186 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 14:50:20,186 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 14:50:20,186 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 14:50:20,186 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 14:50:20,186 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 14:50:20,186 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 14:50:20,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 14:50:20,186 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 14:50:20,187 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 14:50:20,187 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 14:50:20,187 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 14:50:20,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 14:50:20,187 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 14:50:20,187 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 14:50:20,187 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 14:50:20,187 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 14:50:20,188 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 14:50:20,188 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 14:50:20,188 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 14:50:20,188 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-03 14:50:20,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 14:50:20,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 14:50:20,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 14:50:20,388 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 14:50:20,389 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 14:50:20,390 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo-bug_1w1r.line1600.bpl [2022-10-03 14:50:20,390 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo-bug_1w1r.line1600.bpl' [2022-10-03 14:50:20,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 14:50:20,470 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 14:50:20,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 14:50:20,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 14:50:20,472 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 14:50:20,484 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1600.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:50:20" (1/1) ... [2022-10-03 14:50:20,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1600.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:50:20" (1/1) ... [2022-10-03 14:50:20,525 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1600.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:50:20" (1/1) ... [2022-10-03 14:50:20,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1600.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:50:20" (1/1) ... [2022-10-03 14:50:20,596 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1600.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:50:20" (1/1) ... [2022-10-03 14:50:20,605 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1600.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:50:20" (1/1) ... [2022-10-03 14:50:20,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1600.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:50:20" (1/1) ... [2022-10-03 14:50:20,623 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 14:50:20,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 14:50:20,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 14:50:20,633 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 14:50:20,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo-bug_1w1r.line1600.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:50:20" (1/1) ... [2022-10-03 14:50:20,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 14:50:20,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:50:20,667 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-03 14:50:20,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-03 14:50:20,704 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-10-03 14:50:20,704 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-10-03 14:50:20,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 14:50:20,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 14:50:20,706 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-03 14:50:20,941 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 14:50:20,942 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 14:50:21,891 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 14:50:21,921 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 14:50:21,921 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-03 14:50:21,924 INFO L202 PluginConnector]: Adding new model divinefifo-bug_1w1r.line1600.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:50:21 BoogieIcfgContainer [2022-10-03 14:50:21,924 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 14:50:21,926 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 14:50:21,926 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 14:50:21,933 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 14:50:21,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line1600.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:50:20" (1/2) ... [2022-10-03 14:50:21,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729a25b8 and model type divinefifo-bug_1w1r.line1600.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:50:21, skipping insertion in model container [2022-10-03 14:50:21,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line1600.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:50:21" (2/2) ... [2022-10-03 14:50:21,936 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo-bug_1w1r.line1600.bpl [2022-10-03 14:50:21,946 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 14:50:21,952 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 14:50:21,952 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 14:50:21,952 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 14:50:22,070 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-10-03 14:50:22,144 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 14:50:22,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 14:50:22,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:50:22,151 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-03 14:50:22,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-10-03 14:50:22,199 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 14:50:22,212 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 14:50:22,222 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;@1e691193, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 14:50:22,222 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 14:50:22,722 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:50:22,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:50:22,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1307499275, now seen corresponding path program 1 times [2022-10-03 14:50:22,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:50:22,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906291885] [2022-10-03 14:50:22,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:50:22,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:50:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:50:23,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:50:23,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:50:23,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906291885] [2022-10-03 14:50:23,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906291885] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:50:23,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:50:23,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 14:50:23,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243114157] [2022-10-03 14:50:23,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:50:23,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 14:50:23,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:50:23,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 14:50:23,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 14:50:23,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:50:23,346 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:50:23,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 370.0) internal successors, (740), 2 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:50:23,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:50:23,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:50:23,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 14:50:23,608 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:50:23,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:50:23,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1145809504, now seen corresponding path program 1 times [2022-10-03 14:50:23,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:50:23,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134398652] [2022-10-03 14:50:23,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:50:23,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:50:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:50:24,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:50:24,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:50:24,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134398652] [2022-10-03 14:50:24,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134398652] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:50:24,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:50:24,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-10-03 14:50:24,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280691864] [2022-10-03 14:50:24,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:50:24,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-10-03 14:50:24,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:50:24,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-10-03 14:50:24,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-10-03 14:50:24,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:50:24,987 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:50:24,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 50.3125) internal successors, (805), 17 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:50:24,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:50:24,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:50:27,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:50:27,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-10-03 14:50:27,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 14:50:27,560 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:50:27,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:50:27,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1278597077, now seen corresponding path program 1 times [2022-10-03 14:50:27,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:50:27,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923362249] [2022-10-03 14:50:27,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:50:27,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:50:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:50:28,416 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 250 proven. 41 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-03 14:50:28,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:50:28,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923362249] [2022-10-03 14:50:28,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923362249] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:50:28,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640093915] [2022-10-03 14:50:28,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:50:28,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:50:28,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:50:28,421 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 14:50:28,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-03 14:50:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:50:29,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 2868 conjuncts, 277 conjunts are in the unsatisfiable core [2022-10-03 14:50:29,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:50:29,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-03 14:50:31,114 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 14:50:31,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-03 14:50:31,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2022-10-03 14:50:34,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:50:34,935 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 34 treesize of output 25 [2022-10-03 14:50:37,186 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 14:50:37,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 34 [2022-10-03 14:50:38,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:50:38,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 28 [2022-10-03 14:50:38,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-10-03 14:50:39,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:50:39,845 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 34 treesize of output 27 [2022-10-03 14:50:40,567 INFO L356 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-10-03 14:50:40,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 20 [2022-10-03 14:50:42,004 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:50:42,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 17 [2022-10-03 14:50:42,217 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 214 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:50:42,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 14:50:44,771 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 22 treesize of output 14 [2022-10-03 14:50:46,184 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_318 (Array Int Int))) (let ((.cse0 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_318) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) is different from false [2022-10-03 14:50:46,198 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| Int)) (or (forall ((v_ArrVal_318 (Array Int Int))) (let ((.cse0 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| v_ArrVal_318) |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|)))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|)))) is different from false [2022-10-03 14:50:46,215 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| Int) (v_ArrVal_318 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|)) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| v_ArrVal_318) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) is different from false [2022-10-03 14:50:46,273 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| Int) (v_ArrVal_318 (Array Int Int))) (or (< |c_ULTIMATE.start_read~$Pointer$_#value#1.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46|) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| v_ArrVal_318) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) is different from false [2022-10-03 14:50:46,281 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| Int) (v_ArrVal_318 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46|) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| v_ArrVal_318) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) is different from false [2022-10-03 14:50:46,301 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| Int) (v_ArrVal_318 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46|) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| v_ArrVal_318) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) is different from false [2022-10-03 14:50:48,701 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| Int) (v_ArrVal_318 (Array Int Int)) (v_ArrVal_317 Int)) (let ((.cse4 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| v_ArrVal_317)))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse0 (select .cse1 .cse2))) (< .cse0 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46|) (let ((.cse3 (select (store .cse4 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| v_ArrVal_318) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse3 .cse2) (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|)))))))) is different from false [2022-10-03 14:50:48,733 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| Int) (v_ArrVal_318 (Array Int Int)) (v_ArrVal_317 Int)) (let ((.cse4 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_317)))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse0 (select .cse1 .cse2))) (let ((.cse3 (select (store .cse4 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| v_ArrVal_318) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse3 .cse2))) (< .cse0 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46|)))))) is different from false [2022-10-03 14:50:48,751 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| Int) (v_ArrVal_318 (Array Int Int)) (v_ArrVal_317 Int)) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_317)))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse0 (select .cse1 .cse2))) (let ((.cse3 (select (store .cse4 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| v_ArrVal_318) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse3 .cse2) (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (< .cse0 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46|)))))) is different from false [2022-10-03 14:50:48,948 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| Int) (v_ArrVal_318 (Array Int Int)) (v_ArrVal_317 Int)) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset| v_ArrVal_317)))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse2 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse0 .cse1) .cse2)) (let ((.cse3 (select (store .cse4 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| v_ArrVal_318) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse3 .cse1))) (< .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46|)))))) is different from false [2022-10-03 14:50:48,965 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| Int) (v_ArrVal_318 (Array Int Int)) (v_ArrVal_317 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset| v_ArrVal_317)))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< .cse0 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46|) (let ((.cse1 (select (store .cse3 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| v_ArrVal_318) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse1 .cse2))) (not (= .cse0 (select .cse4 .cse2)))))))) is different from false [2022-10-03 14:50:50,315 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| Int) (v_ArrVal_318 (Array Int Int)) (v_ArrVal_317 Int)) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_#in~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_#in~self#1.base|) |c_ULTIMATE.start_fifo_front_#in~self#1.offset| v_ArrVal_317)))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse0 (select .cse1 .cse2))) (let ((.cse3 (select (store .cse4 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| v_ArrVal_318) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse3 .cse2))) (< .cse0 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46|)))))) is different from false [2022-10-03 14:50:50,352 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| Int) (v_ArrVal_318 (Array Int Int))) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse3 (select .cse2 .cse1))) (or (let ((.cse0 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse3)) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| v_ArrVal_318) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse0 .cse1) (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (< .cse3 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46|))))) is different from false [2022-10-03 14:50:50,401 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| Int) (v_ArrVal_318 (Array Int Int))) (let ((.cse3 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_315))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse0 (select .cse4 .cse2))) (or (< .cse0 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46|) (let ((.cse1 (select (store (store .cse3 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse0)) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| v_ArrVal_318) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse1 .cse2) (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|)))))))) is different from false [2022-10-03 14:50:50,428 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| Int) (v_ArrVal_318 (Array Int Int))) (let ((.cse2 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_315))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse4 (select .cse3 .cse1))) (or (let ((.cse0 (select (store (store .cse2 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse4)) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| v_ArrVal_318) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse0 .cse1))) (< .cse4 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46|)))))) is different from false [2022-10-03 14:50:50,440 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| Int) (v_ArrVal_318 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_315))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse0 (select .cse4 .cse2))) (or (< .cse0 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46|) (let ((.cse1 (select (store (store .cse3 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse0)) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| v_ArrVal_318) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse1 .cse2) (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|)))))))) is different from false [2022-10-03 14:50:50,460 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| Int) (v_ArrVal_318 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_315))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse4 (select .cse3 .cse1))) (or (let ((.cse0 (select (store (store .cse2 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse4)) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| v_ArrVal_318) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse0 .cse1))) (< .cse4 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46|)))))) is different from false [2022-10-03 14:50:52,963 INFO L356 Elim1Store]: treesize reduction 34, result has 59.0 percent of original size [2022-10-03 14:50:52,963 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 211 treesize of output 183 [2022-10-03 14:50:53,008 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:50:53,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 119 treesize of output 160 [2022-10-03 14:50:53,026 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 38 treesize of output 26 [2022-10-03 14:50:53,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-03 14:50:54,086 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:50:54,087 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 71 treesize of output 225 [2022-10-03 14:50:55,921 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 214 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 56 not checked. [2022-10-03 14:50:55,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640093915] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 14:50:55,921 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 14:50:55,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 99, 87] total 197 [2022-10-03 14:50:55,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175879058] [2022-10-03 14:50:55,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 14:50:55,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 197 states [2022-10-03 14:50:55,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:50:55,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 197 interpolants. [2022-10-03 14:50:55,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=31308, Unknown=31, NotChecked=6324, Total=38612 [2022-10-03 14:50:55,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:50:55,939 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:50:55,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 197 states, 197 states have (on average 15.883248730964468) internal successors, (3129), 197 states have internal predecessors, (3129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:50:55,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:50:55,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-10-03 14:50:55,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:51:23,428 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| Int) (v_ArrVal_318 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46|) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| v_ArrVal_318) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_pusherThread1of1ForFork0_#in~q_#1.offset|) (<= (+ 2 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|))) (= (select .cse1 |c_ULTIMATE.start_fifo_empty_~self#1.offset|) (select .cse1 (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4)))) (<= (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 8) (select |c_#length| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) is different from false [2022-10-03 14:51:23,604 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| Int) (v_ArrVal_318 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46|) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| v_ArrVal_318) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_pusherThread1of1ForFork0_#in~q_#1.offset|) (<= 8 (select |c_#length| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse1 .cse2))) (<= (+ 2 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse2)) |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0))) is different from false [2022-10-03 14:51:23,700 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (and (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_pusherThread1of1ForFork0_#in~q_#1.offset|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= 8 (select |c_#length| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 .cse1))) (<= (+ 2 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse1)) |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| Int) (v_ArrVal_318 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46|) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| v_ArrVal_318) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse2 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))))) is different from false [2022-10-03 14:51:23,707 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| Int) (v_ArrVal_318 (Array Int Int))) (or (< |c_ULTIMATE.start_read~$Pointer$_#value#1.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46|) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| v_ArrVal_318) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) (<= |c_ULTIMATE.start_read~$Pointer$_#value#1.base| .cse1) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_pusherThread1of1ForFork0_#in~q_#1.offset|) (<= 8 (select |c_#length| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (= .cse1 (select .cse2 .cse3)) (<= (+ 2 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse3)) |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0)))) is different from false [2022-10-03 14:51:23,711 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| Int) (v_ArrVal_318 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|)) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| v_ArrVal_318) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) (<= |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| .cse1) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_pusherThread1of1ForFork0_#in~q_#1.offset|) (<= 8 (select |c_#length| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (= .cse1 (select .cse2 .cse3)) (<= (+ 2 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse3)) |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0)))) is different from false [2022-10-03 14:51:23,721 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse0 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (and (<= |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| .cse0) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (<= (+ 2 (select (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse1)) |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_pusherThread1of1ForFork0_#in~q_#1.offset|) (<= 8 (select |c_#length| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| Int)) (or (forall ((v_ArrVal_318 (Array Int Int))) (let ((.cse2 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| v_ArrVal_318) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse2 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|)))) (= (select .cse3 .cse1) .cse0)))) is different from false [2022-10-03 14:51:43,423 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse8 (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4)) (.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|)) (.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse2 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse1 (select .cse10 |c_ULTIMATE.start_fifo_empty_~self#1.offset|)) (.cse4 (select .cse10 .cse8)) (.cse5 (select .cse9 .cse3)) (.cse0 (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 8)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse3))) (and (<= .cse0 (+ |c_ULTIMATE.start_read~$Pointer$_#sizeOfReadType#1| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| .cse1) (= |c_ULTIMATE.start_fifo_empty_#in~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| .cse2) (= |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| 0) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| .cse3) (forall ((v_ArrVal_320 Int)) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_320)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) |c_ULTIMATE.start_read~$Pointer$_#value#1.base|)) (forall ((v_ArrVal_320 Int)) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_320)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (= |c_ULTIMATE.start_fifo_empty_#t~mem5#1.base| .cse4) (<= (+ 2 .cse5) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= (select |c_ULTIMATE.start_ULTIMATE.dealloc_old_#valid#1| .cse6) 0) (= .cse5 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_empty_#t~mem5#1.base| .cse5) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| Int) (v_ArrVal_318 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46|) (let ((.cse7 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| v_ArrVal_318) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse7 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| .cse8) (<= |c_ULTIMATE.start_read~$Pointer$_#value#1.base| .cse2) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (<= 8 (select |c_#length| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|)) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_pusherThread1of1ForFork0_#in~q_#1.offset|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= .cse2 .cse5) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_fifo_empty_#in~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| (select .cse9 (+ |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| (- 4)))) (<= (+ 2 .cse6) |c_pusherThread1of1ForFork0_#in~q_#1.base|) (<= 8 (select |c_#length| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|)) (= .cse1 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= .cse1 .cse4) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.base| .cse4) (= (select |c_#valid| .cse5) 0) (<= .cse0 (select |c_#length| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|)) (= (select |c_#valid| .cse6) 0)))) is different from false [2022-10-03 14:51:43,772 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse3 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (let ((.cse0 (select .cse2 .cse3))) (and (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| 0) (<= (+ 2 .cse0) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| Int) (v_ArrVal_318 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46|) (let ((.cse1 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| v_ArrVal_318) |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|))))) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_pusherThread1of1ForFork0_#in~q_#1.offset|) (= (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) .cse0) (<= (+ 2 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse3)) |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|))) (= (select .cse4 |c_ULTIMATE.start_fifo_empty_~self#1.offset|) (select .cse4 (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4)))) (= (select |c_#valid| .cse0) 0) (<= (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 8) (select |c_#length| |c_ULTIMATE.start_fifo_pop_~self#1.base|))))) is different from false [2022-10-03 14:51:43,853 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse3 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (let ((.cse0 (select .cse2 .cse3))) (and (<= (+ 2 .cse0) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| Int) (v_ArrVal_318 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46|) (let ((.cse1 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| v_ArrVal_318) |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|))))) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_pusherThread1of1ForFork0_#in~q_#1.offset|) (<= 8 (select |c_#length| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (= (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) .cse0) (<= (+ 2 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse3)) |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= (select |c_#valid| .cse0) 0)))) is different from false [2022-10-03 14:51:43,867 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|)) (.cse3 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (let ((.cse0 (select .cse1 .cse3))) (and (<= (+ .cse0 2) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) .cse0) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_pusherThread1of1ForFork0_#in~q_#1.offset|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= 8 (select |c_#length| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse2 .cse3))) (<= (+ 2 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse3)) |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| Int) (v_ArrVal_318 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46|) (let ((.cse4 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| v_ArrVal_318) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse4 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) (= (select |c_#valid| .cse0) 0)))) is different from false [2022-10-03 14:51:43,871 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| Int) (v_ArrVal_318 (Array Int Int))) (or (< |c_ULTIMATE.start_read~$Pointer$_#value#1.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46|) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| v_ArrVal_318) |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|))))) (= (select |c_#valid| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) 0) (<= |c_ULTIMATE.start_read~$Pointer$_#value#1.base| .cse1) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_pusherThread1of1ForFork0_#in~q_#1.offset|) (<= 8 (select |c_#length| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (= .cse1 (select .cse2 .cse3)) (<= (+ 2 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse3)) |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0)))) is different from false [2022-10-03 14:51:43,875 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| Int) (v_ArrVal_318 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|)) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| v_ArrVal_318) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) (<= |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| .cse1) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_pusherThread1of1ForFork0_#in~q_#1.offset|) (<= 8 (select |c_#length| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (= .cse1 (select .cse2 .cse3)) (<= (+ 2 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse3)) |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) 0)))) is different from false [2022-10-03 14:51:43,878 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| Int) (v_ArrVal_318 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|)) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_46| v_ArrVal_318) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) (<= |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| .cse1) (= (select |c_#valid| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) 0) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_pusherThread1of1ForFork0_#in~q_#1.offset|) (<= 8 (select |c_#length| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (= .cse1 (select .cse2 .cse3)) (<= (+ 2 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse3)) |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0)))) is different from false [2022-10-03 14:51:44,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:51:44,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-10-03 14:51:44,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2022-10-03 14:51:44,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-10-03 14:51:44,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-10-03 14:51:44,296 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:51:44,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:51:44,296 INFO L85 PathProgramCache]: Analyzing trace with hash 623074551, now seen corresponding path program 2 times [2022-10-03 14:51:44,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:51:44,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650668004] [2022-10-03 14:51:44,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:51:44,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:51:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:51:45,125 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 154 proven. 41 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-10-03 14:51:45,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:51:45,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650668004] [2022-10-03 14:51:45,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650668004] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:51:45,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543874369] [2022-10-03 14:51:45,126 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-03 14:51:45,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:51:45,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:51:45,132 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 14:51:45,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-03 14:51:45,587 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-03 14:51:45,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-03 14:51:45,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 2106 conjuncts, 182 conjunts are in the unsatisfiable core [2022-10-03 14:51:45,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:51:46,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-03 14:51:46,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-03 14:51:46,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:51:46,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-03 14:51:46,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:51:46,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-03 14:51:46,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:51:46,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-03 14:51:46,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:51:46,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-10-03 14:51:48,440 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 14:51:48,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-03 14:51:48,899 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-10-03 14:51:48,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 61 [2022-10-03 14:51:48,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:51:48,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:51:48,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 44 [2022-10-03 14:51:52,209 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 14:51:52,228 INFO L356 Elim1Store]: treesize reduction 150, result has 10.2 percent of original size [2022-10-03 14:51:52,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 94 treesize of output 72 [2022-10-03 14:51:52,232 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 14:51:52,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:51:52,235 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-03 14:51:52,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 48 [2022-10-03 14:51:52,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:51:52,539 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 14:51:52,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-10-03 14:51:52,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:51:52,543 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 14:51:52,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-10-03 14:51:52,657 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2022-10-03 14:51:52,657 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-03 14:51:52,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543874369] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:51:52,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-03 14:51:52,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [12] total 61 [2022-10-03 14:51:52,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621434348] [2022-10-03 14:51:52,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:51:52,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-10-03 14:51:52,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:51:52,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-10-03 14:51:52,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=3424, Unknown=0, NotChecked=0, Total=3660 [2022-10-03 14:51:52,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:51:52,663 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:51:52,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 16.941176470588236) internal successors, (864), 51 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:51:52,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:51:52,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-10-03 14:51:52,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 176 states. [2022-10-03 14:51:52,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:52:03,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:52:03,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-03 14:52:03,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2022-10-03 14:52:03,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-10-03 14:52:03,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-03 14:52:03,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:52:03,810 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:52:03,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:52:03,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1346525389, now seen corresponding path program 1 times [2022-10-03 14:52:03,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:52:03,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697120589] [2022-10-03 14:52:03,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:52:03,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:52:04,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:52:04,607 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 50 proven. 81 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2022-10-03 14:52:04,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:52:04,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697120589] [2022-10-03 14:52:04,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697120589] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:52:04,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192598348] [2022-10-03 14:52:04,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:52:04,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:52:04,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:52:04,616 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 14:52:04,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-03 14:52:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:52:05,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 3326 conjuncts, 226 conjunts are in the unsatisfiable core [2022-10-03 14:52:05,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:52:06,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 treesize of output 3 [2022-10-03 14:52:06,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:52:06,721 INFO L356 Elim1Store]: treesize reduction 80, result has 17.5 percent of original size [2022-10-03 14:52:06,722 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 5 case distinctions, treesize of input 41 treesize of output 30 [2022-10-03 14:52:07,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:52:07,741 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 32 treesize of output 23 [2022-10-03 14:52:07,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-10-03 14:52:08,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:52:08,837 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 23 treesize of output 22 [2022-10-03 14:52:09,048 INFO L356 Elim1Store]: treesize reduction 46, result has 40.3 percent of original size [2022-10-03 14:52:09,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 42 [2022-10-03 14:52:10,869 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 333 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:52:10,869 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-03 14:52:10,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192598348] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:52:10,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-03 14:52:10,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [11] total 76 [2022-10-03 14:52:10,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474676637] [2022-10-03 14:52:10,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:52:10,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-10-03 14:52:10,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:52:10,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-10-03 14:52:10,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=5341, Unknown=0, NotChecked=0, Total=5700 [2022-10-03 14:52:10,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:52:10,874 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:52:10,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 19.90909090909091) internal successors, (1314), 66 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:52:10,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:52:10,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-10-03 14:52:10,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 200 states. [2022-10-03 14:52:10,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2022-10-03 14:52:10,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:52:22,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:52:22,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-03 14:52:22,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2022-10-03 14:52:22,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-10-03 14:52:22,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-10-03 14:52:22,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-03 14:52:22,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:52:22,905 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:52:22,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:52:22,906 INFO L85 PathProgramCache]: Analyzing trace with hash -536560073, now seen corresponding path program 2 times [2022-10-03 14:52:22,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:52:22,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728117869] [2022-10-03 14:52:22,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:52:22,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:52:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:52:23,780 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 154 proven. 81 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-10-03 14:52:23,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:52:23,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728117869] [2022-10-03 14:52:23,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728117869] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:52:23,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497004452] [2022-10-03 14:52:23,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-03 14:52:23,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:52:23,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:52:23,783 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 14:52:23,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-03 14:52:24,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-03 14:52:24,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-03 14:52:24,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 1874 conjuncts, 23 conjunts are in the unsatisfiable core [2022-10-03 14:52:24,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:52:24,680 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-10-03 14:52:24,681 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-03 14:52:24,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497004452] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:52:24,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-03 14:52:24,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 18 [2022-10-03 14:52:24,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407689759] [2022-10-03 14:52:24,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:52:24,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-03 14:52:24,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:52:24,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-03 14:52:24,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-10-03 14:52:24,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:52:24,684 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:52:24,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 150.625) internal successors, (1205), 9 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:52:24,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:52:24,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-10-03 14:52:24,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 200 states. [2022-10-03 14:52:24,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2022-10-03 14:52:24,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 101 states. [2022-10-03 14:52:24,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.