/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -i ../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line1235.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 15:17:49,430 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 15:17:49,431 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 15:17:49,459 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 15:17:49,459 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 15:17:49,462 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 15:17:49,462 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 15:17:49,463 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 15:17:49,464 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 15:17:49,465 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 15:17:49,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 15:17:49,466 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 15:17:49,466 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 15:17:49,467 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 15:17:49,467 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 15:17:49,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 15:17:49,468 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 15:17:49,469 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 15:17:49,470 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 15:17:49,471 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 15:17:49,472 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 15:17:49,473 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 15:17:49,473 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 15:17:49,474 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 15:17:49,476 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 15:17:49,476 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 15:17:49,477 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 15:17:49,477 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 15:17:49,477 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 15:17:49,478 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 15:17:49,478 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 15:17:49,478 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 15:17:49,479 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 15:17:49,479 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 15:17:49,480 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 15:17:49,480 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 15:17:49,480 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 15:17:49,481 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 15:17:49,481 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 15:17:49,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 15:17:49,482 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 15:17:49,483 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-03 15:17:49,512 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 15:17:49,513 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 15:17:49,513 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 15:17:49,513 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 15:17:49,514 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 15:17:49,514 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 15:17:49,514 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 15:17:49,514 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 15:17:49,514 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 15:17:49,514 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 15:17:49,515 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 15:17:49,515 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 15:17:49,515 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 15:17:49,515 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 15:17:49,515 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 15:17:49,515 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 15:17:49,515 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 15:17:49,516 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 15:17:49,516 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 15:17:49,516 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 15:17:49,516 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 15:17:49,516 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 15:17:49,516 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 15:17:49,516 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 15:17:49,516 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 15:17:49,516 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 15:17:49,516 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 15:17:49,517 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 15:17:49,517 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 15:17:49,517 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 15:17:49,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 15:17:49,517 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 15:17:49,518 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 15:17:49,518 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 15:17:49,518 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 15:17:49,518 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 15:17:49,518 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 15:17:49,518 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 15:17:49,518 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-03 15:17:49,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 15:17:49,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 15:17:49,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 15:17:49,710 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 15:17:49,711 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 15:17:49,712 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line1235.bpl [2022-10-03 15:17:49,712 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line1235.bpl' [2022-10-03 15:17:49,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 15:17:49,790 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 15:17:49,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 15:17:49,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 15:17:49,794 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 15:17:49,803 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo_1w1r.line1235.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:17:49" (1/1) ... [2022-10-03 15:17:49,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo_1w1r.line1235.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:17:49" (1/1) ... [2022-10-03 15:17:49,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1235.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:17:49" (1/1) ... [2022-10-03 15:17:49,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1235.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:17:49" (1/1) ... [2022-10-03 15:17:49,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo_1w1r.line1235.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:17:49" (1/1) ... [2022-10-03 15:17:49,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo_1w1r.line1235.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:17:49" (1/1) ... [2022-10-03 15:17:49,864 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo_1w1r.line1235.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:17:49" (1/1) ... [2022-10-03 15:17:49,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 15:17:49,882 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 15:17:49,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 15:17:49,882 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 15:17:49,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo_1w1r.line1235.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:17:49" (1/1) ... [2022-10-03 15:17:49,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 15:17:49,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:17:49,914 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-03 15:17:49,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-03 15:17:49,945 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-10-03 15:17:49,946 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-10-03 15:17:49,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 15:17:49,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 15:17:49,947 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-03 15:17:50,071 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 15:17:50,072 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 15:17:50,941 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 15:17:50,965 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 15:17:50,965 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-03 15:17:50,968 INFO L202 PluginConnector]: Adding new model divinefifo_1w1r.line1235.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:17:50 BoogieIcfgContainer [2022-10-03 15:17:50,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 15:17:50,970 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 15:17:50,971 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 15:17:50,973 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 15:17:50,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1235.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:17:49" (1/2) ... [2022-10-03 15:17:50,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48cb35d1 and model type divinefifo_1w1r.line1235.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:17:50, skipping insertion in model container [2022-10-03 15:17:50,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1235.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:17:50" (2/2) ... [2022-10-03 15:17:50,978 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo_1w1r.line1235.bpl [2022-10-03 15:17:50,983 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 15:17:50,990 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 15:17:50,990 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 15:17:50,990 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 15:17:51,126 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-10-03 15:17:51,183 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 15:17:51,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 15:17:51,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:17:51,185 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-03 15:17:51,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-10-03 15:17:51,221 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 15:17:51,226 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 15:17:51,231 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;@6a9fef44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 15:17:51,231 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 15:17:51,529 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:17:51,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:17:51,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1490857836, now seen corresponding path program 1 times [2022-10-03 15:17:51,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:17:51,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718404067] [2022-10-03 15:17:51,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:17:51,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:17:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:17:51,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:17:51,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:17:51,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718404067] [2022-10-03 15:17:51,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718404067] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:17:51,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:17:51,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 15:17:51,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248187437] [2022-10-03 15:17:51,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:17:51,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 15:17:51,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:17:51,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 15:17:51,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 15:17:51,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:17:51,952 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:17:51,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 226.5) internal successors, (453), 2 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:17:51,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:17:52,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:17:52,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 15:17:52,149 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:17:52,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:17:52,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1579283016, now seen corresponding path program 1 times [2022-10-03 15:17:52,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:17:52,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402460806] [2022-10-03 15:17:52,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:17:52,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:17:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:17:52,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:17:52,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:17:52,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402460806] [2022-10-03 15:17:52,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402460806] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:17:52,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:17:52,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-10-03 15:17:52,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25748255] [2022-10-03 15:17:52,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:17:52,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-10-03 15:17:52,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:17:52,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-10-03 15:17:52,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-10-03 15:17:52,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:17:52,871 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:17:52,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 32.5) internal successors, (520), 17 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:17:52,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:17:52,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:17:54,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:17:54,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-03 15:17:54,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 15:17:54,485 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:17:54,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:17:54,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1487353556, now seen corresponding path program 1 times [2022-10-03 15:17:54,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:17:54,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155136450] [2022-10-03 15:17:54,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:17:54,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:17:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:17:57,496 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-03 15:17:57,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:17:57,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155136450] [2022-10-03 15:17:57,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155136450] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:17:57,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:17:57,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2022-10-03 15:17:57,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431823016] [2022-10-03 15:17:57,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:17:57,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-10-03 15:17:57,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:17:57,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-10-03 15:17:57,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=4208, Unknown=0, NotChecked=0, Total=4422 [2022-10-03 15:17:57,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:17:57,504 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:17:57,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 12.567164179104477) internal successors, (842), 67 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:17:57,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:17:57,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-10-03 15:17:57,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:18:13,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:18:13,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-03 15:18:13,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-10-03 15:18:13,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-03 15:18:13,910 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:18:13,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:18:13,910 INFO L85 PathProgramCache]: Analyzing trace with hash 473800308, now seen corresponding path program 1 times [2022-10-03 15:18:13,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:18:13,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724699136] [2022-10-03 15:18:13,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:18:13,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:18:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:18:14,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:18:14,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:18:14,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724699136] [2022-10-03 15:18:14,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724699136] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:18:14,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:18:14,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-10-03 15:18:14,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639390166] [2022-10-03 15:18:14,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:18:14,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-03 15:18:14,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:18:14,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-03 15:18:14,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-10-03 15:18:14,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:18:14,223 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:18:14,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 43.30769230769231) internal successors, (563), 14 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:18:14,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:18:14,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-10-03 15:18:14,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 99 states. [2022-10-03 15:18:14,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:18:17,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:18:17,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-03 15:18:17,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-10-03 15:18:17,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-03 15:18:17,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-03 15:18:17,160 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:18:17,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:18:17,161 INFO L85 PathProgramCache]: Analyzing trace with hash 774196186, now seen corresponding path program 1 times [2022-10-03 15:18:17,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:18:17,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137042805] [2022-10-03 15:18:17,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:18:17,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:18:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:18:18,066 INFO L134 CoverageAnalysis]: Checked inductivity of 922 backedges. 172 proven. 58 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2022-10-03 15:18:18,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:18:18,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137042805] [2022-10-03 15:18:18,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137042805] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:18:18,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315344656] [2022-10-03 15:18:18,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:18:18,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:18:18,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:18:18,069 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 15:18:18,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-03 15:18:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:18:18,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 3998 conjuncts, 204 conjunts are in the unsatisfiable core [2022-10-03 15:18:18,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:18:18,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 15:18:18,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 15:18:19,967 INFO L356 Elim1Store]: treesize reduction 104, result has 14.0 percent of original size [2022-10-03 15:18:19,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 72 treesize of output 49 [2022-10-03 15:18:19,993 INFO L356 Elim1Store]: treesize reduction 48, result has 49.5 percent of original size [2022-10-03 15:18:19,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 66 [2022-10-03 15:18:22,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 49 [2022-10-03 15:18:22,384 INFO L356 Elim1Store]: treesize reduction 39, result has 7.1 percent of original size [2022-10-03 15:18:22,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 33 [2022-10-03 15:18:22,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 15:18:22,600 INFO L134 CoverageAnalysis]: Checked inductivity of 922 backedges. 846 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-10-03 15:18:22,600 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-03 15:18:22,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315344656] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:18:22,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-03 15:18:22,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [11] total 70 [2022-10-03 15:18:22,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105405102] [2022-10-03 15:18:22,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:18:22,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-10-03 15:18:22,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:18:22,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-10-03 15:18:22,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=4566, Unknown=0, NotChecked=0, Total=4830 [2022-10-03 15:18:22,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:18:22,605 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:18:22,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 25.083333333333332) internal successors, (1505), 60 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:18:22,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:18:22,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-10-03 15:18:22,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2022-10-03 15:18:22,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-03 15:18:22,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:18:31,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:18:31,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-03 15:18:31,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-10-03 15:18:31,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-03 15:18:31,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-10-03 15:18:31,203 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 15:18:31,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:18:31,381 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:18:31,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:18:31,382 INFO L85 PathProgramCache]: Analyzing trace with hash -337710812, now seen corresponding path program 2 times [2022-10-03 15:18:31,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:18:31,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714975768] [2022-10-03 15:18:31,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:18:31,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:18:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:18:31,882 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:18:31,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:18:31,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714975768] [2022-10-03 15:18:31,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714975768] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:18:31,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559949805] [2022-10-03 15:18:31,883 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-03 15:18:31,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:18:31,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:18:31,885 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 15:18:31,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-03 15:18:32,186 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-03 15:18:32,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-03 15:18:32,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 1524 conjuncts, 21 conjunts are in the unsatisfiable core [2022-10-03 15:18:32,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:18:32,429 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-10-03 15:18:32,430 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-03 15:18:32,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559949805] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:18:32,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-03 15:18:32,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2022-10-03 15:18:32,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041236770] [2022-10-03 15:18:32,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:18:32,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-03 15:18:32,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:18:32,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-03 15:18:32,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-10-03 15:18:32,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:18:32,433 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:18:32,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 161.16666666666666) internal successors, (967), 7 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:18:32,434 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:18:32,434 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-10-03 15:18:32,434 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2022-10-03 15:18:32,434 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-03 15:18:32,434 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2022-10-03 15:18:32,434 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:18:46,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:18:46,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-03 15:18:46,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-10-03 15:18:46,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-03 15:18:46,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2022-10-03 15:18:46,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-03 15:18:46,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-10-03 15:18:47,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:18:47,094 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:18:47,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:18:47,095 INFO L85 PathProgramCache]: Analyzing trace with hash 873395776, now seen corresponding path program 3 times [2022-10-03 15:18:47,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:18:47,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506933332] [2022-10-03 15:18:47,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:18:47,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:18:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:18:54,841 INFO L134 CoverageAnalysis]: Checked inductivity of 10962 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 10932 trivial. 0 not checked. [2022-10-03 15:18:54,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:18:54,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506933332] [2022-10-03 15:18:54,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506933332] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:18:54,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:18:54,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [77] imperfect sequences [] total 77 [2022-10-03 15:18:54,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804727074] [2022-10-03 15:18:54,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:18:54,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-10-03 15:18:54,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:18:54,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-10-03 15:18:54,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=5605, Unknown=0, NotChecked=0, Total=5852 [2022-10-03 15:18:54,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:18:54,846 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:18:54,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 12.597402597402597) internal successors, (970), 77 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:18:54,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:18:54,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-10-03 15:18:54,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2022-10-03 15:18:54,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-03 15:18:54,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 163 states. [2022-10-03 15:18:54,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-10-03 15:18:54,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:19:13,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:19:13,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-03 15:19:13,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-10-03 15:19:13,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-03 15:19:13,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2022-10-03 15:19:13,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-03 15:19:13,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2022-10-03 15:19:13,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-03 15:19:13,594 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:19:13,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:19:13,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1212945838, now seen corresponding path program 4 times [2022-10-03 15:19:13,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:19:13,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203746317] [2022-10-03 15:19:13,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:19:13,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:19:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:19:20,740 INFO L134 CoverageAnalysis]: Checked inductivity of 11476 backedges. 406 proven. 0 refuted. 0 times theorem prover too weak. 11070 trivial. 0 not checked. [2022-10-03 15:19:20,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:19:20,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203746317] [2022-10-03 15:19:20,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203746317] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:19:20,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:19:20,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [82] imperfect sequences [] total 82 [2022-10-03 15:19:20,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541351264] [2022-10-03 15:19:20,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:19:20,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-10-03 15:19:20,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:19:20,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-10-03 15:19:20,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=6383, Unknown=0, NotChecked=0, Total=6642 [2022-10-03 15:19:20,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:19:20,745 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:19:20,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 13.195121951219512) internal successors, (1082), 82 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:19:20,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:19:20,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-10-03 15:19:20,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 101 states. [2022-10-03 15:19:20,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-03 15:19:20,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 163 states. [2022-10-03 15:19:20,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-10-03 15:19:20,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 110 states. [2022-10-03 15:19:20,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:19:53,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:19:53,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-03 15:19:53,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-10-03 15:19:53,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-03 15:19:53,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2022-10-03 15:19:53,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-03 15:19:53,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2022-10-03 15:19:53,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2022-10-03 15:19:53,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-03 15:19:53,247 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:19:53,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:19:53,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1383306408, now seen corresponding path program 5 times [2022-10-03 15:19:53,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:19:53,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418922514] [2022-10-03 15:19:53,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:19:53,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:19:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:19:57,530 INFO L134 CoverageAnalysis]: Checked inductivity of 10962 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10962 trivial. 0 not checked. [2022-10-03 15:19:57,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:19:57,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418922514] [2022-10-03 15:19:57,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418922514] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:19:57,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:19:57,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-10-03 15:19:57,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413592018] [2022-10-03 15:19:57,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:19:57,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-10-03 15:19:57,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:19:57,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-10-03 15:19:57,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=3588, Unknown=0, NotChecked=0, Total=3782 [2022-10-03 15:19:57,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:19:57,535 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:19:57,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 15.483870967741936) internal successors, (960), 62 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:19:57,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:19:57,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-10-03 15:19:57,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 101 states. [2022-10-03 15:19:57,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-03 15:19:57,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 163 states. [2022-10-03 15:19:57,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-10-03 15:19:57,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 113 states. [2022-10-03 15:19:57,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 123 states. [2022-10-03 15:19:57,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:14,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:14,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-03 15:20:14,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-10-03 15:20:14,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-03 15:20:14,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2022-10-03 15:20:14,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-03 15:20:14,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-10-03 15:20:14,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-10-03 15:20:14,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-10-03 15:20:14,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-03 15:20:14,089 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:20:14,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:20:14,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1728278895, now seen corresponding path program 1 times [2022-10-03 15:20:14,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:20:14,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316131272] [2022-10-03 15:20:14,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:20:14,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:20:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:20:19,366 INFO L134 CoverageAnalysis]: Checked inductivity of 10606 backedges. 984 proven. 0 refuted. 0 times theorem prover too weak. 9622 trivial. 0 not checked. [2022-10-03 15:20:19,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:20:19,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316131272] [2022-10-03 15:20:19,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316131272] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:20:19,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:20:19,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [75] imperfect sequences [] total 75 [2022-10-03 15:20:19,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724279147] [2022-10-03 15:20:19,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:20:19,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-10-03 15:20:19,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:20:19,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-10-03 15:20:19,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=5315, Unknown=0, NotChecked=0, Total=5550 [2022-10-03 15:20:19,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:19,371 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:20:19,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 13.666666666666666) internal successors, (1025), 75 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:20:19,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:19,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-10-03 15:20:19,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2022-10-03 15:20:19,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-10-03 15:20:19,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 163 states. [2022-10-03 15:20:19,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-10-03 15:20:19,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 116 states. [2022-10-03 15:20:19,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 127 states. [2022-10-03 15:20:19,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2022-10-03 15:20:19,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:41,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:41,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-03 15:20:41,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-10-03 15:20:41,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-03 15:20:41,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2022-10-03 15:20:41,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-03 15:20:41,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-10-03 15:20:41,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-10-03 15:20:41,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-10-03 15:20:41,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-10-03 15:20:41,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-03 15:20:41,567 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:20:41,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:20:41,568 INFO L85 PathProgramCache]: Analyzing trace with hash -2019462213, now seen corresponding path program 1 times [2022-10-03 15:20:41,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:20:41,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496030718] [2022-10-03 15:20:41,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:20:41,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:20:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:20:48,610 INFO L134 CoverageAnalysis]: Checked inductivity of 12477 backedges. 1331 proven. 0 refuted. 0 times theorem prover too weak. 11146 trivial. 0 not checked. [2022-10-03 15:20:48,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:20:48,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496030718] [2022-10-03 15:20:48,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496030718] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:20:48,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:20:48,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [84] imperfect sequences [] total 84 [2022-10-03 15:20:48,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135686648] [2022-10-03 15:20:48,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:20:48,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-10-03 15:20:48,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:20:48,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-10-03 15:20:48,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=6722, Unknown=0, NotChecked=0, Total=6972 [2022-10-03 15:20:48,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:48,615 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:20:48,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 12.535714285714286) internal successors, (1053), 84 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:20:48,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:48,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-10-03 15:20:48,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2022-10-03 15:20:48,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-10-03 15:20:48,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 169 states. [2022-10-03 15:20:48,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-10-03 15:20:48,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 116 states. [2022-10-03 15:20:48,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 127 states. [2022-10-03 15:20:48,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2022-10-03 15:20:48,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 120 states. [2022-10-03 15:20:48,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:21:29,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:21:29,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-03 15:21:29,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-10-03 15:21:29,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-03 15:21:29,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2022-10-03 15:21:29,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-03 15:21:29,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-10-03 15:21:29,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2022-10-03 15:21:29,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-10-03 15:21:29,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2022-10-03 15:21:29,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2022-10-03 15:21:29,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-03 15:21:29,762 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:21:29,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:21:29,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1993408099, now seen corresponding path program 1 times [2022-10-03 15:21:29,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:21:29,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963188595] [2022-10-03 15:21:29,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:21:29,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:21:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:21:38,774 INFO L134 CoverageAnalysis]: Checked inductivity of 43911 backedges. 1274 proven. 11427 refuted. 0 times theorem prover too weak. 31210 trivial. 0 not checked. [2022-10-03 15:21:38,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:21:38,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963188595] [2022-10-03 15:21:38,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963188595] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:21:38,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036748752] [2022-10-03 15:21:38,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:21:38,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:21:38,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:21:38,777 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 15:21:38,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-03 15:21:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:21:41,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 17707 conjuncts, 216 conjunts are in the unsatisfiable core [2022-10-03 15:21:41,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:21:55,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 15:21:55,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 15:21:56,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:21:56,978 INFO L356 Elim1Store]: treesize reduction 104, result has 14.0 percent of original size [2022-10-03 15:21:56,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 86 treesize of output 59 [2022-10-03 15:21:56,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:21:57,025 INFO L356 Elim1Store]: treesize reduction 52, result has 62.0 percent of original size [2022-10-03 15:21:57,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 106 [2022-10-03 15:21:59,691 INFO L134 CoverageAnalysis]: Checked inductivity of 43911 backedges. 4037 proven. 27938 refuted. 0 times theorem prover too weak. 11936 trivial. 0 not checked. [2022-10-03 15:21:59,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 15:21:59,706 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:21:59,706 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 1 case distinctions, treesize of input 7 treesize of output 6 [2022-10-03 15:21:59,708 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:21:59,709 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 1 case distinctions, treesize of input 7 treesize of output 6 [2022-10-03 15:22:03,327 INFO L134 CoverageAnalysis]: Checked inductivity of 43911 backedges. 6203 proven. 0 refuted. 0 times theorem prover too weak. 37708 trivial. 0 not checked. [2022-10-03 15:22:03,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036748752] provided 1 perfect and 1 imperfect interpolant sequences [2022-10-03 15:22:03,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-10-03 15:22:03,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [13, 64] total 110 [2022-10-03 15:22:03,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382297058] [2022-10-03 15:22:03,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:22:03,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-10-03 15:22:03,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:22:03,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-10-03 15:22:03,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1022, Invalid=10968, Unknown=0, NotChecked=0, Total=11990 [2022-10-03 15:22:03,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:22:03,336 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:22:03,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 37.55263157894737) internal successors, (1427), 38 states have internal predecessors, (1427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:22:03,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:22:03,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-10-03 15:22:03,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 109 states. [2022-10-03 15:22:03,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-10-03 15:22:03,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 183 states. [2022-10-03 15:22:03,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-10-03 15:22:03,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 121 states. [2022-10-03 15:22:03,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 133 states. [2022-10-03 15:22:03,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-10-03 15:22:03,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 124 states. [2022-10-03 15:22:03,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 140 states. [2022-10-03 15:22:03,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:22:19,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:22:19,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-03 15:22:19,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-10-03 15:22:19,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-03 15:22:19,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2022-10-03 15:22:19,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-03 15:22:19,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-10-03 15:22:19,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2022-10-03 15:22:19,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-10-03 15:22:19,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2022-10-03 15:22:19,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2022-10-03 15:22:19,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-10-03 15:22:19,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-03 15:22:19,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:22:19,674 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:22:19,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:22:19,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1600364536, now seen corresponding path program 1 times [2022-10-03 15:22:19,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:22:19,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367644960] [2022-10-03 15:22:19,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:22:19,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:22:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:22:20,143 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 380 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2022-10-03 15:22:20,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:22:20,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367644960] [2022-10-03 15:22:20,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367644960] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:22:20,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:22:20,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-10-03 15:22:20,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671235813] [2022-10-03 15:22:20,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:22:20,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-10-03 15:22:20,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:22:20,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-10-03 15:22:20,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-10-03 15:22:20,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:22:20,145 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:22:20,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 48.476190476190474) internal successors, (1018), 21 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:22:20,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:22:20,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-10-03 15:22:20,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 109 states. [2022-10-03 15:22:20,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-10-03 15:22:20,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 194 states. [2022-10-03 15:22:20,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-10-03 15:22:20,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 121 states. [2022-10-03 15:22:20,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 133 states. [2022-10-03 15:22:20,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-10-03 15:22:20,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 124 states. [2022-10-03 15:22:20,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 140 states. [2022-10-03 15:22:20,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2022-10-03 15:22:20,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:22:30,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:22:30,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-03 15:22:30,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-10-03 15:22:30,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-03 15:22:30,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2022-10-03 15:22:30,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-03 15:22:30,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-10-03 15:22:30,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2022-10-03 15:22:30,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-10-03 15:22:30,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2022-10-03 15:22:30,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2022-10-03 15:22:30,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-10-03 15:22:30,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-10-03 15:22:30,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-03 15:22:30,492 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:22:30,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:22:30,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1480678763, now seen corresponding path program 1 times [2022-10-03 15:22:30,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:22:30,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445690896] [2022-10-03 15:22:30,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:22:30,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:22:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:22:37,962 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 2819 proven. 182 refuted. 0 times theorem prover too weak. 5110 trivial. 0 not checked. [2022-10-03 15:22:37,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:22:37,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445690896] [2022-10-03 15:22:37,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445690896] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:22:37,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382615961] [2022-10-03 15:22:37,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:22:37,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:22:37,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:22:37,964 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 15:22:37,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-03 15:22:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:22:39,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 8153 conjuncts, 283 conjunts are in the unsatisfiable core [2022-10-03 15:22:39,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:22:39,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 15:22:40,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 15:22:40,618 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 15:22:40,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-03 15:22:40,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-03 15:22:41,591 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 13 treesize of output 9 [2022-10-03 15:22:42,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:22:42,158 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 28 treesize of output 21 [2022-10-03 15:22:44,043 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 15:22:44,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-03 15:22:44,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-03 15:22:44,900 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 28 treesize of output 26 [2022-10-03 15:22:50,441 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 15:22:50,442 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 32 treesize of output 31 [2022-10-03 15:22:57,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:22:57,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2022-10-03 15:22:57,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-03 15:22:57,542 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 15:23:01,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-03 15:23:02,140 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:23:02,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-10-03 15:23:02,173 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 3607 proven. 83 refuted. 0 times theorem prover too weak. 4421 trivial. 0 not checked. [2022-10-03 15:23:02,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 15:23:05,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-10-03 15:23:05,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 79 [2022-10-03 15:23:12,408 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4259 (Array Int Int)) (v_ArrVal_4258 Int) (v_ArrVal_4260 (Array Int Int))) (let ((.cse0 (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_4259))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_4260)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (or (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse1) (< (select (store |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_4258) .cse1) 16))))) is different from false [2022-10-03 15:23:14,972 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-03 15:23:14,972 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 13 treesize of output 12 [2022-10-03 15:23:15,974 INFO L356 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2022-10-03 15:23:15,974 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 211 treesize of output 93 [2022-10-03 15:23:15,999 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:23:15,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 327 treesize of output 330 [2022-10-03 15:23:16,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 253 treesize of output 233 [2022-10-03 15:23:16,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 233 treesize of output 207 [2022-10-03 15:23:52,666 WARN L233 SmtUtils]: Spent 20.84s on a formula simplification. DAG size of input: 357 DAG size of output: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 15:23:56,581 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 3427 proven. 270 refuted. 0 times theorem prover too weak. 4414 trivial. 0 not checked. [2022-10-03 15:23:56,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382615961] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 15:23:56,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 15:23:56,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 83, 75] total 254 [2022-10-03 15:23:56,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840438517] [2022-10-03 15:23:56,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 15:23:56,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 254 states [2022-10-03 15:23:56,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:23:56,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 254 interpolants. [2022-10-03 15:23:56,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1256, Invalid=62057, Unknown=447, NotChecked=502, Total=64262 [2022-10-03 15:23:56,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:23:56,593 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:23:56,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 254 states, 254 states have (on average 12.515748031496063) internal successors, (3179), 254 states have internal predecessors, (3179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:23:56,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:23:56,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-10-03 15:23:56,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 109 states. [2022-10-03 15:23:56,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-10-03 15:23:56,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 199 states. [2022-10-03 15:23:56,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-10-03 15:23:56,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 121 states. [2022-10-03 15:23:56,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 133 states. [2022-10-03 15:23:56,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-10-03 15:23:56,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 124 states. [2022-10-03 15:23:56,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 140 states. [2022-10-03 15:23:56,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2022-10-03 15:23:56,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-10-03 15:23:56,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:24:38,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:24:38,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-03 15:24:38,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-10-03 15:24:38,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-03 15:24:38,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2022-10-03 15:24:38,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-03 15:24:38,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-10-03 15:24:38,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2022-10-03 15:24:38,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-10-03 15:24:38,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2022-10-03 15:24:38,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2022-10-03 15:24:38,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-10-03 15:24:38,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-10-03 15:24:38,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2022-10-03 15:24:38,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-03 15:24:38,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-10-03 15:24:38,222 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:24:38,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:24:38,223 INFO L85 PathProgramCache]: Analyzing trace with hash -243623039, now seen corresponding path program 2 times [2022-10-03 15:24:38,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:24:38,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155065338] [2022-10-03 15:24:38,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:24:38,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:24:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:24:40,281 INFO L134 CoverageAnalysis]: Checked inductivity of 10688 backedges. 8452 proven. 2236 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:24:40,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:24:40,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155065338] [2022-10-03 15:24:40,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155065338] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:24:40,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953503656] [2022-10-03 15:24:40,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-03 15:24:40,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:24:40,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:24:40,283 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 15:24:40,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-03 15:24:42,972 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-03 15:24:42,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-03 15:24:43,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 9087 conjuncts, 9 conjunts are in the unsatisfiable core [2022-10-03 15:24:43,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:24:45,738 INFO L134 CoverageAnalysis]: Checked inductivity of 10688 backedges. 10688 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:24:45,739 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-03 15:24:45,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953503656] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:24:45,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-03 15:24:45,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 11 [2022-10-03 15:24:45,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105712685] [2022-10-03 15:24:45,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:24:45,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-03 15:24:45,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:24:45,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-03 15:24:45,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2022-10-03 15:24:45,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:24:45,743 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:24:45,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 377.3) internal successors, (3773), 10 states have internal predecessors, (3773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:24:45,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:24:45,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-10-03 15:24:45,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 109 states. [2022-10-03 15:24:45,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-10-03 15:24:45,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 199 states. [2022-10-03 15:24:45,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-10-03 15:24:45,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 121 states. [2022-10-03 15:24:45,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 133 states. [2022-10-03 15:24:45,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-10-03 15:24:45,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 125 states. [2022-10-03 15:24:45,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 145 states. [2022-10-03 15:24:45,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2022-10-03 15:24:45,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-10-03 15:24:45,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 134 states. [2022-10-03 15:24:45,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:24:47,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:24:47,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-03 15:24:47,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-10-03 15:24:47,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-03 15:24:47,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2022-10-03 15:24:47,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-03 15:24:47,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-10-03 15:24:47,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2022-10-03 15:24:47,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-10-03 15:24:47,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2022-10-03 15:24:47,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2022-10-03 15:24:47,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-10-03 15:24:47,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-10-03 15:24:47,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2022-10-03 15:24:47,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-03 15:24:47,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-03 15:24:47,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-10-03 15:24:47,774 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:24:47,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:24:47,775 INFO L85 PathProgramCache]: Analyzing trace with hash -581236966, now seen corresponding path program 1 times [2022-10-03 15:24:47,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:24:47,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047662471] [2022-10-03 15:24:47,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:24:47,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:24:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:24:49,733 INFO L134 CoverageAnalysis]: Checked inductivity of 8774 backedges. 2 proven. 1058 refuted. 0 times theorem prover too weak. 7714 trivial. 0 not checked. [2022-10-03 15:24:49,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:24:49,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047662471] [2022-10-03 15:24:49,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047662471] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:24:49,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101570510] [2022-10-03 15:24:49,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:24:49,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:24:49,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:24:49,735 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 15:24:49,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-03 15:24:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:24:51,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 8164 conjuncts, 37 conjunts are in the unsatisfiable core [2022-10-03 15:24:51,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:24:55,163 INFO L134 CoverageAnalysis]: Checked inductivity of 8774 backedges. 2 proven. 1058 refuted. 0 times theorem prover too weak. 7714 trivial. 0 not checked. [2022-10-03 15:24:55,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 15:24:55,334 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:24:55,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-10-03 15:24:58,403 INFO L134 CoverageAnalysis]: Checked inductivity of 8774 backedges. 0 proven. 1060 refuted. 0 times theorem prover too weak. 7714 trivial. 0 not checked. [2022-10-03 15:24:58,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101570510] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 15:24:58,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 15:24:58,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 22 [2022-10-03 15:24:58,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580853416] [2022-10-03 15:24:58,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 15:24:58,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-10-03 15:24:58,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:24:58,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-10-03 15:24:58,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2022-10-03 15:24:58,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:24:58,410 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:24:58,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 49.09090909090909) internal successors, (1080), 23 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:24:58,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:24:58,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-10-03 15:24:58,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 109 states. [2022-10-03 15:24:58,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-10-03 15:24:58,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 201 states. [2022-10-03 15:24:58,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-10-03 15:24:58,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 121 states. [2022-10-03 15:24:58,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 133 states. [2022-10-03 15:24:58,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-10-03 15:24:58,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 125 states. [2022-10-03 15:24:58,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 145 states. [2022-10-03 15:24:58,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2022-10-03 15:24:58,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-10-03 15:24:58,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 134 states. [2022-10-03 15:24:58,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-10-03 15:24:58,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:25:14,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:25:14,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-03 15:25:14,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-10-03 15:25:14,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-03 15:25:14,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2022-10-03 15:25:14,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-03 15:25:14,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-10-03 15:25:14,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2022-10-03 15:25:14,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-10-03 15:25:14,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2022-10-03 15:25:14,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2022-10-03 15:25:14,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-10-03 15:25:14,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-10-03 15:25:14,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2022-10-03 15:25:14,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-03 15:25:14,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-10-03 15:25:14,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-03 15:25:14,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:25:14,834 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:25:14,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:25:14,835 INFO L85 PathProgramCache]: Analyzing trace with hash 364700212, now seen corresponding path program 1 times [2022-10-03 15:25:14,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:25:14,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595277286] [2022-10-03 15:25:14,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:25:14,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:25:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:25:21,102 INFO L134 CoverageAnalysis]: Checked inductivity of 25256 backedges. 3792 proven. 10528 refuted. 0 times theorem prover too weak. 10936 trivial. 0 not checked. [2022-10-03 15:25:21,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:25:21,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595277286] [2022-10-03 15:25:21,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595277286] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:25:21,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112693230] [2022-10-03 15:25:21,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:25:21,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:25:21,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:25:21,135 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 15:25:21,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-03 15:25:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:25:23,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 13609 conjuncts, 411 conjunts are in the unsatisfiable core [2022-10-03 15:25:23,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:25:23,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 15:25:23,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:25:23,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-03 15:25:24,692 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 15:25:24,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-03 15:25:24,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-03 15:25:32,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:25:32,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-03 15:25:34,484 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:25:34,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-10-03 15:25:35,411 INFO L356 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2022-10-03 15:25:35,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-10-03 15:25:35,415 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 20 treesize of output 22 [2022-10-03 15:25:39,425 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 27 treesize of output 19 [2022-10-03 15:25:40,024 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 18 treesize of output 17 [2022-10-03 15:25:42,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-10-03 15:25:44,370 INFO L356 Elim1Store]: treesize reduction 80, result has 17.5 percent of original size [2022-10-03 15:25:44,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 35 [2022-10-03 15:25:45,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:25:45,796 INFO L356 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-10-03 15:25:45,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 55 [2022-10-03 15:25:45,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:25:45,801 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 38 treesize of output 36 [2022-10-03 15:25:45,806 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 25 treesize of output 13 [2022-10-03 15:25:45,832 INFO L134 CoverageAnalysis]: Checked inductivity of 25256 backedges. 10022 proven. 4867 refuted. 0 times theorem prover too weak. 10367 trivial. 0 not checked. [2022-10-03 15:25:45,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 15:25:45,851 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5514 (Array Int Int))) (not (= |c_#memory_$Pointer$.base| (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5514)))) is different from false [2022-10-03 15:25:48,724 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5514 (Array Int Int))) (let ((.cse0 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5514))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) (select (select .cse0 |c_ULTIMATE.start_fifo_empty_~self#1.base|) (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4)))) (not (let ((.cse1 (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))))) is different from false [2022-10-03 15:25:48,747 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5514 (Array Int Int))) (let ((.cse1 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5514))) (or (not (let ((.cse0 (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (not (let ((.cse2 (select .cse1 |c_ULTIMATE.start_fifo_empty_~self#1.base|))) (= (select .cse2 (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4)) (select .cse2 |c_ULTIMATE.start_fifo_empty_~self#1.offset|))))))) is different from false [2022-10-03 15:25:48,756 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5514 (Array Int Int))) (let ((.cse1 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5514))) (or (not (let ((.cse0 (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (not (let ((.cse2 (select .cse1 |c_ULTIMATE.start_fifo_empty_#in~self#1.base|))) (= (select .cse2 (+ 4 |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|)) (select .cse2 |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|))))))) is different from false [2022-10-03 15:25:48,765 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse0 (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) is different from false [2022-10-03 15:25:48,856 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse0 (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) is different from false [2022-10-03 15:25:48,861 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) is different from false [2022-10-03 15:25:48,866 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (forall ((v_ArrVal_5511 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511) |c_#memory_$Pointer$.base|)))) is different from false [2022-10-03 15:25:49,142 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse0 (select (store (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_write~$Pointer$_#value#1.base|)) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (forall ((v_ArrVal_5511 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511) (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_write~$Pointer$_#value#1.base|)))))) is different from false [2022-10-03 15:25:49,157 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse0 (select (store (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem41#1.base|)) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (forall ((v_ArrVal_5511 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511) (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem41#1.base|)))))) is different from false [2022-10-03 15:25:49,165 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse0 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem41#1.base|)) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) (forall ((v_ArrVal_5511 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511) (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem41#1.base|)))))) is different from false [2022-10-03 15:25:49,177 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_5511 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511) (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|))))) (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse0 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|)) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) is different from false [2022-10-03 15:25:49,183 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse0 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) (forall ((v_ArrVal_5511 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511) (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))))))) is different from false [2022-10-03 15:25:49,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 100 [2022-10-03 15:25:51,408 INFO L356 Elim1Store]: treesize reduction 162, result has 22.5 percent of original size [2022-10-03 15:25:51,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 124 treesize of output 87 [2022-10-03 15:25:52,338 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 24 treesize of output 15 [2022-10-03 15:25:52,344 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5511 (Array Int Int)) (v_ArrVal_5514 (Array Int Int))) (let ((.cse4 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse2 (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select .cse0 .cse1) .cse2)) (not (let ((.cse3 (select (store .cse4 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse3 .cse1) (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (= |c_ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| .cse2)))))) is different from false [2022-10-03 15:25:52,355 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5511 (Array Int Int)) (v_ArrVal_5514 (Array Int Int))) (let ((.cse4 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse2 (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select .cse0 .cse1) .cse2)) (not (let ((.cse3 (select (store .cse4 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse3 .cse1) (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (= |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base| .cse2)))))) is different from false [2022-10-03 15:25:52,577 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5511 (Array Int Int)) (v_ArrVal_5514 (Array Int Int))) (let ((.cse4 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (or (= |c_ULTIMATE.start_fifo_drop_head_#t~mem35#1.base| .cse0) (not (= (select .cse1 .cse2) .cse0)) (not (let ((.cse3 (select (store .cse4 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse3 .cse2) (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))))))) is different from false [2022-10-03 15:25:52,590 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5511 (Array Int Int)) (v_ArrVal_5514 (Array Int Int))) (let ((.cse4 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (or (not (= (select .cse0 .cse1) .cse2)) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.base| .cse2) (not (let ((.cse3 (select (store .cse4 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse3 .cse1) (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))))))) is different from false [2022-10-03 15:25:52,598 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5511 (Array Int Int)) (v_ArrVal_5514 (Array Int Int))) (let ((.cse4 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (or (not (= (select .cse0 .cse1) .cse2)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) .cse2) (not (let ((.cse3 (select (store .cse4 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse3 .cse1) (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))))))) is different from false [2022-10-03 15:25:52,623 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5511 (Array Int Int)) (v_ArrVal_5514 (Array Int Int))) (let ((.cse4 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse2 (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select .cse0 .cse1) .cse2)) (not (let ((.cse3 (select (store .cse4 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse3 .cse1) (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|) .cse2)))))) is different from false [2022-10-03 15:25:52,636 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5511 (Array Int Int)) (v_ArrVal_5514 (Array Int Int))) (let ((.cse4 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (or (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset|) .cse0) (not (= (select .cse1 .cse2) .cse0)) (not (let ((.cse3 (select (store .cse4 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse3 .cse2) (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))))))) is different from false [2022-10-03 15:25:52,650 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5511 (Array Int Int)) (v_ArrVal_5514 (Array Int Int))) (let ((.cse4 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse2 (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select .cse0 .cse1) .cse2)) (not (let ((.cse3 (select (store .cse4 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse3 .cse1) (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) .cse2)))))) is different from false [2022-10-03 15:25:53,017 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:25:53,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-10-03 15:25:53,038 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_5511 (Array Int Int)) (v_ArrVal_5514 (Array Int Int))) (let ((.cse7 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse8 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511))) (or (not (let ((.cse6 (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse6 .cse7) (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (not (let ((.cse9 (select (store .cse8 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse9 .cse7) (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))))))) (and (or (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) .cse0) (forall ((v_ArrVal_5511 (Array Int Int)) (v_ArrVal_5514 (Array Int Int))) (let ((.cse5 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse3 (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (or (not (= (select .cse1 .cse2) .cse3)) (= |c_ULTIMATE.start_fifo_pop_#t~mem50#1.base| .cse3) (not (let ((.cse4 (select (store .cse5 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse4 .cse2) (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))))))) (or (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) .cse0))) is different from false [2022-10-03 15:25:53,099 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_5511 (Array Int Int))) (not (let ((.cse5 (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) (.cse1 (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse4 (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse4 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))))) (and (or .cse0 .cse1 (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (or (forall ((v_ArrVal_5511 (Array Int Int))) (let ((.cse3 (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= .cse2 |c_ULTIMATE.start_fifo_pop_#t~mem50#1.base|) (not (= .cse2 (select .cse3 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))))) .cse1) (or (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) .cse0 .cse1))) is different from false [2022-10-03 15:25:53,128 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_5511 (Array Int Int))) (not (let ((.cse5 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))) (.cse1 (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse4 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse4 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))))) (and (or .cse0 .cse1 (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (or (forall ((v_ArrVal_5511 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select .cse2 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse3)) (= |c_ULTIMATE.start_fifo_pop_#t~mem50#1.base| .cse3))))) .cse1) (or .cse0 .cse1 (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) is different from false [2022-10-03 15:25:53,200 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_5511 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse1)) (= |c_ULTIMATE.start_fifo_pop_#t~mem50#1.base| .cse1))))) (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse2 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse2 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) is different from false [2022-10-03 15:25:53,215 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (forall ((v_ArrVal_5511 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse2)) (= .cse2 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|)))))) is different from false [2022-10-03 15:25:53,222 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (forall ((v_ArrVal_5511 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse2)) (= .cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))))))) is different from false [2022-10-03 15:25:53,243 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_5511 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse1)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem48#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem48#1.offset|) .cse1))))) (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse2 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse2 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) is different from false [2022-10-03 15:25:53,260 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (forall ((v_ArrVal_5511 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse2)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) |c_ULTIMATE.start_read~$Pointer$_#value#1.offset|) .cse2)))))) is different from false [2022-10-03 15:25:53,267 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (forall ((v_ArrVal_5511 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse2)) (= (select (select |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|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) .cse2)))))) is different from false [2022-10-03 15:25:53,289 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (forall ((v_ArrVal_5511 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= .cse1 (select (select |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|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (not (= (select .cse2 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse1))))))) is different from false [2022-10-03 15:25:55,062 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5506 Int) (v_ArrVal_5511 (Array Int Int)) (v_ArrVal_5505 (Array Int Int))) (let ((.cse4 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| v_ArrVal_5506)))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse0 (select (store .cse4 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse2 (select (select .cse4 .cse3) (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_5505) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (or (not (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse1)) (= .cse2 .cse1) (not (= .cse3 .cse2))))))) is different from false [2022-10-03 15:25:55,091 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5506 Int) (v_ArrVal_5511 (Array Int Int)) (v_ArrVal_5505 (Array Int Int))) (let ((.cse4 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_5506)))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse2 (select (store .cse4 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse1 (select (select .cse4 .cse3) (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_5505) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (or (= .cse0 .cse1) (not (= .cse0 (select .cse2 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))) (not (= .cse1 .cse3))))))) is different from false [2022-10-03 15:25:55,108 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5506 Int) (v_ArrVal_5511 (Array Int Int)) (v_ArrVal_5505 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_5506)))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse2 (select (store .cse4 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse0 (select (select .cse4 .cse3) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_5505) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (or (= .cse0 .cse1) (not (= (select .cse2 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse1)) (not (= .cse0 .cse3))))))) is different from false [2022-10-03 15:25:59,438 INFO L356 Elim1Store]: treesize reduction 183, result has 56.2 percent of original size [2022-10-03 15:25:59,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 22 case distinctions, treesize of input 609 treesize of output 580 [2022-10-03 15:25:59,691 INFO L356 Elim1Store]: treesize reduction 181, result has 56.2 percent of original size [2022-10-03 15:25:59,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 26 case distinctions, treesize of input 585 treesize of output 662 [2022-10-03 15:25:59,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 156 [2022-10-03 15:27:51,428 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 32 treesize of output 22 [2022-10-03 15:27:51,587 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 15 treesize of output 11 [2022-10-03 15:27:51,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 22 treesize of output 16 [2022-10-03 15:27:51,700 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-10-03 15:27:51,718 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-10-03 15:27:51,769 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-10-03 15:27:51,908 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-10-03 15:27:52,163 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-10-03 15:27:52,178 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-10-03 15:27:52,237 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-10-03 15:27:52,303 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-10-03 15:27:52,322 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-10-03 15:27:52,433 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-10-03 15:27:52,453 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-10-03 15:27:52,533 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-10-03 15:27:52,578 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-10-03 15:27:52,607 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-10-03 15:27:52,681 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-10-03 15:28:13,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-10-03 15:28:29,517 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-03 15:28:29,517 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 13 treesize of output 12 [2022-10-03 15:28:29,761 INFO L134 CoverageAnalysis]: Checked inductivity of 25256 backedges. 9632 proven. 3493 refuted. 0 times theorem prover too weak. 10486 trivial. 1645 not checked. [2022-10-03 15:28:29,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112693230] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 15:28:29,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 15:28:29,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 110, 111] total 265 [2022-10-03 15:28:29,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718278947] [2022-10-03 15:28:29,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 15:28:29,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 265 states [2022-10-03 15:28:29,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:28:29,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 265 interpolants. [2022-10-03 15:28:29,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2954, Invalid=50231, Unknown=81, NotChecked=16694, Total=69960 [2022-10-03 15:28:29,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:28:29,776 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:28:29,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 265 states, 265 states have (on average 18.928301886792454) internal successors, (5016), 265 states have internal predecessors, (5016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:28:29,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:28:29,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-10-03 15:28:29,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 109 states. [2022-10-03 15:28:29,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-10-03 15:28:29,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 201 states. [2022-10-03 15:28:29,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-10-03 15:28:29,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 121 states. [2022-10-03 15:28:29,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 133 states. [2022-10-03 15:28:29,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-10-03 15:28:29,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 125 states. [2022-10-03 15:28:29,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 145 states. [2022-10-03 15:28:29,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2022-10-03 15:28:29,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-10-03 15:28:29,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 134 states. [2022-10-03 15:28:29,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-10-03 15:28:29,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-10-03 15:28:29,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:29:41,543 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse6 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse3 (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse7 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse2 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| .cse3) .cse7)) (.cse0 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse4 (select .cse8 .cse6))) (and (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) 1) (= .cse0 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (or (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse1 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) (forall ((v_ArrVal_5511 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511) (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))))))) (= .cse0 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= .cse2 .cse3) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset|) (= (select |c_#valid| .cse2) 0) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse4)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= .cse0 (select .cse5 .cse6)) (<= 0 .cse7) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= .cse4 .cse3) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|))))) is different from false [2022-10-03 15:29:41,550 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse11 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse3 (select .cse13 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse12 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse2 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| .cse3) .cse12)) (.cse0 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse4 (select .cse13 .cse11))) (and (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) 1) (= .cse0 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (or (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse1 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) (forall ((v_ArrVal_5511 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511) (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))))))) (= .cse2 .cse3) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset|) (= (select |c_#valid| .cse2) 0) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse4)) (forall ((v_ArrVal_5506 Int) (v_ArrVal_5511 (Array Int Int)) (v_ArrVal_5505 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_5506)))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse7 (select (store .cse9 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse5 (select (select .cse9 .cse8) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_5505) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (or (= .cse5 .cse6) (not (= (select .cse7 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse6)) (not (= .cse5 .cse8))))))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= .cse0 (select .cse10 .cse11)) (<= 0 .cse12) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= .cse4 .cse3) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|))))) is different from false [2022-10-03 15:29:41,558 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse10 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse2 (select .cse13 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse11 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse1 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| .cse2) .cse11)) (.cse0 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse3 (select .cse13 .cse10))) (and (= (select |c_#valid| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) 1) (= .cse0 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= .cse1 .cse2) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= (select |c_#valid| .cse1) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset|) |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse3)) (forall ((v_ArrVal_5506 Int) (v_ArrVal_5511 (Array Int Int)) (v_ArrVal_5505 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_5506)))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse6 (select (store .cse8 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse5 (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse4 (select (select .cse8 .cse7) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_5505) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (or (= .cse4 .cse5) (not (= (select .cse6 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse5)) (not (= .cse4 .cse7))))))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= .cse0 (select .cse9 .cse10)) (<= 0 .cse11) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (or (forall ((v_ArrVal_5511 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511) (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|))))) (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse12 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|)) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse12 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse12 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) (= .cse3 .cse2) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|))))) is different from false [2022-10-03 15:29:41,565 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse11 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse2 (select .cse13 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse12 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse1 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| .cse2) .cse12)) (.cse0 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse4 (select .cse13 .cse11))) (and (= (select |c_#valid| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset|) |c_ULTIMATE.start_fifo_pop_#t~mem41#1.base|) (= .cse0 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= .cse1 .cse2) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= (select |c_#valid| .cse1) 0) (or (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse3 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem41#1.base|)) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse3 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) (forall ((v_ArrVal_5511 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511) (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem41#1.base|)))))) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse4)) (forall ((v_ArrVal_5506 Int) (v_ArrVal_5511 (Array Int Int)) (v_ArrVal_5505 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_5506)))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse7 (select (store .cse9 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse5 (select (select .cse9 .cse8) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_5505) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (or (= .cse5 .cse6) (not (= (select .cse7 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse6)) (not (= .cse5 .cse8))))))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= .cse0 (select .cse10 .cse11)) (<= 0 .cse12) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= .cse4 .cse2) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|))))) is different from false [2022-10-03 15:29:41,573 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse11 (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse12 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse6 (select .cse13 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse9 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse5 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| .cse6) .cse9)) (.cse7 (select .cse13 .cse12)) (.cse8 (select .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (and (= (select |c_#valid| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) 1) (= |c_ULTIMATE.start_fifo_pop_#t~mem41#1.base| (select (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset|)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (forall ((v_ArrVal_5506 Int) (v_ArrVal_5511 (Array Int Int)) (v_ArrVal_5505 (Array Int Int))) (let ((.cse4 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_5506)))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse2 (select (store .cse4 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse1 (select (select .cse4 .cse3) (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_5505) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (or (= .cse0 .cse1) (not (= .cse0 (select .cse2 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))) (not (= .cse1 .cse3))))))) (= .cse5 .cse6) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= (select |c_#valid| .cse5) 0) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse7)) (= .cse8 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= 0 .cse9) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (or (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse10 (select (store (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem41#1.base|)) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse10 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (forall ((v_ArrVal_5511 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511) (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem41#1.base|)))))) (= .cse7 .cse6) (= (select .cse11 .cse12) .cse8) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|))))) is different from false [2022-10-03 15:29:41,581 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse11 (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse12 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse2 (select .cse13 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse10 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse1 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| .cse2) .cse10)) (.cse8 (select .cse13 .cse12)) (.cse0 (select .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (and (= |c_ULTIMATE.start_write~$Pointer$_#value#1.base| (select (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| .cse0) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset|)) (= .cse0 |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= .cse1 .cse2) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= (select |c_#valid| .cse1) 0) (forall ((v_ArrVal_5506 Int) (v_ArrVal_5511 (Array Int Int)) (v_ArrVal_5505 (Array Int Int))) (let ((.cse7 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| v_ArrVal_5506)))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse3 (select (store .cse7 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse5 (select (select .cse7 .cse6) (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_5505) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (or (not (= (select .cse3 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse4)) (= .cse5 .cse4) (not (= .cse6 .cse5))))))) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse8)) (or (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse9 (select (store (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_write~$Pointer$_#value#1.base|)) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse9 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (forall ((v_ArrVal_5511 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511) (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_write~$Pointer$_#value#1.base|)))))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= 0 .cse10) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= .cse8 .cse2) (= (select .cse11 .cse12) .cse0) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|))))) is different from false [2022-10-03 15:29:41,589 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse6 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse1 (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse7 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse0 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| .cse1) .cse7)) (.cse4 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse2 (select .cse8 .cse6))) (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= .cse0 .cse1) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= (select |c_#valid| .cse0) 0) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse2)) (or (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse3 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse3 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (forall ((v_ArrVal_5511 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511) |c_#memory_$Pointer$.base|)))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= .cse4 (select .cse5 .cse6)) (<= 0 .cse7) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= (select |c_#valid| .cse4) 1) (= .cse2 .cse1) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|))))) is different from false [2022-10-03 15:29:41,597 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse8 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse4 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse9 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse3 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| .cse4) .cse9)) (.cse2 (select .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse5 (select .cse10 .cse8))) (and (or (forall ((v_ArrVal_5511 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= .cse0 (select (select |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|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (not (= (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse0)))))) (not (= .cse2 (select (select |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|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= .cse3 .cse4) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= (select |c_#valid| .cse3) 0) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse5)) (or (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse6 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse6 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (forall ((v_ArrVal_5511 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511) |c_#memory_$Pointer$.base|)))) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= .cse2 (select .cse7 .cse8)) (<= 0 .cse9) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= (select |c_#valid| .cse2) 1) (= .cse5 .cse4) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|))))) is different from false [2022-10-03 15:29:41,604 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse6 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse2 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse7 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse1 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| .cse2) .cse7)) (.cse0 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse3 (select .cse10 .cse6))) (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= .cse0 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= .cse1 .cse2) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= (select |c_#valid| .cse1) 0) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse3)) (or (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse4 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse4 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (forall ((v_ArrVal_5511 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511) |c_#memory_$Pointer$.base|)))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= .cse0 (select .cse5 .cse6)) (<= 0 .cse7) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= (select |c_#valid| .cse0) 1) (or (not (= .cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) |c_ULTIMATE.start_read~$Pointer$_#value#1.offset|))) (forall ((v_ArrVal_5511 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= .cse8 (select (select |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|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (not (= (select .cse9 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse8))))))) (= .cse3 .cse2) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|))))) is different from false [2022-10-03 15:29:41,609 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse8 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse4 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse9 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse3 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| .cse4) .cse9)) (.cse0 (select .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse5 (select .cse10 .cse8))) (and (or (not (= .cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem43#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem43#1.offset|))) (forall ((v_ArrVal_5511 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= .cse1 (select (select |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|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (not (= (select .cse2 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse1))))))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_pop_#t~mem43#1.base| .cse0) (= .cse3 .cse4) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= (select |c_#valid| .cse3) 0) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse5)) (or (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse6 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse6 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (forall ((v_ArrVal_5511 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511) |c_#memory_$Pointer$.base|)))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= .cse0 (select .cse7 .cse8)) (<= 0 .cse9) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= .cse5 .cse4) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_pop_#t~mem43#1.offset|) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|))))) is different from false [2022-10-03 15:29:41,615 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse6 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse1 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse7 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse0 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| .cse1) .cse7)) (.cse2 (select .cse10 .cse6)) (.cse4 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (and (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= .cse0 .cse1) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= (select |c_#valid| .cse0) 0) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse2)) (or (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse3 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse3 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (forall ((v_ArrVal_5511 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511) |c_#memory_$Pointer$.base|)))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= .cse4 (select .cse5 .cse6)) (<= 0 .cse7) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (or (forall ((v_ArrVal_5511 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= .cse8 (select (select |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|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (not (= (select .cse9 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse8)))))) (not (= .cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)))) (= (select |c_#valid| .cse4) 1) (= .cse2 .cse1) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| .cse4) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|))))) is different from false [2022-10-03 15:29:41,622 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse6 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse1 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse7 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse0 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| .cse1) .cse7)) (.cse2 (select .cse10 .cse6)) (.cse4 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= .cse0 .cse1) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= (select |c_#valid| .cse0) 0) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse2)) (or (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse3 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse3 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (forall ((v_ArrVal_5511 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511) |c_#memory_$Pointer$.base|)))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= .cse4 (select .cse5 .cse6)) (<= 0 .cse7) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= (select |c_#valid| .cse4) 1) (= .cse2 .cse1) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.base| (select (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (forall ((v_ArrVal_5511 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= .cse8 (select (select |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|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (not (= (select .cse9 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse8)))))) (not (= .cse4 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|))) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|))))) is different from false [2022-10-03 15:29:41,627 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse6 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse2 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse7 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse1 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| .cse2) .cse7)) (.cse0 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse3 (select .cse10 .cse6))) (and (= |c_ULTIMATE.start_fifo_pop_#t~mem45#1.base| (select (select |c_#memory_$Pointer$.base| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= .cse1 .cse2) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= (select |c_#valid| .cse1) 0) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse3)) (or (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse4 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse4 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (forall ((v_ArrVal_5511 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511) |c_#memory_$Pointer$.base|)))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= .cse0 (select .cse5 .cse6)) (<= 0 .cse7) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (or (forall ((v_ArrVal_5511 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= .cse8 (select (select |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|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (not (= (select .cse9 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse8)))))) (not (= |c_ULTIMATE.start_fifo_pop_#t~mem45#1.base| .cse0))) (= (select |c_#valid| .cse0) 1) (= .cse3 .cse2) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|))))) is different from false [2022-10-03 15:29:41,633 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse6 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse2 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse7 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse1 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| .cse2) .cse7)) (.cse0 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse3 (select .cse10 .cse6))) (and (= |c_ULTIMATE.start_fifo_pop_#t~mem45#1.base| (select (select |c_#memory_$Pointer$.base| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= .cse1 .cse2) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= (select |c_#valid| .cse1) 0) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse3)) (or (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse4 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse4 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (forall ((v_ArrVal_5511 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511) |c_#memory_$Pointer$.base|)))) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= .cse0 (select .cse5 .cse6)) (<= 0 .cse7) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= .cse3 .cse2) (or (not (= |c_ULTIMATE.start_fifo_pop_#t~mem45#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (forall ((v_ArrVal_5511 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= .cse8 (select (select |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|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (not (= (select .cse9 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse8))))))) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|))))) is different from false [2022-10-03 15:29:41,640 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse6 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse2 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse7 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse1 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| .cse2) .cse7)) (.cse0 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse3 (select .cse10 .cse6))) (and (= |c_ULTIMATE.start_fifo_pop_#t~mem45#1.base| (select (select |c_#memory_$Pointer$.base| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= .cse0 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= .cse1 .cse2) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= (select |c_#valid| .cse1) 0) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse3)) (or (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse4 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse4 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (forall ((v_ArrVal_5511 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511) |c_#memory_$Pointer$.base|)))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= .cse0 (select .cse5 .cse6)) (<= 0 .cse7) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (or (forall ((v_ArrVal_5511 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= .cse8 (select (select |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|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (not (= (select .cse9 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse8)))))) (not (= |c_ULTIMATE.start_fifo_pop_#t~mem45#1.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|))) (= (select |c_#valid| .cse0) 1) (= .cse3 .cse2) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|))))) is different from false [2022-10-03 15:29:41,645 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse6 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse2 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse7 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse1 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| .cse2) .cse7)) (.cse0 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse3 (select .cse10 .cse6))) (and (= |c_ULTIMATE.start_fifo_pop_#t~mem45#1.base| (select (select |c_#memory_$Pointer$.base| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (= .cse0 |c_ULTIMATE.start_fifo_pop_#t~mem44#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= .cse1 .cse2) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= (select |c_#valid| .cse1) 0) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse3)) (or (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse4 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse4 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (forall ((v_ArrVal_5511 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511) |c_#memory_$Pointer$.base|)))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= .cse0 (select .cse5 .cse6)) (<= 0 .cse7) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= (select |c_#valid| .cse0) 1) (or (not (= |c_ULTIMATE.start_fifo_pop_#t~mem45#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem44#1.base|)) (forall ((v_ArrVal_5511 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= .cse8 (select (select |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|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (not (= (select .cse9 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse8))))))) (= .cse3 .cse2) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|))))) is different from false [2022-10-03 15:29:41,652 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse6 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse2 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse9 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse1 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| .cse2) .cse9)) (.cse4 (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse11 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse11 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) (.cse0 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse3 (select .cse10 .cse6))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= .cse1 .cse2) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= (select |c_#valid| .cse1) 0) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse3)) (or .cse4 (forall ((v_ArrVal_5511 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511) |c_#memory_$Pointer$.base|)))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= .cse0 (select .cse5 .cse6)) (or .cse4 (forall ((v_ArrVal_5511 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= .cse7 (select (select |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|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (not (= (select .cse8 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse7))))))) (<= 0 .cse9) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= .cse3 .cse2) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|))))) is different from false [2022-10-03 15:29:41,675 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse6 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse1 (select .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse9 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse0 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| .cse1) .cse9)) (.cse3 (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse12 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse12 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse12 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) (.cse4 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse2 (select .cse11 .cse6))) (and (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= .cse0 .cse1) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= (select |c_#valid| .cse0) 0) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse2)) (or .cse3 (forall ((v_ArrVal_5511 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511) |c_#memory_$Pointer$.base|)))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= .cse4 (select .cse5 .cse6)) (or .cse3 (forall ((v_ArrVal_5511 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select .cse7 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse8)) (= (select (select |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|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) .cse8)))))) (<= 0 .cse9) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (= (select (select |c_#memory_$Pointer$.base| .cse10) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) .cse10)) (= (select |c_#valid| .cse4) 1) (= .cse2 .cse1) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|))))) is different from false [2022-10-03 15:29:41,683 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse8 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse1 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse9 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse0 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| .cse1) .cse9)) (.cse2 (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse11 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse11 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) (.cse6 (select .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse5 (select .cse10 .cse8))) (and (<= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= .cse0 .cse1) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= (select |c_#valid| .cse0) 0) (or .cse2 (forall ((v_ArrVal_5511 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select .cse3 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse4)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) |c_ULTIMATE.start_read~$Pointer$_#value#1.offset|) .cse4)))))) (= (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) |c_ULTIMATE.start_read~$Pointer$_#value#1.offset|)) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse5)) (or .cse2 (forall ((v_ArrVal_5511 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511) |c_#memory_$Pointer$.base|)))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= .cse6 (select .cse7 .cse8)) (<= 0 .cse9) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= (select |c_#valid| .cse6) 1) (= .cse5 .cse1) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|))))) is different from false [2022-10-03 15:29:41,689 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse8 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse4 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse9 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse3 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| .cse4) .cse9)) (.cse2 (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse11 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse11 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) (.cse6 (select .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse5 (select .cse10 .cse8))) (and (or (forall ((v_ArrVal_5511 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse1)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem48#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem48#1.offset|) .cse1))))) .cse2) (<= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= .cse3 .cse4) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= (select |c_#valid| .cse3) 0) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse5)) (or .cse2 (forall ((v_ArrVal_5511 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511) |c_#memory_$Pointer$.base|)))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= .cse6 (select .cse7 .cse8)) (= (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem48#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem48#1.offset|)) (<= 0 .cse9) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= (select |c_#valid| .cse6) 1) (= .cse5 .cse4) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|))))) is different from false [2022-10-03 15:29:41,696 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse8 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse1 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse9 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse0 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| .cse1) .cse9)) (.cse3 (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse11 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse11 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) (.cse6 (select .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse2 (select .cse10 .cse8))) (and (<= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) (= .cse0 .cse1) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= (select |c_#valid| .cse0) 0) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse2)) (or .cse3 (forall ((v_ArrVal_5511 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511) |c_#memory_$Pointer$.base|)))) (or .cse3 (forall ((v_ArrVal_5511 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select .cse4 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse5)) (= .cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))))))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= .cse6 (select .cse7 .cse8)) (<= 0 .cse9) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= (select |c_#valid| .cse6) 1) (= .cse2 .cse1) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|))))) is different from false [2022-10-03 15:29:41,703 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse8 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse1 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse9 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse0 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| .cse1) .cse9)) (.cse2 (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse11 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse11 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) (.cse6 (select .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse5 (select .cse10 .cse8))) (and (<= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= .cse0 .cse1) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (or .cse2 (forall ((v_ArrVal_5511 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select .cse3 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse4)) (= .cse4 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|)))))) (= (select |c_#valid| .cse0) 0) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse5)) (or .cse2 (forall ((v_ArrVal_5511 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511) |c_#memory_$Pointer$.base|)))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= .cse6 (select .cse7 .cse8)) (<= 0 .cse9) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= (select |c_#valid| .cse6) 1) (= .cse5 .cse1) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|))))) is different from false [2022-10-03 15:29:41,708 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse6 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse1 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse7 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse0 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| .cse1) .cse7)) (.cse4 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse3 (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse11 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse11 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) (.cse2 (select .cse10 .cse6))) (and (<= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_pop_#t~mem50#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= .cse0 .cse1) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= (select |c_#valid| .cse0) 0) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse2)) (or .cse3 (forall ((v_ArrVal_5511 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511) |c_#memory_$Pointer$.base|)))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= .cse4 (select .cse5 .cse6)) (<= 0 .cse7) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= (select |c_#valid| .cse4) 1) (or (forall ((v_ArrVal_5511 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select .cse8 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse9)) (= |c_ULTIMATE.start_fifo_pop_#t~mem50#1.base| .cse9))))) .cse3) (= .cse2 .cse1) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|))))) is different from false [2022-10-03 15:29:41,715 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse9 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse4 (select .cse15 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse10 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse3 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| .cse4) .cse10)) (.cse2 (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse7 (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse6 (select .cse15 .cse9)) (.cse0 (forall ((v_ArrVal_5511 (Array Int Int))) (not (let ((.cse14 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse14 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse14 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))) (.cse1 (forall ((v_ArrVal_5514 (Array Int Int))) (not (let ((.cse13 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5514) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse13 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse13 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) (.cse5 (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (and (or .cse0 .cse1 .cse2) (<= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_pop_#t~mem50#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= .cse3 .cse4) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) .cse5 (= (select |c_#valid| .cse3) 0) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse6)) (or .cse1 (forall ((v_ArrVal_5511 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_5511) |c_#memory_$Pointer$.base|)))) .cse2 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= .cse7 (select .cse8 .cse9)) (<= 0 .cse10) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= (select |c_#valid| .cse7) 1) (or (forall ((v_ArrVal_5511 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5511) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select .cse11 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse12)) (= |c_ULTIMATE.start_fifo_pop_#t~mem50#1.base| .cse12))))) .cse1) (= .cse6 .cse4) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (or .cse0 .cse1 .cse5))))) is different from false [2022-10-03 15:29:42,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:29:42,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-03 15:29:42,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-10-03 15:29:42,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-03 15:29:42,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2022-10-03 15:29:42,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-03 15:29:42,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-10-03 15:29:42,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2022-10-03 15:29:42,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-10-03 15:29:42,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2022-10-03 15:29:42,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2022-10-03 15:29:42,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-10-03 15:29:42,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-10-03 15:29:42,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2022-10-03 15:29:42,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-03 15:29:42,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-10-03 15:29:42,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 223 states. [2022-10-03 15:29:42,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-10-03 15:29:43,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-10-03 15:29:43,023 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:29:43,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:29:43,024 INFO L85 PathProgramCache]: Analyzing trace with hash -797000920, now seen corresponding path program 2 times [2022-10-03 15:29:43,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:29:43,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917581270] [2022-10-03 15:29:43,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:29:43,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:29:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:29:50,329 INFO L134 CoverageAnalysis]: Checked inductivity of 28012 backedges. 4100 proven. 11778 refuted. 0 times theorem prover too weak. 12134 trivial. 0 not checked. [2022-10-03 15:29:50,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:29:50,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917581270] [2022-10-03 15:29:50,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917581270] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:29:50,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71748362] [2022-10-03 15:29:50,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-03 15:29:50,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:29:50,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:29:50,348 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 15:29:50,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-03 15:29:52,884 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-03 15:29:52,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-03 15:29:52,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 14130 conjuncts, 272 conjunts are in the unsatisfiable core [2022-10-03 15:29:53,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:29:53,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-03 15:29:53,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-03 15:29:53,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:29:53,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-03 15:29:53,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:29:53,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-03 15:29:54,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:29:54,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:29:54,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:29:54,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-10-03 15:29:54,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:29:54,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:29:54,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:29:54,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-10-03 15:29:54,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:29:54,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-10-03 15:29:54,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:29:54,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-10-03 15:29:55,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:29:55,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-10-03 15:29:55,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:29:55,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2022-10-03 15:29:57,784 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 15:29:57,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-03 15:29:58,443 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-10-03 15:29:58,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 67 [2022-10-03 15:29:58,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:29:58,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:29:58,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2022-10-03 15:30:03,008 INFO L134 CoverageAnalysis]: Checked inductivity of 28012 backedges. 936 proven. 0 refuted. 0 times theorem prover too weak. 27076 trivial. 0 not checked. [2022-10-03 15:30:03,009 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-03 15:30:03,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71748362] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:30:03,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-03 15:30:03,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [48] total 110 [2022-10-03 15:30:03,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971056100] [2022-10-03 15:30:03,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:30:03,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-10-03 15:30:03,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:30:03,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-10-03 15:30:03,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=444, Invalid=11546, Unknown=0, NotChecked=0, Total=11990 [2022-10-03 15:30:03,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:30:03,013 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:30:03,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 16.553846153846155) internal successors, (1076), 65 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:30:03,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:30:03,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-10-03 15:30:03,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 109 states. [2022-10-03 15:30:03,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-10-03 15:30:03,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 202 states. [2022-10-03 15:30:03,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-10-03 15:30:03,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 121 states. [2022-10-03 15:30:03,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 133 states. [2022-10-03 15:30:03,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-10-03 15:30:03,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 125 states. [2022-10-03 15:30:03,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 145 states. [2022-10-03 15:30:03,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2022-10-03 15:30:03,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-10-03 15:30:03,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 134 states. [2022-10-03 15:30:03,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-10-03 15:30:03,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-10-03 15:30:03,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 223 states. [2022-10-03 15:30:03,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Received shutdown request... [2022-10-03 15:30:16,699 WARN L249 SmtUtils]: Removed 8 from assertion stack [2022-10-03 15:30:16,726 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 15:30:16,726 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 15:30:16,726 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 15:30:16,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-10-03 15:30:16,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-10-03 15:30:16,900 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 121 for 92ms.. [2022-10-03 15:30:16,902 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-03 15:30:16,905 INFO L444 BasicCegarLoop]: Path program histogram: [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-03 15:30:16,906 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT was TIMEOUT (1/2) [2022-10-03 15:30:16,908 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-03 15:30:16,908 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-03 15:30:16,913 INFO L202 PluginConnector]: Adding new model divinefifo_1w1r.line1235.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 03:30:16 BasicIcfg [2022-10-03 15:30:16,913 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-03 15:30:16,914 INFO L158 Benchmark]: Toolchain (without parser) took 747124.23ms. Allocated memory was 188.7MB in the beginning and 5.4GB in the end (delta: 5.2GB). Free memory was 145.7MB in the beginning and 3.1GB in the end (delta: -2.9GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2022-10-03 15:30:16,914 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.12ms. Allocated memory is still 188.7MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-03 15:30:16,914 INFO L158 Benchmark]: Boogie Preprocessor took 79.68ms. Allocated memory is still 188.7MB. Free memory was 145.6MB in the beginning and 139.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-10-03 15:30:16,914 INFO L158 Benchmark]: RCFGBuilder took 1086.90ms. Allocated memory is still 188.7MB. Free memory was 139.2MB in the beginning and 103.4MB in the end (delta: 35.7MB). Peak memory consumption was 35.8MB. Max. memory is 8.0GB. [2022-10-03 15:30:16,914 INFO L158 Benchmark]: TraceAbstraction took 745943.28ms. Allocated memory was 188.7MB in the beginning and 5.4GB in the end (delta: 5.2GB). Free memory was 102.4MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2022-10-03 15:30:16,915 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.12ms. Allocated memory is still 188.7MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 79.68ms. Allocated memory is still 188.7MB. Free memory was 145.6MB in the beginning and 139.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1086.90ms. Allocated memory is still 188.7MB. Free memory was 139.2MB in the beginning and 103.4MB in the end (delta: 35.7MB). Peak memory consumption was 35.8MB. Max. memory is 8.0GB. * TraceAbstraction took 745943.28ms. Allocated memory was 188.7MB in the beginning and 5.4GB in the end (delta: 5.2GB). Free memory was 102.4MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 239, positive: 230, positive conditional: 230, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 442436, positive: 427875, positive conditional: 427875, positive unconditional: 0, negative: 14561, negative conditional: 14561, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 429661, positive: 427875, positive conditional: 0, positive unconditional: 427875, negative: 1786, negative conditional: 0, negative unconditional: 1786, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 34355, positive: 34207, positive conditional: 0, positive unconditional: 34207, negative: 148, negative conditional: 0, negative unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 429661, positive: 393668, positive conditional: 0, positive unconditional: 393668, negative: 1638, negative conditional: 0, negative unconditional: 1638, unknown: 34355, unknown conditional: 0, unknown unconditional: 34355] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 230, Positive conditional cache size: 0, Positive unconditional cache size: 230, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 9, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 869, positive: 842, positive conditional: 842, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 442436, positive: 427875, positive conditional: 427875, positive unconditional: 0, negative: 14561, negative conditional: 14561, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 429661, positive: 427875, positive conditional: 0, positive unconditional: 427875, negative: 1786, negative conditional: 0, negative unconditional: 1786, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 34355, positive: 34207, positive conditional: 0, positive unconditional: 34207, negative: 148, negative conditional: 0, negative unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 429661, positive: 393668, positive conditional: 0, positive unconditional: 393668, negative: 1638, negative conditional: 0, negative unconditional: 1638, unknown: 34355, unknown conditional: 0, unknown unconditional: 34355] , Statistics on independence cache: Total cache size (in pairs): 844, Positive cache size: 844, Positive conditional cache size: 0, Positive unconditional cache size: 844, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 36, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4577, positive: 4432, positive conditional: 4432, positive unconditional: 0, negative: 145, negative conditional: 145, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 442436, positive: 427875, positive conditional: 427875, positive unconditional: 0, negative: 14561, negative conditional: 14561, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 429661, positive: 427875, positive conditional: 0, positive unconditional: 427875, negative: 1786, negative conditional: 0, negative unconditional: 1786, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 34355, positive: 34207, positive conditional: 0, positive unconditional: 34207, negative: 148, negative conditional: 0, negative unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 429661, positive: 393668, positive conditional: 0, positive unconditional: 393668, negative: 1638, negative conditional: 0, negative unconditional: 1638, unknown: 34355, unknown conditional: 0, unknown unconditional: 34355] , Statistics on independence cache: Total cache size (in pairs): 2968, Positive cache size: 2967, Positive conditional cache size: 0, Positive unconditional cache size: 2967, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Independence queries for same thread: 180, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1531, positive: 1476, positive conditional: 1476, positive unconditional: 0, negative: 55, negative conditional: 55, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 442436, positive: 427875, positive conditional: 427875, positive unconditional: 0, negative: 14561, negative conditional: 14561, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 429661, positive: 427875, positive conditional: 0, positive unconditional: 427875, negative: 1786, negative conditional: 0, negative unconditional: 1786, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 34355, positive: 34207, positive conditional: 0, positive unconditional: 34207, negative: 148, negative conditional: 0, negative unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 429661, positive: 393668, positive conditional: 0, positive unconditional: 393668, negative: 1638, negative conditional: 0, negative unconditional: 1638, unknown: 34355, unknown conditional: 0, unknown unconditional: 34355] , Statistics on independence cache: Total cache size (in pairs): 3307, Positive cache size: 3305, Positive conditional cache size: 0, Positive unconditional cache size: 3305, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Independence queries for same thread: 234, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 7707, positive: 7487, positive conditional: 7487, positive unconditional: 0, negative: 220, negative conditional: 220, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 442436, positive: 427875, positive conditional: 427875, positive unconditional: 0, negative: 14561, negative conditional: 14561, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 429661, positive: 427875, positive conditional: 0, positive unconditional: 427875, negative: 1786, negative conditional: 0, negative unconditional: 1786, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 34355, positive: 34207, positive conditional: 0, positive unconditional: 34207, negative: 148, negative conditional: 0, negative unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 429661, positive: 393668, positive conditional: 0, positive unconditional: 393668, negative: 1638, negative conditional: 0, negative unconditional: 1638, unknown: 34355, unknown conditional: 0, unknown unconditional: 34355] , Statistics on independence cache: Total cache size (in pairs): 5771, Positive cache size: 5764, Positive conditional cache size: 0, Positive unconditional cache size: 5764, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Independence queries for same thread: 448, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2918, positive: 2824, positive conditional: 2824, positive unconditional: 0, negative: 94, negative conditional: 94, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 442436, positive: 427875, positive conditional: 427875, positive unconditional: 0, negative: 14561, negative conditional: 14561, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 429661, positive: 427875, positive conditional: 0, positive unconditional: 427875, negative: 1786, negative conditional: 0, negative unconditional: 1786, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 34355, positive: 34207, positive conditional: 0, positive unconditional: 34207, negative: 148, negative conditional: 0, negative unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 429661, positive: 393668, positive conditional: 0, positive unconditional: 393668, negative: 1638, negative conditional: 0, negative unconditional: 1638, unknown: 34355, unknown conditional: 0, unknown unconditional: 34355] , Statistics on independence cache: Total cache size (in pairs): 6006, Positive cache size: 5998, Positive conditional cache size: 0, Positive unconditional cache size: 5998, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Independence queries for same thread: 540, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 37796, positive: 36503, positive conditional: 36503, positive unconditional: 0, negative: 1293, negative conditional: 1293, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 442436, positive: 427875, positive conditional: 427875, positive unconditional: 0, negative: 14561, negative conditional: 14561, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 429661, positive: 427875, positive conditional: 0, positive unconditional: 427875, negative: 1786, negative conditional: 0, negative unconditional: 1786, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 34355, positive: 34207, positive conditional: 0, positive unconditional: 34207, negative: 148, negative conditional: 0, negative unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 429661, positive: 393668, positive conditional: 0, positive unconditional: 393668, negative: 1638, negative conditional: 0, negative unconditional: 1638, unknown: 34355, unknown conditional: 0, unknown unconditional: 34355] , Statistics on independence cache: Total cache size (in pairs): 15238, Positive cache size: 15138, Positive conditional cache size: 0, Positive unconditional cache size: 15138, Negative cache size: 100, Negative conditional cache size: 0, Negative unconditional cache size: 100, Independence queries for same thread: 1587, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 38065, positive: 36751, positive conditional: 36751, positive unconditional: 0, negative: 1314, negative conditional: 1314, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 442436, positive: 427875, positive conditional: 427875, positive unconditional: 0, negative: 14561, negative conditional: 14561, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 429661, positive: 427875, positive conditional: 0, positive unconditional: 427875, negative: 1786, negative conditional: 0, negative unconditional: 1786, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 34355, positive: 34207, positive conditional: 0, positive unconditional: 34207, negative: 148, negative conditional: 0, negative unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 429661, positive: 393668, positive conditional: 0, positive unconditional: 393668, negative: 1638, negative conditional: 0, negative unconditional: 1638, unknown: 34355, unknown conditional: 0, unknown unconditional: 34355] , Statistics on independence cache: Total cache size (in pairs): 18083, Positive cache size: 17966, Positive conditional cache size: 0, Positive unconditional cache size: 17966, Negative cache size: 117, Negative conditional cache size: 0, Negative unconditional cache size: 117, Independence queries for same thread: 2654, Statistics for Abstraction: - StatisticsResult: Independence relation #9 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 38730, positive: 37404, positive conditional: 37404, positive unconditional: 0, negative: 1326, negative conditional: 1326, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 442436, positive: 427875, positive conditional: 427875, positive unconditional: 0, negative: 14561, negative conditional: 14561, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 429661, positive: 427875, positive conditional: 0, positive unconditional: 427875, negative: 1786, negative conditional: 0, negative unconditional: 1786, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 34355, positive: 34207, positive conditional: 0, positive unconditional: 34207, negative: 148, negative conditional: 0, negative unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 429661, positive: 393668, positive conditional: 0, positive unconditional: 393668, negative: 1638, negative conditional: 0, negative unconditional: 1638, unknown: 34355, unknown conditional: 0, unknown unconditional: 34355] , Statistics on independence cache: Total cache size (in pairs): 18651, Positive cache size: 18531, Positive conditional cache size: 0, Positive unconditional cache size: 18531, Negative cache size: 120, Negative conditional cache size: 0, Negative unconditional cache size: 120, Independence queries for same thread: 3729, Statistics for Abstraction: - StatisticsResult: Independence relation #10 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 37100, positive: 35825, positive conditional: 35825, positive unconditional: 0, negative: 1275, negative conditional: 1275, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 442436, positive: 427875, positive conditional: 427875, positive unconditional: 0, negative: 14561, negative conditional: 14561, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 429661, positive: 427875, positive conditional: 0, positive unconditional: 427875, negative: 1786, negative conditional: 0, negative unconditional: 1786, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 34355, positive: 34207, positive conditional: 0, positive unconditional: 34207, negative: 148, negative conditional: 0, negative unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 429661, positive: 393668, positive conditional: 0, positive unconditional: 393668, negative: 1638, negative conditional: 0, negative unconditional: 1638, unknown: 34355, unknown conditional: 0, unknown unconditional: 34355] , Statistics on independence cache: Total cache size (in pairs): 18903, Positive cache size: 18783, Positive conditional cache size: 0, Positive unconditional cache size: 18783, Negative cache size: 120, Negative conditional cache size: 0, Negative unconditional cache size: 120, Independence queries for same thread: 4759, Statistics for Abstraction: - StatisticsResult: Independence relation #11 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 37684, positive: 36389, positive conditional: 36389, positive unconditional: 0, negative: 1295, negative conditional: 1295, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 442436, positive: 427875, positive conditional: 427875, positive unconditional: 0, negative: 14561, negative conditional: 14561, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 429661, positive: 427875, positive conditional: 0, positive unconditional: 427875, negative: 1786, negative conditional: 0, negative unconditional: 1786, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 34355, positive: 34207, positive conditional: 0, positive unconditional: 34207, negative: 148, negative conditional: 0, negative unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 429661, positive: 393668, positive conditional: 0, positive unconditional: 393668, negative: 1638, negative conditional: 0, negative unconditional: 1638, unknown: 34355, unknown conditional: 0, unknown unconditional: 34355] , Statistics on independence cache: Total cache size (in pairs): 19083, Positive cache size: 18963, Positive conditional cache size: 0, Positive unconditional cache size: 18963, Negative cache size: 120, Negative conditional cache size: 0, Negative unconditional cache size: 120, Independence queries for same thread: 5809, Statistics for Abstraction: - StatisticsResult: Independence relation #12 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 75344, positive: 72714, positive conditional: 72714, positive unconditional: 0, negative: 2630, negative conditional: 2630, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 442436, positive: 427875, positive conditional: 427875, positive unconditional: 0, negative: 14561, negative conditional: 14561, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 429661, positive: 427875, positive conditional: 0, positive unconditional: 427875, negative: 1786, negative conditional: 0, negative unconditional: 1786, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 34355, positive: 34207, positive conditional: 0, positive unconditional: 34207, negative: 148, negative conditional: 0, negative unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 429661, positive: 393668, positive conditional: 0, positive unconditional: 393668, negative: 1638, negative conditional: 0, negative unconditional: 1638, unknown: 34355, unknown conditional: 0, unknown unconditional: 34355] , Statistics on independence cache: Total cache size (in pairs): 23511, Positive cache size: 23387, Positive conditional cache size: 0, Positive unconditional cache size: 23387, Negative cache size: 124, Negative conditional cache size: 0, Negative unconditional cache size: 124, Independence queries for same thread: 7977, Statistics for Abstraction: - StatisticsResult: Independence relation #13 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 7434, positive: 7189, positive conditional: 7189, positive unconditional: 0, negative: 245, negative conditional: 245, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 442436, positive: 427875, positive conditional: 427875, positive unconditional: 0, negative: 14561, negative conditional: 14561, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 429661, positive: 427875, positive conditional: 0, positive unconditional: 427875, negative: 1786, negative conditional: 0, negative unconditional: 1786, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 34355, positive: 34207, positive conditional: 0, positive unconditional: 34207, negative: 148, negative conditional: 0, negative unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 429661, positive: 393668, positive conditional: 0, positive unconditional: 393668, negative: 1638, negative conditional: 0, negative unconditional: 1638, unknown: 34355, unknown conditional: 0, unknown unconditional: 34355] , Statistics on independence cache: Total cache size (in pairs): 23525, Positive cache size: 23401, Positive conditional cache size: 0, Positive unconditional cache size: 23401, Negative cache size: 124, Negative conditional cache size: 0, Negative unconditional cache size: 124, Independence queries for same thread: 8221, Statistics for Abstraction: - StatisticsResult: Independence relation #14 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 14605, positive: 14144, positive conditional: 14144, positive unconditional: 0, negative: 461, negative conditional: 461, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 442436, positive: 427875, positive conditional: 427875, positive unconditional: 0, negative: 14561, negative conditional: 14561, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 429661, positive: 427875, positive conditional: 0, positive unconditional: 427875, negative: 1786, negative conditional: 0, negative unconditional: 1786, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 34355, positive: 34207, positive conditional: 0, positive unconditional: 34207, negative: 148, negative conditional: 0, negative unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 429661, positive: 393668, positive conditional: 0, positive unconditional: 393668, negative: 1638, negative conditional: 0, negative unconditional: 1638, unknown: 34355, unknown conditional: 0, unknown unconditional: 34355] , Statistics on independence cache: Total cache size (in pairs): 27718, Positive cache size: 27589, Positive conditional cache size: 0, Positive unconditional cache size: 27589, Negative cache size: 129, Negative conditional cache size: 0, Negative unconditional cache size: 129, Independence queries for same thread: 8672, Statistics for Abstraction: - StatisticsResult: Independence relation #15 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 15763, positive: 15256, positive conditional: 15256, positive unconditional: 0, negative: 507, negative conditional: 507, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 442436, positive: 427875, positive conditional: 427875, positive unconditional: 0, negative: 14561, negative conditional: 14561, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 429661, positive: 427875, positive conditional: 0, positive unconditional: 427875, negative: 1786, negative conditional: 0, negative unconditional: 1786, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 34355, positive: 34207, positive conditional: 0, positive unconditional: 34207, negative: 148, negative conditional: 0, negative unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 429661, positive: 393668, positive conditional: 0, positive unconditional: 393668, negative: 1638, negative conditional: 0, negative unconditional: 1638, unknown: 34355, unknown conditional: 0, unknown unconditional: 34355] , Statistics on independence cache: Total cache size (in pairs): 27790, Positive cache size: 27661, Positive conditional cache size: 0, Positive unconditional cache size: 27661, Negative cache size: 129, Negative conditional cache size: 0, Negative unconditional cache size: 129, Independence queries for same thread: 9169, Statistics for Abstraction: - StatisticsResult: Independence relation #16 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 23742, positive: 23007, positive conditional: 23007, positive unconditional: 0, negative: 735, negative conditional: 735, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 442436, positive: 427875, positive conditional: 427875, positive unconditional: 0, negative: 14561, negative conditional: 14561, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 429661, positive: 427875, positive conditional: 0, positive unconditional: 427875, negative: 1786, negative conditional: 0, negative unconditional: 1786, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 34355, positive: 34207, positive conditional: 0, positive unconditional: 34207, negative: 148, negative conditional: 0, negative unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 429661, positive: 393668, positive conditional: 0, positive unconditional: 393668, negative: 1638, negative conditional: 0, negative unconditional: 1638, unknown: 34355, unknown conditional: 0, unknown unconditional: 34355] , Statistics on independence cache: Total cache size (in pairs): 30681, Positive cache size: 30551, Positive conditional cache size: 0, Positive unconditional cache size: 30551, Negative cache size: 130, Negative conditional cache size: 0, Negative unconditional cache size: 130, Independence queries for same thread: 9902, Statistics for Abstraction: - StatisticsResult: Independence relation #17 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 43001, positive: 41746, positive conditional: 41746, positive unconditional: 0, negative: 1255, negative conditional: 1255, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 442436, positive: 427875, positive conditional: 427875, positive unconditional: 0, negative: 14561, negative conditional: 14561, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 429661, positive: 427875, positive conditional: 0, positive unconditional: 427875, negative: 1786, negative conditional: 0, negative unconditional: 1786, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 34355, positive: 34207, positive conditional: 0, positive unconditional: 34207, negative: 148, negative conditional: 0, negative unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 429661, positive: 393668, positive conditional: 0, positive unconditional: 393668, negative: 1638, negative conditional: 0, negative unconditional: 1638, unknown: 34355, unknown conditional: 0, unknown unconditional: 34355] , Statistics on independence cache: Total cache size (in pairs): 30984, Positive cache size: 30848, Positive conditional cache size: 0, Positive unconditional cache size: 30848, Negative cache size: 136, Negative conditional cache size: 0, Negative unconditional cache size: 136, Independence queries for same thread: 11129, Statistics for Abstraction: - StatisticsResult: Independence relation #18 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 55324, positive: 53651, positive conditional: 53651, positive unconditional: 0, negative: 1673, negative conditional: 1673, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 442436, positive: 427875, positive conditional: 427875, positive unconditional: 0, negative: 14561, negative conditional: 14561, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 429661, positive: 427875, positive conditional: 0, positive unconditional: 427875, negative: 1786, negative conditional: 0, negative unconditional: 1786, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 34355, positive: 34207, positive conditional: 0, positive unconditional: 34207, negative: 148, negative conditional: 0, negative unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 429661, positive: 393668, positive conditional: 0, positive unconditional: 393668, negative: 1638, negative conditional: 0, negative unconditional: 1638, unknown: 34355, unknown conditional: 0, unknown unconditional: 34355] , Statistics on independence cache: Total cache size (in pairs): 34355, Positive cache size: 34207, Positive conditional cache size: 0, Positive unconditional cache size: 34207, Negative cache size: 148, Negative conditional cache size: 0, Negative unconditional cache size: 148, Independence queries for same thread: 12773, Statistics for Abstraction: - StatisticsResult: Independence relation #19 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 7, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 442436, positive: 427875, positive conditional: 427875, positive unconditional: 0, negative: 14561, negative conditional: 14561, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 429661, positive: 427875, positive conditional: 0, positive unconditional: 427875, negative: 1786, negative conditional: 0, negative unconditional: 1786, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 34355, positive: 34207, positive conditional: 0, positive unconditional: 34207, negative: 148, negative conditional: 0, negative unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 429661, positive: 393668, positive conditional: 0, positive unconditional: 393668, negative: 1638, negative conditional: 0, negative unconditional: 1638, unknown: 34355, unknown conditional: 0, unknown unconditional: 34355] , Statistics on independence cache: Total cache size (in pairs): 34355, Positive cache size: 34207, Positive conditional cache size: 0, Positive unconditional cache size: 34207, Negative cache size: 148, Negative conditional cache size: 0, Negative unconditional cache size: 148, Independence queries for same thread: 12775, Statistics for Abstraction: - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 121 for 92ms.. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 3 procedures, 1438 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 745.7s, OverallIterations: 18, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 348.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 1548, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 2.5s SsaConstructionTime, 22.5s SatisfiabilityAnalysisTime, 367.5s InterpolantComputationTime, 84586 NumberOfCodeBlocks, 84191 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 103854 ConstructedInterpolants, 2167 QuantifiedInterpolants, 695605 SizeOfPredicates, 750 NumberOfNonLiveVariables, 76372 ConjunctsInSsa, 1453 ConjunctsInUnsatCore, 30 InterpolantComputations, 15 PerfectInterpolantSequences, 317025/394752 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown