/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -i ../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo-bug_1w1r.line1197.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 14:26:36,948 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 14:26:36,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 14:26:36,982 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 14:26:36,982 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 14:26:36,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 14:26:36,986 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 14:26:36,988 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 14:26:36,989 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 14:26:36,993 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 14:26:36,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 14:26:36,995 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 14:26:36,995 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 14:26:36,996 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 14:26:36,997 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 14:26:36,999 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 14:26:37,000 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 14:26:37,001 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 14:26:37,002 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 14:26:37,006 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 14:26:37,007 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 14:26:37,008 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 14:26:37,009 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 14:26:37,010 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 14:26:37,015 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 14:26:37,015 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 14:26:37,015 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 14:26:37,016 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 14:26:37,017 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 14:26:37,017 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 14:26:37,017 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 14:26:37,018 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 14:26:37,019 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 14:26:37,019 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 14:26:37,020 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 14:26:37,020 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 14:26:37,020 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 14:26:37,021 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 14:26:37,021 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 14:26:37,021 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 14:26:37,022 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 14:26:37,022 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-03 14:26:37,044 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 14:26:37,044 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 14:26:37,045 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 14:26:37,045 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 14:26:37,045 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 14:26:37,045 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 14:26:37,046 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 14:26:37,046 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 14:26:37,046 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 14:26:37,046 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 14:26:37,047 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 14:26:37,047 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 14:26:37,047 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 14:26:37,047 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 14:26:37,047 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 14:26:37,047 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 14:26:37,047 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 14:26:37,047 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 14:26:37,047 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 14:26:37,047 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 14:26:37,048 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 14:26:37,048 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 14:26:37,048 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 14:26:37,048 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 14:26:37,048 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 14:26:37,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 14:26:37,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 14:26:37,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 14:26:37,048 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 14:26:37,048 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 14:26:37,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 14:26:37,048 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 14:26:37,049 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 14:26:37,049 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 14:26:37,049 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 14:26:37,049 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 14:26:37,049 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 14:26:37,049 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 14:26:37,049 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-03 14:26:37,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 14:26:37,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 14:26:37,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 14:26:37,250 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 14:26:37,251 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 14:26:37,252 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo-bug_1w1r.line1197.bpl [2022-10-03 14:26:37,252 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo-bug_1w1r.line1197.bpl' [2022-10-03 14:26:37,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 14:26:37,329 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 14:26:37,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 14:26:37,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 14:26:37,331 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 14:26:37,341 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1197.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:26:37" (1/1) ... [2022-10-03 14:26:37,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1197.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:26:37" (1/1) ... [2022-10-03 14:26:37,377 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1197.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:26:37" (1/1) ... [2022-10-03 14:26:37,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1197.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:26:37" (1/1) ... [2022-10-03 14:26:37,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1197.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:26:37" (1/1) ... [2022-10-03 14:26:37,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1197.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:26:37" (1/1) ... [2022-10-03 14:26:37,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1197.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:26:37" (1/1) ... [2022-10-03 14:26:37,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 14:26:37,475 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 14:26:37,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 14:26:37,476 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 14:26:37,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo-bug_1w1r.line1197.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:26:37" (1/1) ... [2022-10-03 14:26:37,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 14:26:37,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:26:37,525 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-03 14:26:37,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-03 14:26:37,558 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-10-03 14:26:37,558 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-10-03 14:26:37,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 14:26:37,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 14:26:37,559 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-03 14:26:37,671 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 14:26:37,672 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 14:26:38,478 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 14:26:38,490 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 14:26:38,491 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-03 14:26:38,493 INFO L202 PluginConnector]: Adding new model divinefifo-bug_1w1r.line1197.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:26:38 BoogieIcfgContainer [2022-10-03 14:26:38,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 14:26:38,495 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 14:26:38,495 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 14:26:38,499 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 14:26:38,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line1197.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:26:37" (1/2) ... [2022-10-03 14:26:38,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38b83716 and model type divinefifo-bug_1w1r.line1197.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:26:38, skipping insertion in model container [2022-10-03 14:26:38,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line1197.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:26:38" (2/2) ... [2022-10-03 14:26:38,501 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo-bug_1w1r.line1197.bpl [2022-10-03 14:26:38,507 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 14:26:38,513 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 14:26:38,513 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 14:26:38,513 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 14:26:38,626 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-10-03 14:26:38,690 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 14:26:38,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 14:26:38,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:26:38,696 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-03 14:26:38,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-10-03 14:26:38,734 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 14:26:38,739 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 14:26:38,754 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;@2549e0c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 14:26:38,754 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 14:26:39,041 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:26:39,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:26:39,045 INFO L85 PathProgramCache]: Analyzing trace with hash -683887104, now seen corresponding path program 1 times [2022-10-03 14:26:39,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:26:39,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412383635] [2022-10-03 14:26:39,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:26:39,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:26:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:26:39,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:26:39,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:26:39,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412383635] [2022-10-03 14:26:39,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412383635] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:26:39,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:26:39,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 14:26:39,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091503915] [2022-10-03 14:26:39,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:26:39,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 14:26:39,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:26:39,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 14:26:39,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 14:26:39,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:26:39,469 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:26:39,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 210.0) internal successors, (420), 2 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:26:39,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:26:39,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:26:39,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 14:26:39,695 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:26:39,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:26:39,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1772368179, now seen corresponding path program 1 times [2022-10-03 14:26:39,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:26:39,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468105782] [2022-10-03 14:26:39,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:26:39,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:26:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:26:42,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:26:42,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:26:42,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468105782] [2022-10-03 14:26:42,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468105782] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:26:42,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:26:42,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2022-10-03 14:26:42,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443366900] [2022-10-03 14:26:42,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:26:42,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-10-03 14:26:42,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:26:42,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-10-03 14:26:42,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=4213, Unknown=0, NotChecked=0, Total=4422 [2022-10-03 14:26:42,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:26:42,528 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:26:42,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 7.268656716417911) internal successors, (487), 67 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:26:42,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:26:42,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:26:55,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:26:55,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-10-03 14:26:55,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 14:26:55,725 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:26:55,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:26:55,726 INFO L85 PathProgramCache]: Analyzing trace with hash 171287167, now seen corresponding path program 1 times [2022-10-03 14:26:55,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:26:55,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595938562] [2022-10-03 14:26:55,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:26:55,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:26:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:26:55,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:26:55,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:26:55,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595938562] [2022-10-03 14:26:55,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595938562] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:26:55,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:26:55,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-10-03 14:26:55,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026270151] [2022-10-03 14:26:55,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:26:55,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-03 14:26:55,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:26:55,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-03 14:26:55,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-10-03 14:26:55,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:26:55,912 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:26:55,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 33.07692307692308) internal successors, (430), 14 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:26:55,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:26:55,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 95 states. [2022-10-03 14:26:55,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:27:05,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:27:05,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-10-03 14:27:05,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-10-03 14:27:05,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-03 14:27:05,659 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:27:05,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:27:05,660 INFO L85 PathProgramCache]: Analyzing trace with hash -580644669, now seen corresponding path program 1 times [2022-10-03 14:27:05,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:27:05,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281166113] [2022-10-03 14:27:05,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:27:05,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:27:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:27:29,518 INFO L134 CoverageAnalysis]: Checked inductivity of 114973 backedges. 82112 proven. 25073 refuted. 0 times theorem prover too weak. 7788 trivial. 0 not checked. [2022-10-03 14:27:29,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:27:29,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281166113] [2022-10-03 14:27:29,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281166113] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:27:29,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585080221] [2022-10-03 14:27:29,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:27:29,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:27:29,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:27:29,543 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 14:27:29,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-03 14:27:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:27:33,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 27119 conjuncts, 9 conjunts are in the unsatisfiable core [2022-10-03 14:27:34,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:27:40,740 INFO L134 CoverageAnalysis]: Checked inductivity of 114973 backedges. 101571 proven. 0 refuted. 0 times theorem prover too weak. 13402 trivial. 0 not checked. [2022-10-03 14:27:40,740 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-03 14:27:40,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585080221] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:27:40,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-03 14:27:40,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 15 [2022-10-03 14:27:40,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762036089] [2022-10-03 14:27:40,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:27:40,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-03 14:27:40,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:27:40,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-03 14:27:40,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2022-10-03 14:27:40,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:27:40,749 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:27:40,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 471.7) internal successors, (4717), 10 states have internal predecessors, (4717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:27:40,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:27:40,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-10-03 14:27:40,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-10-03 14:27:40,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:27:42,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:27:42,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-10-03 14:27:42,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-10-03 14:27:42,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-03 14:27:42,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-10-03 14:27:42,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-10-03 14:27:42,336 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:27:42,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:27:42,337 INFO L85 PathProgramCache]: Analyzing trace with hash 773918427, now seen corresponding path program 1 times [2022-10-03 14:27:42,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:27:42,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578057304] [2022-10-03 14:27:42,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:27:42,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:27:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:28:05,993 INFO L134 CoverageAnalysis]: Checked inductivity of 144346 backedges. 76397 proven. 4729 refuted. 0 times theorem prover too weak. 63220 trivial. 0 not checked. [2022-10-03 14:28:05,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:28:05,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578057304] [2022-10-03 14:28:05,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578057304] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:28:05,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365860974] [2022-10-03 14:28:05,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:28:05,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:28:05,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:28:06,012 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 14:28:06,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-03 14:28:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:28:12,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 28350 conjuncts, 122 conjunts are in the unsatisfiable core [2022-10-03 14:28:12,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:28:12,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-10-03 14:28:36,427 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 10 treesize of output 9 [2022-10-03 14:28:37,153 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-10-03 14:28:37,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-10-03 14:28:38,005 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-10-03 14:28:38,006 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 19 treesize of output 19 [2022-10-03 14:28:38,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:28:38,303 INFO L134 CoverageAnalysis]: Checked inductivity of 144346 backedges. 35347 proven. 28437 refuted. 0 times theorem prover too weak. 80562 trivial. 0 not checked. [2022-10-03 14:28:38,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 14:28:38,449 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4192 (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_4192)))) is different from false [2022-10-03 14:28:38,998 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| Int)) (not (= (select (store |c_ULTIMATE.start_ULTIMATE.dealloc_old_#valid#1| |ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| 0) (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) 1))) is different from false [2022-10-03 14:28:39,008 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| Int)) (not (= (select (store |c_#valid| |ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| 0) (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) 1))) is different from false [2022-10-03 14:28:39,227 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 34 treesize of output 25 [2022-10-03 14:28:39,230 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_1 (Array Int Int))) (= (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base|)) is different from false [2022-10-03 14:28:39,233 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_1 (Array Int Int))) (= (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base|)) is different from false [2022-10-03 14:28:39,267 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_1 (Array Int Int))) (= |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base| (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) is different from false [2022-10-03 14:28:39,271 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_1 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base|)) is different from false [2022-10-03 14:28:39,294 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_1 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_drop_head_#t~mem35#1.base|)) is different from false [2022-10-03 14:28:39,298 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_1 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_read~$Pointer$_#value#1.base|)) is different from false [2022-10-03 14:28:39,303 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:28:39,303 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 30 treesize of output 29 [2022-10-03 14:28:39,306 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 9 treesize of output 7 [2022-10-03 14:29:13,631 INFO L134 CoverageAnalysis]: Checked inductivity of 144346 backedges. 35722 proven. 23771 refuted. 0 times theorem prover too weak. 80095 trivial. 4758 not checked. [2022-10-03 14:29:13,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365860974] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 14:29:13,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 14:29:13,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42, 41] total 118 [2022-10-03 14:29:13,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47652695] [2022-10-03 14:29:13,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 14:29:13,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 118 states [2022-10-03 14:29:13,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:29:13,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2022-10-03 14:29:13,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=11242, Unknown=12, NotChecked=1998, Total=13806 [2022-10-03 14:29:13,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:29:13,655 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:29:13,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 118 states, 118 states have (on average 54.07627118644068) internal successors, (6381), 118 states have internal predecessors, (6381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:29:13,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:29:13,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-10-03 14:29:13,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-10-03 14:29:13,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-10-03 14:29:13,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:29:32,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:29:32,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-10-03 14:29:32,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-10-03 14:29:32,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-03 14:29:32,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2022-10-03 14:29:32,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-03 14:29:32,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:29:32,595 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:29:32,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:29:32,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1412006578, now seen corresponding path program 2 times [2022-10-03 14:29:32,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:29:32,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044597381] [2022-10-03 14:29:32,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:29:32,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:29:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:29:36,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4523 backedges. 798 proven. 0 refuted. 0 times theorem prover too weak. 3725 trivial. 0 not checked. [2022-10-03 14:29:36,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:29:36,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044597381] [2022-10-03 14:29:36,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044597381] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:29:36,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:29:36,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [75] imperfect sequences [] total 75 [2022-10-03 14:29:36,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167331844] [2022-10-03 14:29:36,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:29:36,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-10-03 14:29:36,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:29:36,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-10-03 14:29:36,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=5310, Unknown=0, NotChecked=0, Total=5550 [2022-10-03 14:29:36,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:29:36,277 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:29:36,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 17.466666666666665) internal successors, (1310), 75 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:29:36,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:29:36,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-10-03 14:29:36,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-10-03 14:29:36,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-10-03 14:29:36,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 131 states. [2022-10-03 14:29:36,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:29:56,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:29:56,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-10-03 14:29:56,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-10-03 14:29:56,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-03 14:29:56,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2022-10-03 14:29:56,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-10-03 14:29:56,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-03 14:29:56,368 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:29:56,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:29:56,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1512429419, now seen corresponding path program 1 times [2022-10-03 14:29:56,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:29:56,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895094207] [2022-10-03 14:29:56,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:29:56,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:29:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:30:01,410 INFO L134 CoverageAnalysis]: Checked inductivity of 7679 backedges. 1348 proven. 0 refuted. 0 times theorem prover too weak. 6331 trivial. 0 not checked. [2022-10-03 14:30:01,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:30:01,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895094207] [2022-10-03 14:30:01,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895094207] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:30:01,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:30:01,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [81] imperfect sequences [] total 81 [2022-10-03 14:30:01,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684023858] [2022-10-03 14:30:01,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:30:01,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-10-03 14:30:01,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:30:01,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-10-03 14:30:01,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=6227, Unknown=0, NotChecked=0, Total=6480 [2022-10-03 14:30:01,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:30:01,418 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:30:01,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 16.790123456790123) internal successors, (1360), 81 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:30:01,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:30:01,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-10-03 14:30:01,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-10-03 14:30:01,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-10-03 14:30:01,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 135 states. [2022-10-03 14:30:01,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 121 states. [2022-10-03 14:30:01,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:30:26,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:30:26,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-10-03 14:30:26,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-10-03 14:30:26,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-03 14:30:26,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2022-10-03 14:30:26,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2022-10-03 14:30:26,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2022-10-03 14:30:26,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-03 14:30:26,219 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:30:26,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:30:26,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1045046933, now seen corresponding path program 1 times [2022-10-03 14:30:26,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:30:26,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806514755] [2022-10-03 14:30:26,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:30:26,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:30:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:30:29,719 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 11 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:30:29,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:30:29,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806514755] [2022-10-03 14:30:29,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806514755] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:30:29,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651074454] [2022-10-03 14:30:29,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:30:29,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:30:29,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:30:29,723 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 14:30:29,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-03 14:30:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:30:30,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 2146 conjuncts, 224 conjunts are in the unsatisfiable core [2022-10-03 14:30:30,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:30:31,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-03 14:30:31,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-03 14:30:34,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 14:30:34,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:30:34,626 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-03 14:30:34,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 67 [2022-10-03 14:30:34,646 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-10-03 14:30:34,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 66 [2022-10-03 14:30:34,655 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 50 treesize of output 40 [2022-10-03 14:30:34,698 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 110 treesize of output 92 [2022-10-03 14:30:37,058 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 14:30:37,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 122 treesize of output 120 [2022-10-03 14:30:39,938 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-10-03 14:30:39,938 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-03 14:30:39,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651074454] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:30:39,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-03 14:30:39,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [91] total 154 [2022-10-03 14:30:39,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257148147] [2022-10-03 14:30:39,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:30:39,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-10-03 14:30:39,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:30:39,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-10-03 14:30:39,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=23066, Unknown=0, NotChecked=0, Total=23562 [2022-10-03 14:30:39,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:30:39,945 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:30:39,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 11.907692307692308) internal successors, (774), 65 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:30:39,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:30:39,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2022-10-03 14:30:39,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-10-03 14:30:39,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-10-03 14:30:39,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 157 states. [2022-10-03 14:30:39,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 125 states. [2022-10-03 14:30:39,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 136 states. [2022-10-03 14:30:39,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:30:52,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:30:52,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-10-03 14:30:52,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-10-03 14:30:52,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-03 14:30:52,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2022-10-03 14:30:52,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2022-10-03 14:30:52,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2022-10-03 14:30:52,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-10-03 14:30:52,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-10-03 14:30:52,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:30:52,827 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:30:52,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:30:52,828 INFO L85 PathProgramCache]: Analyzing trace with hash -759244486, now seen corresponding path program 1 times [2022-10-03 14:30:52,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:30:52,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944301942] [2022-10-03 14:30:52,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:30:52,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:30:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:30:57,619 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 11 proven. 318 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-03 14:30:57,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:30:57,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944301942] [2022-10-03 14:30:57,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944301942] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:30:57,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56735529] [2022-10-03 14:30:57,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:30:57,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:30:57,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:30:57,621 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 14:30:57,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-03 14:30:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:30:58,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 2304 conjuncts, 229 conjunts are in the unsatisfiable core [2022-10-03 14:30:58,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:30:58,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 14:30:59,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-03 14:30:59,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:30:59,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-03 14:31:00,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:31:00,161 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 14 treesize of output 16 [2022-10-03 14:31:00,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-03 14:31:00,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:31:00,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-03 14:31:02,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:31:02,456 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-10-03 14:31:02,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-10-03 14:31:03,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:31:03,103 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 25 treesize of output 30 [2022-10-03 14:31:03,107 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 35 treesize of output 33 [2022-10-03 14:31:08,531 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 14:31:08,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 66 [2022-10-03 14:31:08,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:31:08,547 INFO L356 Elim1Store]: treesize reduction 37, result has 7.5 percent of original size [2022-10-03 14:31:08,547 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 2 case distinctions, treesize of input 59 treesize of output 36 [2022-10-03 14:31:12,982 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 11 proven. 252 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-10-03 14:31:12,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 14:31:15,208 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4914 (Array Int Int)) (v_ArrVal_4916 Int)) (let ((.cse1 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_4916)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< (+ |c_ULTIMATE.start_fifo_pop_#t~mem41#1.offset| 4) v_ArrVal_4916) (not (<= 0 .cse0)) (< (select (select .cse1 (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_4914) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse0) (+ 12 .cse0)))))) is different from false [2022-10-03 14:31:15,224 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4914 (Array Int Int)) (v_ArrVal_4916 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_4916)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< (+ |c_ULTIMATE.start_fifo_pop_#t~mem41#1.offset| 4) v_ArrVal_4916) (not (<= 0 .cse0)) (< (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_4914) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse0) (+ .cse0 12)))))) is different from false [2022-10-03 14:31:15,242 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4914 (Array Int Int)) (v_ArrVal_4916 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_4916)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (<= 0 .cse0)) (< (+ |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| 4) v_ArrVal_4916) (< (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_4914) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse0) (+ .cse0 12)))))) is different from false [2022-10-03 14:31:15,250 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4914 (Array Int Int)) (v_ArrVal_4916 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_4916)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (<= 0 .cse0)) (< (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) 4) v_ArrVal_4916) (< (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_4914) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse0) (+ .cse0 12)))))) is different from false [2022-10-03 14:31:15,275 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4914 (Array Int Int)) (v_ArrVal_4916 Int)) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store .cse2 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_4916)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (<= 0 .cse0)) (< (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_4914) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse0) (+ .cse0 12)) (< (+ (select .cse2 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset|) 4) v_ArrVal_4916)))))) is different from false [2022-10-03 14:31:15,293 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4914 (Array Int Int)) (v_ArrVal_4916 Int)) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| (store .cse0 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| v_ArrVal_4916)))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset|) 4) v_ArrVal_4916) (not (<= 0 .cse1)) (< (select (select .cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_4914) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1) (+ .cse1 12))))))) is different from false [2022-10-03 14:31:15,305 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4914 (Array Int Int)) (v_ArrVal_4916 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| .cse1)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse1 (store .cse3 .cse4 v_ArrVal_4916)))) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4914) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse2) (+ 12 .cse2)) (< (+ (select .cse3 .cse4) 4) v_ArrVal_4916) (not (<= 0 .cse2)))))))) is different from false [2022-10-03 14:31:15,340 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4914 (Array Int Int)) (v_ArrVal_4916 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| .cse4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse4 (store .cse0 .cse1 v_ArrVal_4916)))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< (+ (select .cse0 .cse1) 4) v_ArrVal_4916) (not (<= 0 .cse2)) (< (select (select .cse3 (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_4914) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse2) (+ .cse2 12)))))))) is different from false [2022-10-03 14:31:15,811 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4914 (Array Int Int)) (v_ArrVal_4916 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#in~self#1.base|) |c_ULTIMATE.start_fifo_pop_#in~self#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| .cse3)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#in~self#1.base|) |c_ULTIMATE.start_fifo_pop_#in~self#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| .cse3 (store .cse0 .cse1 v_ArrVal_4916)))) (let ((.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< (+ (select .cse0 .cse1) 4) v_ArrVal_4916) (< (select (select .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_4914) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse4) (+ 12 .cse4)) (not (<= 0 .cse4)))))))) is different from false [2022-10-03 14:31:15,828 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4916 Int) (v_ArrVal_4914 (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| .cse4)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse4 (store .cse1 .cse2 v_ArrVal_4916)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (<= 0 .cse0)) (< (+ (select .cse1 .cse2) 4) v_ArrVal_4916) (< (select (select .cse3 (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_4914) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse0) (+ .cse0 12)))))))) is different from false [2022-10-03 14:31:18,114 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4912 (Array Int Int)) (v_ArrVal_4913 (Array Int Int)) (v_ArrVal_4916 Int) (v_ArrVal_4914 (Array Int Int))) (let ((.cse1 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_4912))) (let ((.cse6 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_4913)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse4 (select .cse6 .cse2)) (.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse0 (store .cse6 .cse2 (store .cse4 .cse5 v_ArrVal_4916)))) (let ((.cse3 (select (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< (select (select .cse0 (select (select (store .cse1 .cse2 v_ArrVal_4914) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse3) (+ .cse3 12)) (< (+ 4 (select .cse4 .cse5)) v_ArrVal_4916) (not (<= 0 .cse3))))))))) is different from false [2022-10-03 14:31:18,151 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4912 (Array Int Int)) (v_ArrVal_4913 (Array Int Int)) (v_ArrVal_4916 Int) (v_ArrVal_4914 (Array Int Int))) (let ((.cse4 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_4912))) (let ((.cse6 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_4913)) (.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse1 (select .cse6 .cse5)) (.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse3 (store .cse6 .cse5 (store .cse1 .cse2 v_ArrVal_4916)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (<= 0 .cse0)) (< (+ 4 (select .cse1 .cse2)) v_ArrVal_4916) (< (select (select .cse3 (select (select (store .cse4 .cse5 v_ArrVal_4914) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse0) (+ .cse0 12))))))))) is different from false [2022-10-03 14:31:18,169 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4912 (Array Int Int)) (v_ArrVal_4913 (Array Int Int)) (v_ArrVal_4916 Int) (v_ArrVal_4914 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_4912))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_4913)) (.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse0 (select .cse6 .cse5)) (.cse1 (select (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse3 (store .cse6 .cse5 (store .cse0 .cse1 v_ArrVal_4916)))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< (+ (select .cse0 .cse1) 4) v_ArrVal_4916) (not (<= 0 .cse2)) (< (select (select .cse3 (select (select (store .cse4 .cse5 v_ArrVal_4914) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse2) (+ .cse2 12))))))))) is different from false [2022-10-03 14:31:18,203 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4912 (Array Int Int)) (v_ArrVal_4913 (Array Int Int)) (v_ArrVal_4916 Int) (v_ArrVal_4914 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_4912))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_4913)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse4 (select .cse6 .cse3)) (.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse1 (store .cse6 .cse3 (store .cse4 .cse5 v_ArrVal_4916)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (<= 0 .cse0)) (< (select (select .cse1 (select (select (store .cse2 .cse3 v_ArrVal_4914) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse0) (+ .cse0 12)) (< (+ (select .cse4 .cse5) 4) v_ArrVal_4916)))))))) is different from false [2022-10-03 14:31:19,672 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:31:19,674 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 409 treesize of output 329 [2022-10-03 14:31:19,694 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:31:19,694 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 2341 treesize of output 2220 [2022-10-03 14:31:19,702 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 2165 treesize of output 2053 [2022-10-03 14:31:19,708 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 1898 treesize of output 1886 [2022-10-03 14:31:25,960 INFO L356 Elim1Store]: treesize reduction 41, result has 43.8 percent of original size [2022-10-03 14:31:25,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 138 treesize of output 133 [2022-10-03 14:31:26,218 INFO L356 Elim1Store]: treesize reduction 10, result has 72.2 percent of original size [2022-10-03 14:31:26,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 99 [2022-10-03 14:31:26,582 INFO L356 Elim1Store]: treesize reduction 10, result has 72.2 percent of original size [2022-10-03 14:31:26,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 99 [2022-10-03 14:31:26,917 INFO L356 Elim1Store]: treesize reduction 10, result has 72.2 percent of original size [2022-10-03 14:31:26,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 99 [2022-10-03 14:31:32,681 INFO L356 Elim1Store]: treesize reduction 41, result has 43.8 percent of original size [2022-10-03 14:31:32,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 136 [2022-10-03 14:31:32,945 INFO L356 Elim1Store]: treesize reduction 41, result has 43.8 percent of original size [2022-10-03 14:31:32,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 136 [2022-10-03 14:31:34,458 INFO L356 Elim1Store]: treesize reduction 41, result has 43.8 percent of original size [2022-10-03 14:31:34,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 136 [2022-10-03 14:31:34,563 INFO L356 Elim1Store]: treesize reduction 10, result has 72.2 percent of original size [2022-10-03 14:31:34,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 99 [2022-10-03 14:31:34,773 INFO L356 Elim1Store]: treesize reduction 41, result has 43.8 percent of original size [2022-10-03 14:31:34,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 136 [2022-10-03 14:31:35,165 INFO L356 Elim1Store]: treesize reduction 41, result has 43.8 percent of original size [2022-10-03 14:31:35,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 136 [2022-10-03 14:31:35,274 INFO L356 Elim1Store]: treesize reduction 41, result has 43.8 percent of original size [2022-10-03 14:31:35,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 136 [2022-10-03 14:31:37,202 INFO L356 Elim1Store]: treesize reduction 41, result has 43.8 percent of original size [2022-10-03 14:31:37,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 138 treesize of output 133 [2022-10-03 14:31:37,340 INFO L356 Elim1Store]: treesize reduction 10, result has 72.2 percent of original size [2022-10-03 14:31:37,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 99 [2022-10-03 14:31:39,948 INFO L356 Elim1Store]: treesize reduction 41, result has 43.8 percent of original size [2022-10-03 14:31:39,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 138 treesize of output 133 [2022-10-03 14:31:40,835 INFO L356 Elim1Store]: treesize reduction 41, result has 43.8 percent of original size [2022-10-03 14:31:40,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 136 [2022-10-03 14:31:41,001 INFO L356 Elim1Store]: treesize reduction 10, result has 72.2 percent of original size [2022-10-03 14:31:41,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 99 [2022-10-03 14:31:41,357 INFO L356 Elim1Store]: treesize reduction 41, result has 43.8 percent of original size [2022-10-03 14:31:41,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 138 treesize of output 133 [2022-10-03 14:31:41,762 INFO L356 Elim1Store]: treesize reduction 41, result has 43.8 percent of original size [2022-10-03 14:31:41,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 138 treesize of output 133 [2022-10-03 14:31:42,537 INFO L356 Elim1Store]: treesize reduction 41, result has 43.8 percent of original size [2022-10-03 14:31:42,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 138 treesize of output 133 [2022-10-03 14:31:43,693 INFO L356 Elim1Store]: treesize reduction 41, result has 43.8 percent of original size [2022-10-03 14:31:43,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 138 treesize of output 133 [2022-10-03 14:31:44,032 INFO L356 Elim1Store]: treesize reduction 41, result has 43.8 percent of original size [2022-10-03 14:31:44,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 136 [2022-10-03 14:31:45,163 INFO L356 Elim1Store]: treesize reduction 41, result has 43.8 percent of original size [2022-10-03 14:31:45,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 136 [2022-10-03 14:31:45,311 INFO L356 Elim1Store]: treesize reduction 10, result has 72.2 percent of original size [2022-10-03 14:31:45,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 101 treesize of output 102 [2022-10-03 14:31:46,172 INFO L356 Elim1Store]: treesize reduction 10, result has 72.2 percent of original size [2022-10-03 14:31:46,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 99 [2022-10-03 14:31:46,410 INFO L356 Elim1Store]: treesize reduction 10, result has 72.2 percent of original size [2022-10-03 14:31:46,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 99