java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/linear_sea.ch.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-14 16:37:02,112 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-14 16:37:02,114 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-14 16:37:02,127 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-14 16:37:02,127 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-14 16:37:02,128 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-14 16:37:02,129 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-14 16:37:02,131 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-14 16:37:02,133 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-14 16:37:02,134 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-14 16:37:02,135 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-14 16:37:02,135 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-14 16:37:02,136 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-14 16:37:02,137 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-14 16:37:02,138 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-14 16:37:02,139 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-14 16:37:02,140 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-14 16:37:02,142 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-14 16:37:02,144 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-14 16:37:02,146 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-14 16:37:02,147 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-14 16:37:02,148 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-14 16:37:02,151 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-14 16:37:02,151 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-14 16:37:02,151 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-14 16:37:02,152 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-14 16:37:02,154 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-14 16:37:02,155 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-14 16:37:02,155 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-14 16:37:02,157 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-14 16:37:02,157 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-14 16:37:02,158 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-14 16:37:02,158 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-14 16:37:02,158 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-14 16:37:02,159 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-14 16:37:02,160 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-14 16:37:02,160 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-14 16:37:02,174 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-14 16:37:02,175 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-14 16:37:02,176 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-14 16:37:02,176 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-14 16:37:02,176 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-14 16:37:02,176 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-14 16:37:02,176 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-14 16:37:02,177 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-14 16:37:02,177 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-14 16:37:02,177 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-14 16:37:02,177 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-14 16:37:02,178 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-14 16:37:02,178 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-14 16:37:02,179 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-14 16:37:02,179 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-14 16:37:02,179 INFO L133 SettingsManager]: * Use SBE=true [2019-02-14 16:37:02,179 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-14 16:37:02,179 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-14 16:37:02,180 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-14 16:37:02,180 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-14 16:37:02,180 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-14 16:37:02,180 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-14 16:37:02,180 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-14 16:37:02,181 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-14 16:37:02,181 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-14 16:37:02,181 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-14 16:37:02,181 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-14 16:37:02,181 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-14 16:37:02,182 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-14 16:37:02,182 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-14 16:37:02,182 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-14 16:37:02,182 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-14 16:37:02,182 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-14 16:37:02,183 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-14 16:37:02,183 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-14 16:37:02,183 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-14 16:37:02,183 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-14 16:37:02,183 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-14 16:37:02,184 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-14 16:37:02,213 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-14 16:37:02,225 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-14 16:37:02,229 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-14 16:37:02,230 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-14 16:37:02,231 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-14 16:37:02,232 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/linear_sea.ch.i_4.bpl [2019-02-14 16:37:02,232 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/linear_sea.ch.i_4.bpl' [2019-02-14 16:37:02,283 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-14 16:37:02,285 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-14 16:37:02,286 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-14 16:37:02,286 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-14 16:37:02,286 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-14 16:37:02,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:37:02" (1/1) ... [2019-02-14 16:37:02,316 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:37:02" (1/1) ... [2019-02-14 16:37:02,324 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-14 16:37:02,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-14 16:37:02,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-14 16:37:02,326 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-14 16:37:02,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:37:02" (1/1) ... [2019-02-14 16:37:02,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:37:02" (1/1) ... [2019-02-14 16:37:02,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:37:02" (1/1) ... [2019-02-14 16:37:02,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:37:02" (1/1) ... [2019-02-14 16:37:02,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:37:02" (1/1) ... [2019-02-14 16:37:02,349 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:37:02" (1/1) ... [2019-02-14 16:37:02,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:37:02" (1/1) ... [2019-02-14 16:37:02,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-14 16:37:02,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-14 16:37:02,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-14 16:37:02,354 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-14 16:37:02,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:37:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-14 16:37:02,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-14 16:37:02,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-14 16:37:02,905 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-14 16:37:02,905 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-02-14 16:37:02,906 INFO L202 PluginConnector]: Adding new model linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 04:37:02 BoogieIcfgContainer [2019-02-14 16:37:02,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-14 16:37:02,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-14 16:37:02,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-14 16:37:02,913 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-14 16:37:02,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:37:02" (1/2) ... [2019-02-14 16:37:02,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ab969e and model type linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 04:37:02, skipping insertion in model container [2019-02-14 16:37:02,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 04:37:02" (2/2) ... [2019-02-14 16:37:02,916 INFO L112 eAbstractionObserver]: Analyzing ICFG linear_sea.ch.i_4.bpl [2019-02-14 16:37:02,927 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-14 16:37:02,940 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-14 16:37:02,957 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-14 16:37:02,995 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-14 16:37:02,996 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-14 16:37:02,996 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-14 16:37:02,996 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-14 16:37:02,996 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-14 16:37:02,997 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-14 16:37:02,998 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-14 16:37:02,998 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-14 16:37:03,015 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-02-14 16:37:03,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-14 16:37:03,031 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:37:03,033 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-14 16:37:03,040 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:37:03,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:37:03,047 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2019-02-14 16:37:03,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:37:03,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:37:03,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:37:03,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:37:03,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:37:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:37:03,643 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 10 [2019-02-14 16:37:03,766 INFO L273 TraceCheckUtils]: 0: Hoare triple {10#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE := 0;havoc main_#res;havoc main_#t~nondet3, main_#t~ret5, main_~#a~7.base, main_~#a~7.offset;~SIZE := (if main_#t~nondet3 % 4294967296 < 0 && main_#t~nondet3 % 4294967296 % 8 != 0 then main_#t~nondet3 % 4294967296 / 8 + 1 else main_#t~nondet3 % 4294967296 / 8) + 1;havoc main_#t~nondet3;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;#Ultimate.alloc_~size := ~SIZE % 4294967296 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#a~7.base, main_~#a~7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;write~int_old_#memory_int := #memory_int;write~int_#value, write~int_#ptr.base, write~int_#ptr.offset, write~int_#sizeOfWrittenType := 3, main_~#a~7.base, main_~#a~7.offset + (if ~SIZE % 4294967296 < 0 && ~SIZE % 4294967296 % 2 != 0 then ~SIZE % 4294967296 / 2 + 1 else ~SIZE % 4294967296 / 2) % 4294967296 * 4, 4;havoc #memory_int;assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base,write~int_#ptr.offset := write~int_#value];linear_search_#in~a.base, linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q := main_~#a~7.base, main_~#a~7.offset, (if ~SIZE % 4294967296 % 4294967296 <= 2147483647 then ~SIZE % 4294967296 % 4294967296 else ~SIZE % 4294967296 % 4294967296 - 4294967296), 3;havoc linear_search_#res;havoc linear_search_#t~post2, linear_search_#t~mem0, linear_search_#t~short1, linear_search_~a.base, linear_search_~a.offset, linear_search_~n, linear_search_~q, linear_search_~j~5;linear_search_~a.base, linear_search_~a.offset := linear_search_#in~a.base, linear_search_#in~a.offset;linear_search_~n := linear_search_#in~n;linear_search_~q := linear_search_#in~q;linear_search_~j~5 := 0; {12#(and (<= (div ~SIZE 4294967296) (div ULTIMATE.start_linear_search_~j~5 4294967296)) (<= (+ ULTIMATE.start_linear_search_~j~5 1) ~SIZE))} is VALID [2019-02-14 16:37:03,784 INFO L273 TraceCheckUtils]: 1: Hoare triple {12#(and (<= (div ~SIZE 4294967296) (div ULTIMATE.start_linear_search_~j~5 4294967296)) (<= (+ ULTIMATE.start_linear_search_~j~5 1) ~SIZE))} linear_search_#t~short1 := linear_search_~j~5 % 4294967296 < linear_search_~n % 4294967296;assume linear_search_#t~short1;read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := linear_search_~a.base, linear_search_~a.offset + linear_search_~j~5 % 4294967296 * 4, 4;havoc read~int_#value;assume read~int_#value == #memory_int[read~int_#ptr.base,read~int_#ptr.offset];linear_search_#t~mem0 := read~int_#value;linear_search_#t~short1 := linear_search_#t~mem0 != linear_search_~q; {12#(and (<= (div ~SIZE 4294967296) (div ULTIMATE.start_linear_search_~j~5 4294967296)) (<= (+ ULTIMATE.start_linear_search_~j~5 1) ~SIZE))} is VALID [2019-02-14 16:37:03,797 INFO L273 TraceCheckUtils]: 2: Hoare triple {12#(and (<= (div ~SIZE 4294967296) (div ULTIMATE.start_linear_search_~j~5 4294967296)) (<= (+ ULTIMATE.start_linear_search_~j~5 1) ~SIZE))} assume !linear_search_#t~short1;havoc linear_search_#t~mem0;havoc linear_search_#t~short1;assume !(linear_search_~j~5 % 4294967296 < ~SIZE % 4294967296);linear_search_#res := 0;main_#t~ret5 := linear_search_#res;assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;__VERIFIER_assert_#in~cond := main_#t~ret5;havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {11#false} is VALID [2019-02-14 16:37:03,798 INFO L273 TraceCheckUtils]: 3: Hoare triple {11#false} assume !false; {11#false} is VALID [2019-02-14 16:37:03,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:37:03,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-14 16:37:03,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-14 16:37:03,803 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-14 16:37:03,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-14 16:37:03,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:37:03,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-14 16:37:03,845 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:37:03,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-14 16:37:03,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-14 16:37:03,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-14 16:37:03,855 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-02-14 16:37:04,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:37:04,010 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-02-14 16:37:04,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-14 16:37:04,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-14 16:37:04,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:37:04,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-14 16:37:04,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-02-14 16:37:04,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-14 16:37:04,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-02-14 16:37:04,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 12 transitions. [2019-02-14 16:37:04,082 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:37:04,092 INFO L225 Difference]: With dead ends: 11 [2019-02-14 16:37:04,092 INFO L226 Difference]: Without dead ends: 7 [2019-02-14 16:37:04,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-14 16:37:04,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-14 16:37:04,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-14 16:37:04,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:37:04,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2019-02-14 16:37:04,187 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-02-14 16:37:04,188 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-02-14 16:37:04,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:37:04,189 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-02-14 16:37:04,190 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-14 16:37:04,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:37:04,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:37:04,191 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-02-14 16:37:04,191 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-02-14 16:37:04,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:37:04,192 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-02-14 16:37:04,192 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-14 16:37:04,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:37:04,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:37:04,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:37:04,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:37:04,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-14 16:37:04,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-02-14 16:37:04,196 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-02-14 16:37:04,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:37:04,197 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-02-14 16:37:04,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-14 16:37:04,197 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-14 16:37:04,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-14 16:37:04,198 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:37:04,198 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-14 16:37:04,198 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:37:04,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:37:04,199 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2019-02-14 16:37:04,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:37:04,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:37:04,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:37:04,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:37:04,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:37:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:37:05,048 WARN L181 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 16 [2019-02-14 16:37:05,417 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 14 [2019-02-14 16:37:05,429 INFO L273 TraceCheckUtils]: 0: Hoare triple {58#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE := 0;havoc main_#res;havoc main_#t~nondet3, main_#t~ret5, main_~#a~7.base, main_~#a~7.offset;~SIZE := (if main_#t~nondet3 % 4294967296 < 0 && main_#t~nondet3 % 4294967296 % 8 != 0 then main_#t~nondet3 % 4294967296 / 8 + 1 else main_#t~nondet3 % 4294967296 / 8) + 1;havoc main_#t~nondet3;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;#Ultimate.alloc_~size := ~SIZE % 4294967296 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#a~7.base, main_~#a~7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;write~int_old_#memory_int := #memory_int;write~int_#value, write~int_#ptr.base, write~int_#ptr.offset, write~int_#sizeOfWrittenType := 3, main_~#a~7.base, main_~#a~7.offset + (if ~SIZE % 4294967296 < 0 && ~SIZE % 4294967296 % 2 != 0 then ~SIZE % 4294967296 / 2 + 1 else ~SIZE % 4294967296 / 2) % 4294967296 * 4, 4;havoc #memory_int;assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base,write~int_#ptr.offset := write~int_#value];linear_search_#in~a.base, linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q := main_~#a~7.base, main_~#a~7.offset, (if ~SIZE % 4294967296 % 4294967296 <= 2147483647 then ~SIZE % 4294967296 % 4294967296 else ~SIZE % 4294967296 % 4294967296 - 4294967296), 3;havoc linear_search_#res;havoc linear_search_#t~post2, linear_search_#t~mem0, linear_search_#t~short1, linear_search_~a.base, linear_search_~a.offset, linear_search_~n, linear_search_~q, linear_search_~j~5;linear_search_~a.base, linear_search_~a.offset := linear_search_#in~a.base, linear_search_#in~a.offset;linear_search_~n := linear_search_#in~n;linear_search_~q := linear_search_#in~q;linear_search_~j~5 := 0; {60#(and (<= ~SIZE 536870912) (= ~SIZE (+ (* 4294967296 (div ~SIZE 4294967296)) ULTIMATE.start_linear_search_~n)) (< 0 (+ (div ULTIMATE.start_linear_search_~n 4294967296) (div ~SIZE 4294967296) 1)))} is VALID [2019-02-14 16:37:05,433 INFO L273 TraceCheckUtils]: 1: Hoare triple {60#(and (<= ~SIZE 536870912) (= ~SIZE (+ (* 4294967296 (div ~SIZE 4294967296)) ULTIMATE.start_linear_search_~n)) (< 0 (+ (div ULTIMATE.start_linear_search_~n 4294967296) (div ~SIZE 4294967296) 1)))} linear_search_#t~short1 := linear_search_~j~5 % 4294967296 < linear_search_~n % 4294967296;assume linear_search_#t~short1;read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := linear_search_~a.base, linear_search_~a.offset + linear_search_~j~5 % 4294967296 * 4, 4;havoc read~int_#value;assume read~int_#value == #memory_int[read~int_#ptr.base,read~int_#ptr.offset];linear_search_#t~mem0 := read~int_#value;linear_search_#t~short1 := linear_search_#t~mem0 != linear_search_~q; {60#(and (<= ~SIZE 536870912) (= ~SIZE (+ (* 4294967296 (div ~SIZE 4294967296)) ULTIMATE.start_linear_search_~n)) (< 0 (+ (div ULTIMATE.start_linear_search_~n 4294967296) (div ~SIZE 4294967296) 1)))} is VALID [2019-02-14 16:37:05,434 INFO L273 TraceCheckUtils]: 2: Hoare triple {60#(and (<= ~SIZE 536870912) (= ~SIZE (+ (* 4294967296 (div ~SIZE 4294967296)) ULTIMATE.start_linear_search_~n)) (< 0 (+ (div ULTIMATE.start_linear_search_~n 4294967296) (div ~SIZE 4294967296) 1)))} assume !!linear_search_#t~short1;havoc linear_search_#t~mem0;havoc linear_search_#t~short1;linear_search_#t~post2 := linear_search_~j~5;linear_search_~j~5 := linear_search_#t~post2 + 1;havoc linear_search_#t~post2; {60#(and (<= ~SIZE 536870912) (= ~SIZE (+ (* 4294967296 (div ~SIZE 4294967296)) ULTIMATE.start_linear_search_~n)) (< 0 (+ (div ULTIMATE.start_linear_search_~n 4294967296) (div ~SIZE 4294967296) 1)))} is VALID [2019-02-14 16:37:05,438 INFO L273 TraceCheckUtils]: 3: Hoare triple {60#(and (<= ~SIZE 536870912) (= ~SIZE (+ (* 4294967296 (div ~SIZE 4294967296)) ULTIMATE.start_linear_search_~n)) (< 0 (+ (div ULTIMATE.start_linear_search_~n 4294967296) (div ~SIZE 4294967296) 1)))} linear_search_#t~short1 := linear_search_~j~5 % 4294967296 < linear_search_~n % 4294967296;assume linear_search_#t~short1;read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := linear_search_~a.base, linear_search_~a.offset + linear_search_~j~5 % 4294967296 * 4, 4;havoc read~int_#value;assume read~int_#value == #memory_int[read~int_#ptr.base,read~int_#ptr.offset];linear_search_#t~mem0 := read~int_#value;linear_search_#t~short1 := linear_search_#t~mem0 != linear_search_~q; {61#(and (<= ~SIZE 536870912) (<= (+ ULTIMATE.start_linear_search_~j~5 (* 4294967296 (div ~SIZE 4294967296)) 1) (+ (* 4294967296 (div ULTIMATE.start_linear_search_~j~5 4294967296)) ~SIZE)))} is VALID [2019-02-14 16:37:05,448 INFO L273 TraceCheckUtils]: 4: Hoare triple {61#(and (<= ~SIZE 536870912) (<= (+ ULTIMATE.start_linear_search_~j~5 (* 4294967296 (div ~SIZE 4294967296)) 1) (+ (* 4294967296 (div ULTIMATE.start_linear_search_~j~5 4294967296)) ~SIZE)))} assume !linear_search_#t~short1;havoc linear_search_#t~mem0;havoc linear_search_#t~short1;assume !(linear_search_~j~5 % 4294967296 < ~SIZE % 4294967296);linear_search_#res := 0;main_#t~ret5 := linear_search_#res;assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;__VERIFIER_assert_#in~cond := main_#t~ret5;havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {59#false} is VALID [2019-02-14 16:37:05,449 INFO L273 TraceCheckUtils]: 5: Hoare triple {59#false} assume !false; {59#false} is VALID [2019-02-14 16:37:05,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-14 16:37:05,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:37:05,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:37:05,451 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-14 16:37:05,453 INFO L207 CegarAbsIntRunner]: [0], [2], [6], [8], [10] [2019-02-14 16:37:05,512 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-14 16:37:05,512 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-14 16:37:05,695 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-02-14 16:37:31,198 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4393 treesize of output 4386 [2019-02-14 16:37:31,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:31,312 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4393 treesize of output 4386 [2019-02-14 16:37:31,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:31,428 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4398 treesize of output 4391 [2019-02-14 16:37:31,482 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:31,544 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4393 treesize of output 4386 [2019-02-14 16:37:31,582 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:31,642 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4391 treesize of output 4384 [2019-02-14 16:37:31,688 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:31,738 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4395 treesize of output 4388 [2019-02-14 16:37:31,780 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:31,835 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4395 treesize of output 4388 [2019-02-14 16:37:31,875 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:31,903 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4393 treesize of output 4386 [2019-02-14 16:37:31,942 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:31,997 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4391 treesize of output 4384 [2019-02-14 16:37:32,032 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:32,061 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4398 treesize of output 4391 [2019-02-14 16:37:32,096 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:32,125 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4391 treesize of output 4384 [2019-02-14 16:37:32,161 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:32,199 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4398 treesize of output 4391 [2019-02-14 16:37:32,235 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:32,265 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4396 treesize of output 4389 [2019-02-14 16:37:32,302 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:32,332 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4391 treesize of output 4384 [2019-02-14 16:37:32,371 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:32,400 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4393 treesize of output 4386 [2019-02-14 16:37:32,438 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:32,465 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4395 treesize of output 4388 [2019-02-14 16:37:32,504 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:32,533 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4393 treesize of output 4386 [2019-02-14 16:37:32,575 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:32,604 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4398 treesize of output 4391 [2019-02-14 16:37:32,645 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:32,674 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4395 treesize of output 4388 [2019-02-14 16:37:32,733 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:32,764 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4389 treesize of output 4382 [2019-02-14 16:37:32,806 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:32,837 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4396 treesize of output 4389 [2019-02-14 16:37:32,884 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:32,913 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4396 treesize of output 4389 [2019-02-14 16:37:32,959 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:32,990 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4396 treesize of output 4389 [2019-02-14 16:37:33,035 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:33,064 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4393 treesize of output 4386 [2019-02-14 16:37:33,110 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:33,140 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4393 treesize of output 4386 [2019-02-14 16:37:33,191 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:33,231 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4391 treesize of output 4384 [2019-02-14 16:37:33,301 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:33,380 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4394 treesize of output 4387 [2019-02-14 16:37:33,415 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts.