/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.line1290.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 14:33:03,395 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 14:33:03,397 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 14:33:03,434 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 14:33:03,434 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 14:33:03,435 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 14:33:03,436 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 14:33:03,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 14:33:03,439 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 14:33:03,439 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 14:33:03,440 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 14:33:03,441 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 14:33:03,441 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 14:33:03,442 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 14:33:03,443 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 14:33:03,444 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 14:33:03,444 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 14:33:03,445 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 14:33:03,446 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 14:33:03,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 14:33:03,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 14:33:03,450 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 14:33:03,451 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 14:33:03,452 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 14:33:03,455 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 14:33:03,455 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 14:33:03,455 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 14:33:03,456 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 14:33:03,456 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 14:33:03,459 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 14:33:03,459 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 14:33:03,460 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 14:33:03,461 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 14:33:03,461 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 14:33:03,462 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 14:33:03,462 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 14:33:03,463 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 14:33:03,463 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 14:33:03,463 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 14:33:03,464 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 14:33:03,464 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 14:33:03,465 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:33:03,484 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 14:33:03,484 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 14:33:03,484 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 14:33:03,485 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 14:33:03,485 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 14:33:03,485 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 14:33:03,486 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 14:33:03,486 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 14:33:03,486 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 14:33:03,486 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 14:33:03,487 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 14:33:03,487 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 14:33:03,487 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 14:33:03,487 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 14:33:03,487 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 14:33:03,487 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 14:33:03,488 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 14:33:03,488 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 14:33:03,488 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 14:33:03,488 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 14:33:03,488 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 14:33:03,488 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 14:33:03,489 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 14:33:03,489 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 14:33:03,489 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 14:33:03,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 14:33:03,489 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 14:33:03,489 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 14:33:03,490 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 14:33:03,490 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 14:33:03,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 14:33:03,490 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 14:33:03,490 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 14:33:03,490 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 14:33:03,491 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 14:33:03,491 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 14:33:03,494 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 14:33:03,495 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 14:33:03,495 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:33:03,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 14:33:03,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 14:33:03,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 14:33:03,713 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 14:33:03,714 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 14:33:03,715 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.line1290.bpl [2022-10-03 14:33:03,715 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo-bug_1w1r.line1290.bpl' [2022-10-03 14:33:03,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 14:33:03,795 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 14:33:03,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 14:33:03,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 14:33:03,796 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 14:33:03,809 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1290.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:33:03" (1/1) ... [2022-10-03 14:33:03,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1290.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:33:03" (1/1) ... [2022-10-03 14:33:03,856 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1290.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:33:03" (1/1) ... [2022-10-03 14:33:03,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1290.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:33:03" (1/1) ... [2022-10-03 14:33:03,916 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1290.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:33:03" (1/1) ... [2022-10-03 14:33:03,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1290.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:33:03" (1/1) ... [2022-10-03 14:33:03,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1290.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:33:03" (1/1) ... [2022-10-03 14:33:03,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 14:33:03,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 14:33:03,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 14:33:03,972 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 14:33:03,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo-bug_1w1r.line1290.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:33:03" (1/1) ... [2022-10-03 14:33:03,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 14:33:03,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:33:04,012 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:33:04,044 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:33:04,065 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-10-03 14:33:04,066 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-10-03 14:33:04,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 14:33:04,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 14:33:04,067 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:33:04,256 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 14:33:04,257 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 14:33:05,270 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 14:33:05,300 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 14:33:05,301 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-03 14:33:05,307 INFO L202 PluginConnector]: Adding new model divinefifo-bug_1w1r.line1290.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:33:05 BoogieIcfgContainer [2022-10-03 14:33:05,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 14:33:05,311 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 14:33:05,311 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 14:33:05,315 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 14:33:05,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line1290.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:33:03" (1/2) ... [2022-10-03 14:33:05,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f91e6c and model type divinefifo-bug_1w1r.line1290.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:33:05, skipping insertion in model container [2022-10-03 14:33:05,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line1290.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:33:05" (2/2) ... [2022-10-03 14:33:05,321 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo-bug_1w1r.line1290.bpl [2022-10-03 14:33:05,328 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 14:33:05,338 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 14:33:05,338 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 14:33:05,338 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 14:33:05,470 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-10-03 14:33:05,550 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 14:33:05,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 14:33:05,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:33:05,552 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:33:05,569 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:33:05,585 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 14:33:05,591 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 14:33:05,597 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;@6adf7a93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 14:33:05,597 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 14:33:05,932 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:33:05,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:33:05,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1432435441, now seen corresponding path program 1 times [2022-10-03 14:33:05,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:33:05,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941737456] [2022-10-03 14:33:05,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:33:05,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:33:06,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:33:06,402 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:33:06,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:33:06,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941737456] [2022-10-03 14:33:06,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941737456] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:33:06,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:33:06,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 14:33:06,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116650687] [2022-10-03 14:33:06,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:33:06,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 14:33:06,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:33:06,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 14:33:06,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 14:33:06,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:33:06,436 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:33:06,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 247.5) internal successors, (495), 2 states have internal predecessors, (495), 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:33:06,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:33:06,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:33:06,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 14:33:06,651 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:33:06,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:33:06,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1848998194, now seen corresponding path program 1 times [2022-10-03 14:33:06,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:33:06,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238425191] [2022-10-03 14:33:06,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:33:06,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:33:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:33:10,291 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:33:10,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:33:10,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238425191] [2022-10-03 14:33:10,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238425191] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:33:10,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:33:10,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-10-03 14:33:10,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454363288] [2022-10-03 14:33:10,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:33:10,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-10-03 14:33:10,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:33:10,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-10-03 14:33:10,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=3592, Unknown=0, NotChecked=0, Total=3782 [2022-10-03 14:33:10,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:33:10,299 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:33:10,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 9.064516129032258) internal successors, (562), 62 states have internal predecessors, (562), 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:33:10,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:33:10,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:33:25,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:33:25,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2022-10-03 14:33:25,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 14:33:25,702 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:33:25,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:33:25,703 INFO L85 PathProgramCache]: Analyzing trace with hash -616009408, now seen corresponding path program 1 times [2022-10-03 14:33:25,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:33:25,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438329801] [2022-10-03 14:33:25,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:33:25,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:33:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:33:26,447 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:33:26,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:33:26,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438329801] [2022-10-03 14:33:26,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438329801] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:33:26,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:33:26,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-10-03 14:33:26,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682535001] [2022-10-03 14:33:26,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:33:26,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-10-03 14:33:26,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:33:26,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-10-03 14:33:26,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650 [2022-10-03 14:33:26,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:33:26,450 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:33:26,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 20.2) internal successors, (505), 26 states have internal predecessors, (505), 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:33:26,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:33:26,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 97 states. [2022-10-03 14:33:26,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:33:32,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:33:32,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-10-03 14:33:32,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-10-03 14:33:32,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-03 14:33:32,826 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:33:32,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:33:32,828 INFO L85 PathProgramCache]: Analyzing trace with hash -697082722, now seen corresponding path program 1 times [2022-10-03 14:33:32,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:33:32,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600211003] [2022-10-03 14:33:32,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:33:32,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:33:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:33:36,082 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:33:36,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:33:36,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600211003] [2022-10-03 14:33:36,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600211003] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:33:36,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:33:36,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [73] imperfect sequences [] total 73 [2022-10-03 14:33:36,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028406477] [2022-10-03 14:33:36,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:33:36,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-10-03 14:33:36,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:33:36,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-10-03 14:33:36,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=5033, Unknown=0, NotChecked=0, Total=5256 [2022-10-03 14:33:36,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:33:36,088 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:33:36,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 11.136986301369863) internal successors, (813), 73 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:33:36,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:33:36,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 98 states. [2022-10-03 14:33:36,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2022-10-03 14:33:36,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:33:58,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:33:58,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-10-03 14:33:58,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-10-03 14:33:58,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2022-10-03 14:33:58,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-03 14:33:58,393 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:33:58,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:33:58,394 INFO L85 PathProgramCache]: Analyzing trace with hash -148414979, now seen corresponding path program 1 times [2022-10-03 14:33:58,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:33:58,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464244382] [2022-10-03 14:33:58,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:33:58,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:33:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:34:01,756 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:34:01,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:34:01,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464244382] [2022-10-03 14:34:01,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464244382] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:34:01,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:34:01,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [81] imperfect sequences [] total 81 [2022-10-03 14:34:01,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778870978] [2022-10-03 14:34:01,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:34:01,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-10-03 14:34:01,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:34:01,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-10-03 14:34:01,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=6222, Unknown=0, NotChecked=0, Total=6480 [2022-10-03 14:34:01,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:34:01,762 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:34:01,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 9.098765432098766) internal successors, (737), 81 states have internal predecessors, (737), 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:34:01,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:34:01,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 98 states. [2022-10-03 14:34:01,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2022-10-03 14:34:01,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 119 states. [2022-10-03 14:34:01,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:34:29,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:34:29,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-10-03 14:34:29,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-10-03 14:34:29,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2022-10-03 14:34:29,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2022-10-03 14:34:29,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-03 14:34:29,361 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:34:29,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:34:29,361 INFO L85 PathProgramCache]: Analyzing trace with hash 499829495, now seen corresponding path program 1 times [2022-10-03 14:34:29,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:34:29,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854745363] [2022-10-03 14:34:29,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:34:29,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:34:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:34:33,651 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 86 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:34:33,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:34:33,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854745363] [2022-10-03 14:34:33,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854745363] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:34:33,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271868948] [2022-10-03 14:34:33,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:34:33,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:34:33,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:34:33,654 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:34:33,655 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:34:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:34:34,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 2327 conjuncts, 197 conjunts are in the unsatisfiable core [2022-10-03 14:34:34,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:34:35,446 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:34:37,227 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 14:34:37,227 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:34:37,669 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:34:40,640 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 14:34:40,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 32 [2022-10-03 14:34:43,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:34:43,951 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-10-03 14:34:43,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 39 [2022-10-03 14:34:44,382 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:34:45,044 INFO L356 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2022-10-03 14:34:45,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2022-10-03 14:34:46,180 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:34:46,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2022-10-03 14:34:46,458 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 183 proven. 82 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-03 14:34:46,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 14:34:48,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-10-03 14:36:07,512 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse2 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_371) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= .cse0 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) is different from false [2022-10-03 14:36:07,533 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse0 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_371) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse1) (not (= (select .cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1))))))) is different from false [2022-10-03 14:36:07,545 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_371) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1)) (= .cse1 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) is different from false [2022-10-03 14:36:07,593 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_371) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1)) (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse1)))))) is different from false [2022-10-03 14:36:07,601 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) v_ArrVal_371) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1)) (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse1)))))) is different from false [2022-10-03 14:36:07,627 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_371) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1)) (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse1)))))) is different from false [2022-10-03 14:36:07,954 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#in~self#1.base|) |c_ULTIMATE.start_fifo_pop_#in~self#1.offset|) v_ArrVal_371) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1)) (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse1)))))) is different from false [2022-10-03 14:36:07,967 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_371) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= .cse0 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) is different from false [2022-10-03 14:36:09,003 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_370 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse1 (select (let ((.cse3 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_370))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_371)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= .cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (not (= .cse0 (select .cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))))) is different from false [2022-10-03 14:36:09,023 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_370 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse1 (select (let ((.cse3 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_370))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_371)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= .cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (not (= .cse0 (select .cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))))) is different from false [2022-10-03 14:36:09,035 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_370 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse2 (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_370))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_371)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse0)))))) is different from false [2022-10-03 14:36:09,054 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_370 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse0 (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_370))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_371)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse1) (not (= (select .cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1))))))) is different from false [2022-10-03 14:36:12,181 INFO L356 Elim1Store]: treesize reduction 34, result has 59.0 percent of original size [2022-10-03 14:36:12,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 245 treesize of output 209 [2022-10-03 14:36:12,201 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:36:12,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 372 treesize of output 366 [2022-10-03 14:36:12,214 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:36:12,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 349 treesize of output 319 [2022-10-03 14:36:12,234 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:36:12,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 400 treesize of output 372 [2022-10-03 14:36:12,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-10-03 14:36:12,476 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:36:12,476 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 10 treesize of output 4 [2022-10-03 14:36:12,500 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:36:12,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 41 [2022-10-03 14:36:12,557 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:36:12,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 157 treesize of output 199 [2022-10-03 14:36:14,087 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:36:14,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 70 treesize of output 224 [2022-10-03 14:36:16,699 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 241 not checked. [2022-10-03 14:36:16,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271868948] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 14:36:16,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 14:36:16,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 75, 69] total 230 [2022-10-03 14:36:16,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739285813] [2022-10-03 14:36:16,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 14:36:16,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 230 states [2022-10-03 14:36:16,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:36:16,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 230 interpolants. [2022-10-03 14:36:16,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=843, Invalid=46345, Unknown=166, NotChecked=5316, Total=52670 [2022-10-03 14:36:16,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:36:16,716 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:36:16,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 230 states, 230 states have (on average 11.78695652173913) internal successors, (2711), 230 states have internal predecessors, (2711), 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:36:16,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:36:16,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2022-10-03 14:36:16,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2022-10-03 14:36:16,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 123 states. [2022-10-03 14:36:16,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 137 states. [2022-10-03 14:36:16,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:36:42,504 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse4 (select |c_#memory_$Pointer$.offset| .cse2)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse0 (select .cse4 .cse1))) (and (<= .cse0 (+ .cse1 8)) (<= (+ |c_ULTIMATE.start_write~$Pointer$_#value#1.base| 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|) (not (= .cse2 |c_ULTIMATE.start_main_~#q~1#1.base|)) (<= (+ 2 |c_ULTIMATE.start_fifo_node_init_#in~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_init_~self#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_ULTIMATE.start_fifo_init_~self#1.offset|) (= .cse2 (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= (select .cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|) |c_ULTIMATE.start_fifo_empty_~self#1.offset|)) 4) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_370 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse5 (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_370))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_371)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse7 (store .cse5 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse6) (not (= (select .cse7 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse6))))))) (<= (+ 2 |c_ULTIMATE.start_fifo_node_init_#res#1.base|) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_init_~self#1.offset|) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (<= (+ 2 |c_ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base|) |c_ULTIMATE.start_main_~#q~1#1.base|) (= (select |c_ULTIMATE.start_#Ultimate.allocOnHeap_old_#valid#1| |c_ULTIMATE.start_fifo_init_~self#1.base|) 1) (not (= .cse2 |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)) (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| |c_ULTIMATE.start_main_~#q~1#1.base|) 1) (= |c_ULTIMATE.start_fifo_init_#in~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (<= .cse0 4) (<= (+ 2 |c_ULTIMATE.start_fifo_node_init_~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.base|) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)) (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| .cse2) 1) (= |c_ULTIMATE.start_fifo_init_#in~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_init_~self#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_fifo_empty_#in~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (<= (select .cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|) |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|)) 4) (<= (+ .cse2 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|)))))) is different from false [2022-10-03 14:36:42,951 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|)) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_370 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse2 (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_370))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_371)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse3) (not (= (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse3))))))) (not (= .cse0 |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)) (<= (select (select |c_#memory_$Pointer$.offset| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) 4) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|)))) is different from false [2022-10-03 14:36:43,391 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|)) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (not (= .cse0 |c_ULTIMATE.start_main_~#p~0#1.base|)) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= (select (select |c_#memory_$Pointer$.offset| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) 4) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_main_~#p~0#1.base|)) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_370 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse4 (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_370))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_371)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse3 (store .cse4 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse2 (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse2)))))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|)))) is different from false [2022-10-03 14:36:43,836 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse0)) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= (select (select |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.offset| .cse0) (select (select |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) 4) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_main_~#p~0#1.base|)) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (not (= .cse0 |c_ULTIMATE.start_main_~#p~0#1.base|)) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_370 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse3 (select (let ((.cse5 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_370))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_371)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (store .cse3 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= .cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (not (= .cse2 (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|)))) is different from false [2022-10-03 14:36:44,299 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse0)) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= (select (select |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.offset| .cse0) (select (select |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) 4) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (not (= .cse0 |c_ULTIMATE.start_write~int_#ptr#1.base|)) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_370 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse3 (select (let ((.cse5 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_370))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_371)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (store .cse3 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= .cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (not (= .cse2 (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|)))) is different from false [2022-10-03 14:36:44,715 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|)) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= (select (select |c_#memory_$Pointer$.offset| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) 4) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse4 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_371) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse3 (store .cse4 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse2 (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= .cse2 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|)))) is different from false [2022-10-03 14:36:45,199 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_#in~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_ULTIMATE.start_fifo_front_#in~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse4 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_371) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse3 (store .cse4 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse2 (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= .cse2 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) (not (= |c_ULTIMATE.start_fifo_front_#in~self#1.base| .cse5)) (<= (select (select |c_#memory_$Pointer$.offset| .cse5) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_front_#in~self#1.base|) |c_ULTIMATE.start_fifo_front_#in~self#1.offset|)) 4) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_front_#in~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|)))) is different from false [2022-10-03 14:36:45,630 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= (select (select |c_#memory_$Pointer$.offset| .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|)) 4) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (not (= |c_ULTIMATE.start_fifo_front_~self#1.base| .cse2)) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse5 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_371) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (store .cse5 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse3 (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= .cse3 (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:36:46,071 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse1 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (not (= |c_ULTIMATE.start_fifo_empty_#in~self#1.base| .cse0)) (= |c_ULTIMATE.start_fifo_empty_#in~self#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= .cse1 (select .cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (<= (select (select |c_#memory_$Pointer$.offset| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|)) 4) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse5 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_371) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (store .cse5 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse3 (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= .cse3 (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) (= |c_ULTIMATE.start_fifo_empty_#in~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (<= (+ .cse1 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:36:46,489 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse1 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (not (= |c_ULTIMATE.start_fifo_empty_~self#1.base| .cse0)) (= .cse1 (select .cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (<= (select (select |c_#memory_$Pointer$.offset| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|)) 4) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse5 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_371) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (store .cse5 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse3 (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= .cse3 (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (<= (+ .cse1 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:36:46,897 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse4 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_371) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse3 (store .cse4 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse2 (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= .cse2 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) (<= (select (select |c_#memory_$Pointer$.offset| .cse5) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|)) 4) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (not (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| .cse5))))) is different from false [2022-10-03 14:36:48,198 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|) (not (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|)) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse4 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_371) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse3 (store .cse4 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse2 (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= .cse2 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) (= |c_ULTIMATE.start_fifo_empty_#in~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (<= (select (select |c_#memory_$Pointer$.offset| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|) |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|)) 4) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:36:48,612 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|)) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= (select (select |c_#memory_$Pointer$.offset| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|) |c_ULTIMATE.start_fifo_empty_~self#1.offset|)) 4) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse4 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_371) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse3 (store .cse4 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse2 (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= .cse2 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:36:49,038 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|)) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse4 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_371) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse3 (store .cse4 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse2 (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= .cse2 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) (<= (select (select |c_#memory_$Pointer$.offset| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) 4) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:36:49,457 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= .cse0 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (<= (select (select |c_#memory_$Pointer$.offset| .cse0) |c_ULTIMATE.start_read~$Pointer$_#value#1.offset|) 4) (not (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|)) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse4 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_371) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse3 (store .cse4 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse2 (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= .cse2 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:36:49,877 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_ULTIMATE.start_fifo_empty_#t~mem6#1.offset|) (not (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|)) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= .cse0 |c_ULTIMATE.start_fifo_empty_#t~mem6#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse4 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_371) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse3 (store .cse4 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse2 (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= .cse2 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) (<= (select (select |c_#memory_$Pointer$.offset| .cse0) |c_ULTIMATE.start_fifo_empty_#t~mem6#1.offset|) 4) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:36:50,309 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) (not (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|)) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (<= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) 4) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse4 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_371) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse3 (store .cse4 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse2 (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= .cse2 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) (= .cse0 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:36:50,732 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|)) (<= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| 4) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse4 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_371) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse3 (store .cse4 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse2 (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= .cse2 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:36:51,179 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) |c_ULTIMATE.start_fifo_empty_#t~mem8#1.offset|) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (<= |c_ULTIMATE.start_fifo_empty_#t~mem8#1.offset| 4) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse4 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_371) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse3 (store .cse4 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse2 (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= .cse2 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:36:51,680 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|)) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (<= (select (select |c_#memory_$Pointer$.offset| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) 4) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse4 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_371) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse3 (store .cse4 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse2 (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= .cse2 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:36:52,168 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#in~self#1.base|) |c_ULTIMATE.start_fifo_pop_#in~self#1.offset|)) (.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse2)) (= |c_ULTIMATE.start_fifo_pop_#in~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (<= (select (select |c_#memory_$Pointer$.offset| .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#in~self#1.base|) |c_ULTIMATE.start_fifo_pop_#in~self#1.offset|)) 4) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_#in~self#1.base|) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse5 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#in~self#1.base|) |c_ULTIMATE.start_fifo_pop_#in~self#1.offset|) v_ArrVal_371) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse3 (store .cse5 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse4)) (= (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse4)))))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|)))) is different from false [2022-10-03 14:36:52,591 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_371) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1)) (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse1)))))) (= .cse3 (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (<= (select (select |c_#memory_$Pointer$.offset| .cse5) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) 4) (not (= .cse5 |c_ULTIMATE.start_main_~#q~1#1.base|)) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= (+ .cse3 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:36:53,058 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|)) (.cse4 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse0 (select .cse2 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (and (<= (select (select |c_#memory_$Pointer$.offset| .cse0) (select .cse1 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) 4) (= .cse2 .cse3) (= .cse4 (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse1) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= (+ .cse4 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse0)) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse7 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) v_ArrVal_371) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse5 (store .cse7 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse5 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse6)) (= (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse6)))))) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:36:53,492 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|)) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (<= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) |c_ULTIMATE.start_read~$Pointer$_#value#1.offset|) 4) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse4 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_371) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (store .cse4 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse3)) (= (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse3)))))) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:36:53,906 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset|) 4) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) (= |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse4 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_371) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (store .cse4 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse3)) (= .cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|)) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:36:54,320 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (<= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) 4) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) (= |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse4 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_371) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (store .cse4 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse3)) (= .cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|)) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:36:54,728 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (<= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| 4) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) (= |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse4 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_371) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (store .cse4 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse3)) (= .cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|)) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:36:55,135 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= |c_ULTIMATE.start_fifo_pop_#t~mem41#1.offset| 4) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) (= |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse4 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_371) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (store .cse4 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse3)) (= .cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|)) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:36:55,560 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= |c_ULTIMATE.start_fifo_pop_#t~mem41#1.offset| 4) (= (select (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse1 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_371) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse3 (store .cse1 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse2) (not (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse2))))))) (= (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse4) (<= (+ 2 .cse4) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|)) (= (select (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:36:55,998 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse2 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_371) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= .cse0 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) (= (select (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= |c_ULTIMATE.start_write~$Pointer$_#value#1.offset| 8) (= (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse4) (<= (+ 2 .cse4) |c_ULTIMATE.start_main_~#q~1#1.base|) (= (select (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|)) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:37:53,589 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse11 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|)) (.cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse6 (select .cse12 .cse4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (select .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (.cse0 (select .cse12 |c_ULTIMATE.start_fifo_empty_~self#1.offset|)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse7 (select .cse12 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| .cse0) (<= .cse1 8) (= .cse2 (select .cse3 .cse4)) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (<= (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|)) .cse5) (+ .cse5 8))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#q~1#1.base|)) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (= .cse6 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= .cse4 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) (= .cse6 .cse7) (forall ((v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372)))) (or (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|)) (not (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse8 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) (select (select .cse9 |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))))) (let ((.cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_front_#in~self#1.base|) |c_ULTIMATE.start_fifo_front_#in~self#1.offset|))) (<= (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_#in~self#1.base|) |c_ULTIMATE.start_fifo_front_#in~self#1.offset|)) .cse10) (+ .cse10 8))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= .cse1 (+ (select .cse11 |c_ULTIMATE.start_main_~#q~1#1.offset|) 8)) (= |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_main_~#q~1#1.base|) (= .cse0 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (<= (+ .cse2 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_front_#in~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| .cse7) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:38:07,130 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) .cse4)) (.cse3 (+ .cse2 8)) (.cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) |c_ULTIMATE.start_read~$Pointer$_#value#1.offset|)) (.cse7 (+ .cse5 8)) (.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= .cse0 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (<= (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|)) .cse2) .cse3) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= .cse4 .cse3) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#q~1#1.base|)) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (<= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| .cse3) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| .cse5) (<= .cse6 .cse7) (forall ((v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372)))) (or (= |c_ULTIMATE.start_read~$Pointer$_#value#1.base| (select (select .cse8 |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|)) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|)) (not (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse9 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse9 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))))))) (<= .cse10 .cse3) (forall ((v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372)))) (or (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|)) (not (let ((.cse11 (select .cse12 |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse11 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse11 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) (select (select .cse12 |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))))) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (<= .cse6 .cse3) (<= .cse10 .cse7) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:38:15,303 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (let ((.cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) .cse5)) (.cse4 (+ .cse3 8)) (.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= .cse0 (select .cse1 .cse2)) (<= (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|)) .cse3) .cse4) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= .cse5 .cse4) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#q~1#1.base|)) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (<= .cse6 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 8)) (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|))) (= (select .cse7 .cse2) (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (forall ((v_ArrVal_372 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| Int)) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| v_ArrVal_372)))) (or (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_31| |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|)) (not (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse8 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) (select (select .cse9 |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))))) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (<= .cse6 .cse4) (= |c_ULTIMATE.start_fifo_empty_#in~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:38:24,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:38:24,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-10-03 14:38:24,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-10-03 14:38:24,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2022-10-03 14:38:24,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2022-10-03 14:38:24,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2022-10-03 14:38:25,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-03 14:38:25,188 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,SelfDestructingSolverStorable5 [2022-10-03 14:38:25,189 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:38:25,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:38:25,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1544559687, now seen corresponding path program 1 times [2022-10-03 14:38:25,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:38:25,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117056494] [2022-10-03 14:38:25,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:38:25,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:38:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:38:33,239 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 144 proven. 343 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:38:33,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:38:33,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117056494] [2022-10-03 14:38:33,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117056494] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:38:33,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850058480] [2022-10-03 14:38:33,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:38:33,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:38:33,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:38:33,241 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:38:33,242 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:38:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:38:33,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 2939 conjuncts, 319 conjunts are in the unsatisfiable core [2022-10-03 14:38:33,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:38:33,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 14:38:34,008 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-03 14:38:34,008 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-10-03 14:38:35,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:38:35,397 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:38:36,544 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-10-03 14:38:36,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-10-03 14:38:37,052 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 23 [2022-10-03 14:38:37,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-03 14:38:39,569 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-03 14:38:40,386 INFO L356 Elim1Store]: treesize reduction 55, result has 16.7 percent of original size [2022-10-03 14:38:40,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 25 [2022-10-03 14:38:44,102 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 14:38:44,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2022-10-03 14:38:45,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:38:45,635 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 40 treesize of output 27 [2022-10-03 14:38:46,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:38:48,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:38:48,598 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:38:48,598 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 1 case distinctions, treesize of input 49 treesize of output 34 [2022-10-03 14:38:49,098 INFO L356 Elim1Store]: treesize reduction 36, result has 37.9 percent of original size [2022-10-03 14:38:49,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 23 treesize of output 33 [2022-10-03 14:38:50,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:38:50,997 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 14:38:50,998 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:38:50,998 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 19 [2022-10-03 14:38:51,427 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 32 proven. 455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:38:51,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 14:39:00,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-10-03 14:39:00,894 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-10-03 14:39:00,895 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-10-03 14:39:00,917 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:39:01,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:39:01,096 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:894) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 46 more [2022-10-03 14:39:01,099 INFO L158 Benchmark]: Toolchain (without parser) took 357304.82ms. Allocated memory was 178.3MB in the beginning and 738.2MB in the end (delta: 559.9MB). Free memory was 126.9MB in the beginning and 350.3MB in the end (delta: -223.3MB). Peak memory consumption was 336.6MB. Max. memory is 8.0GB. [2022-10-03 14:39:01,100 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.13ms. Allocated memory is still 178.3MB. Free memory is still 133.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-03 14:39:01,100 INFO L158 Benchmark]: Boogie Preprocessor took 163.52ms. Allocated memory is still 178.3MB. Free memory was 126.9MB in the beginning and 146.5MB in the end (delta: -19.5MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. [2022-10-03 14:39:01,100 INFO L158 Benchmark]: RCFGBuilder took 1335.99ms. Allocated memory was 178.3MB in the beginning and 302.0MB in the end (delta: 123.7MB). Free memory was 146.5MB in the beginning and 237.7MB in the end (delta: -91.2MB). Peak memory consumption was 52.7MB. Max. memory is 8.0GB. [2022-10-03 14:39:01,101 INFO L158 Benchmark]: TraceAbstraction took 355787.66ms. Allocated memory was 302.0MB in the beginning and 738.2MB in the end (delta: 436.2MB). Free memory was 236.6MB in the beginning and 350.3MB in the end (delta: -113.6MB). Peak memory consumption was 323.3MB. Max. memory is 8.0GB. [2022-10-03 14:39:01,102 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.13ms. Allocated memory is still 178.3MB. Free memory is still 133.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 163.52ms. Allocated memory is still 178.3MB. Free memory was 126.9MB in the beginning and 146.5MB in the end (delta: -19.5MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. * RCFGBuilder took 1335.99ms. Allocated memory was 178.3MB in the beginning and 302.0MB in the end (delta: 123.7MB). Free memory was 146.5MB in the beginning and 237.7MB in the end (delta: -91.2MB). Peak memory consumption was 52.7MB. Max. memory is 8.0GB. * TraceAbstraction took 355787.66ms. Allocated memory was 302.0MB in the beginning and 738.2MB in the end (delta: 436.2MB). Free memory was 236.6MB in the beginning and 350.3MB in the end (delta: -113.6MB). Peak memory consumption was 323.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-10-03 14:39:01,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 Received shutdown request...