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_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/linear_sea.ch.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-27 12:54:53,250 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-27 12:54:53,252 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-27 12:54:53,264 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-27 12:54:53,265 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-27 12:54:53,266 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-27 12:54:53,267 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-27 12:54:53,269 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-27 12:54:53,271 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-27 12:54:53,272 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-27 12:54:53,273 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-27 12:54:53,273 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-27 12:54:53,277 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-27 12:54:53,278 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-27 12:54:53,282 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-27 12:54:53,283 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-27 12:54:53,284 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-27 12:54:53,289 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-27 12:54:53,291 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-27 12:54:53,299 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-27 12:54:53,303 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-27 12:54:53,307 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-27 12:54:53,310 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-27 12:54:53,311 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-27 12:54:53,311 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-27 12:54:53,312 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-27 12:54:53,313 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-27 12:54:53,316 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-27 12:54:53,317 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-27 12:54:53,318 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-27 12:54:53,318 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-27 12:54:53,320 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-27 12:54:53,321 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-27 12:54:53,321 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-27 12:54:53,322 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-27 12:54:53,323 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-27 12:54:53,323 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-27 12:54:53,346 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-27 12:54:53,346 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-27 12:54:53,347 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-27 12:54:53,348 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-27 12:54:53,348 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-27 12:54:53,348 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-27 12:54:53,348 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-27 12:54:53,349 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-27 12:54:53,349 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-27 12:54:53,349 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-27 12:54:53,350 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-27 12:54:53,350 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-27 12:54:53,350 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-27 12:54:53,350 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-27 12:54:53,351 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-27 12:54:53,351 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-27 12:54:53,351 INFO L133 SettingsManager]: * Use SBE=true [2019-02-27 12:54:53,351 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-27 12:54:53,355 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-27 12:54:53,355 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-27 12:54:53,355 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-27 12:54:53,355 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-27 12:54:53,355 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-27 12:54:53,356 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-27 12:54:53,356 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-27 12:54:53,356 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-27 12:54:53,356 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-27 12:54:53,356 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-27 12:54:53,357 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-27 12:54:53,357 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-27 12:54:53,357 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-27 12:54:53,357 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-27 12:54:53,357 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-27 12:54:53,358 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-27 12:54:53,359 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-27 12:54:53,359 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-27 12:54:53,359 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-27 12:54:53,360 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-27 12:54:53,360 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-27 12:54:53,360 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-27 12:54:53,392 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-27 12:54:53,407 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-27 12:54:53,411 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-27 12:54:53,413 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-27 12:54:53,413 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-27 12:54:53,414 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-27 12:54:53,415 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/linear_sea.ch.i_4.bpl' [2019-02-27 12:54:53,488 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-27 12:54:53,490 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-27 12:54:53,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-27 12:54:53,491 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-27 12:54:53,491 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-27 12:54:53,508 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 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,522 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 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,533 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-27 12:54:53,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-27 12:54:53,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-27 12:54:53,534 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-27 12:54:53,546 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 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,546 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 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,548 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 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,549 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 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,556 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 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,563 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 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,564 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 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-27 12:54:53,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-27 12:54:53,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-27 12:54:53,571 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-27 12:54:53,572 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 27.02 12:54:53" (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-27 12:54:53,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-27 12:54:53,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-27 12:54:54,136 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-27 12:54:54,136 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-02-27 12:54:54,137 INFO L202 PluginConnector]: Adding new model linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.02 12:54:54 BoogieIcfgContainer [2019-02-27 12:54:54,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-27 12:54:54,138 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-27 12:54:54,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-27 12:54:54,142 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-27 12:54:54,142 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 27.02 12:54:53" (1/2) ... [2019-02-27 12:54:54,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64151a86 and model type linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.02 12:54:54, skipping insertion in model container [2019-02-27 12:54:54,143 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 27.02 12:54:54" (2/2) ... [2019-02-27 12:54:54,145 INFO L112 eAbstractionObserver]: Analyzing ICFG linear_sea.ch.i_4.bpl [2019-02-27 12:54:54,154 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-27 12:54:54,163 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-27 12:54:54,175 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-27 12:54:54,206 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-27 12:54:54,206 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-27 12:54:54,207 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-27 12:54:54,207 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-27 12:54:54,207 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-27 12:54:54,207 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-27 12:54:54,207 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-27 12:54:54,208 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-27 12:54:54,219 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-02-27 12:54:54,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-27 12:54:54,226 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:54:54,227 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-27 12:54:54,229 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:54:54,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:54:54,236 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2019-02-27 12:54:54,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:54:54,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:54:54,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:54:54,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:54:54,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:54:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:54:54,973 WARN L181 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 10 [2019-02-27 12:54:55,306 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-27 12:54:55,326 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-27 12:54:55,340 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-27 12:54:55,341 INFO L273 TraceCheckUtils]: 3: Hoare triple {11#false} assume !false; {11#false} is VALID [2019-02-27 12:54:55,344 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-27 12:54:55,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-27 12:54:55,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-27 12:54:55,348 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-27 12:54:55,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-27 12:54:55,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:54:55,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-27 12:54:55,420 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-27 12:54:55,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-27 12:54:55,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-27 12:54:55,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-27 12:54:55,433 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-02-27 12:54:55,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:54:55,626 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-02-27 12:54:55,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-27 12:54:55,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-27 12:54:55,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:54:55,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-27 12:54:55,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-02-27 12:54:55,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-27 12:54:55,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-02-27 12:54:55,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 12 transitions. [2019-02-27 12:54:55,697 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-27 12:54:55,707 INFO L225 Difference]: With dead ends: 11 [2019-02-27 12:54:55,707 INFO L226 Difference]: Without dead ends: 7 [2019-02-27 12:54:55,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-27 12:54:55,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-27 12:54:55,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-27 12:54:55,758 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:54:55,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2019-02-27 12:54:55,759 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-02-27 12:54:55,760 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-02-27 12:54:55,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:54:55,761 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-02-27 12:54:55,761 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-27 12:54:55,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:54:55,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:54:55,762 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-02-27 12:54:55,763 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-02-27 12:54:55,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:54:55,764 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-02-27 12:54:55,764 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-27 12:54:55,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:54:55,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:54:55,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:54:55,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:54:55,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-27 12:54:55,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-02-27 12:54:55,768 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-02-27 12:54:55,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:54:55,769 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-02-27 12:54:55,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-27 12:54:55,769 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-27 12:54:55,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-27 12:54:55,769 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:54:55,770 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-27 12:54:55,770 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:54:55,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:54:55,770 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2019-02-27 12:54:55,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:54:55,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:54:55,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:54:55,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:54:55,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:54:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:54:56,741 WARN L181 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 16 [2019-02-27 12:54:57,159 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 14 [2019-02-27 12:54:57,171 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-27 12:54:57,176 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-27 12:54:57,177 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-27 12:54:57,179 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-27 12:54:57,182 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-27 12:54:57,183 INFO L273 TraceCheckUtils]: 5: Hoare triple {59#false} assume !false; {59#false} is VALID [2019-02-27 12:54:57,184 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-27 12:54:57,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 12:54:57,184 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-27 12:54:57,185 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-27 12:54:57,187 INFO L207 CegarAbsIntRunner]: [0], [2], [6], [8], [10] [2019-02-27 12:54:57,227 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-27 12:54:57,227 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-27 12:54:57,776 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-27 12:54:57,778 INFO L272 AbstractInterpreter]: Visited 5 different actions 17 times. Merged at 4 different actions 12 times. Widened at 1 different actions 1 times. Performed 328 root evaluator evaluations with a maximum evaluation depth of 9. Performed 328 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-27 12:54:57,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:54:57,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-27 12:54:57,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 12:54:57,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-27 12:54:57,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:54:57,795 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-27 12:54:57,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:54:57,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-27 12:54:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:54:57,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-27 12:54:58,530 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 6 [2019-02-27 12:54:58,607 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; {65#(or (and (= (+ ULTIMATE.start_linear_search_~n 4294967296) (mod ~SIZE 4294967296)) (< 2147483647 (mod ~SIZE 4294967296))) (and (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n) (<= (mod ~SIZE 4294967296) 2147483647)))} is VALID [2019-02-27 12:54:58,620 INFO L273 TraceCheckUtils]: 1: Hoare triple {65#(or (and (= (+ ULTIMATE.start_linear_search_~n 4294967296) (mod ~SIZE 4294967296)) (< 2147483647 (mod ~SIZE 4294967296))) (and (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n) (<= (mod ~SIZE 4294967296) 2147483647)))} 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; {65#(or (and (= (+ ULTIMATE.start_linear_search_~n 4294967296) (mod ~SIZE 4294967296)) (< 2147483647 (mod ~SIZE 4294967296))) (and (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n) (<= (mod ~SIZE 4294967296) 2147483647)))} is VALID [2019-02-27 12:54:58,633 INFO L273 TraceCheckUtils]: 2: Hoare triple {65#(or (and (= (+ ULTIMATE.start_linear_search_~n 4294967296) (mod ~SIZE 4294967296)) (< 2147483647 (mod ~SIZE 4294967296))) (and (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n) (<= (mod ~SIZE 4294967296) 2147483647)))} 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; {65#(or (and (= (+ ULTIMATE.start_linear_search_~n 4294967296) (mod ~SIZE 4294967296)) (< 2147483647 (mod ~SIZE 4294967296))) (and (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n) (<= (mod ~SIZE 4294967296) 2147483647)))} is VALID [2019-02-27 12:54:58,646 INFO L273 TraceCheckUtils]: 3: Hoare triple {65#(or (and (= (+ ULTIMATE.start_linear_search_~n 4294967296) (mod ~SIZE 4294967296)) (< 2147483647 (mod ~SIZE 4294967296))) (and (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n) (<= (mod ~SIZE 4294967296) 2147483647)))} 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; {75#(< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296))} is VALID [2019-02-27 12:54:58,659 INFO L273 TraceCheckUtils]: 4: Hoare triple {75#(< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296))} 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-27 12:54:58,659 INFO L273 TraceCheckUtils]: 5: Hoare triple {59#false} assume !false; {59#false} is VALID [2019-02-27 12:54:58,660 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-27 12:54:58,660 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-27 12:54:59,114 INFO L273 TraceCheckUtils]: 5: Hoare triple {59#false} assume !false; {59#false} is VALID [2019-02-27 12:54:59,119 INFO L273 TraceCheckUtils]: 4: Hoare triple {75#(< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296))} 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-27 12:54:59,122 INFO L273 TraceCheckUtils]: 3: Hoare triple {88#(forall ((ULTIMATE.start_linear_search_~j~5 Int)) (or (<= (mod ULTIMATE.start_linear_search_~n 4294967296) (mod ULTIMATE.start_linear_search_~j~5 4294967296)) (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296))))} 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; {75#(< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296))} is VALID [2019-02-27 12:54:59,124 INFO L273 TraceCheckUtils]: 2: Hoare triple {88#(forall ((ULTIMATE.start_linear_search_~j~5 Int)) (or (<= (mod ULTIMATE.start_linear_search_~n 4294967296) (mod ULTIMATE.start_linear_search_~j~5 4294967296)) (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296))))} 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; {88#(forall ((ULTIMATE.start_linear_search_~j~5 Int)) (or (<= (mod ULTIMATE.start_linear_search_~n 4294967296) (mod ULTIMATE.start_linear_search_~j~5 4294967296)) (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296))))} is VALID [2019-02-27 12:54:59,124 INFO L273 TraceCheckUtils]: 1: Hoare triple {88#(forall ((ULTIMATE.start_linear_search_~j~5 Int)) (or (<= (mod ULTIMATE.start_linear_search_~n 4294967296) (mod ULTIMATE.start_linear_search_~j~5 4294967296)) (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296))))} 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; {88#(forall ((ULTIMATE.start_linear_search_~j~5 Int)) (or (<= (mod ULTIMATE.start_linear_search_~n 4294967296) (mod ULTIMATE.start_linear_search_~j~5 4294967296)) (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296))))} is VALID [2019-02-27 12:54:59,136 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; {88#(forall ((ULTIMATE.start_linear_search_~j~5 Int)) (or (<= (mod ULTIMATE.start_linear_search_~n 4294967296) (mod ULTIMATE.start_linear_search_~j~5 4294967296)) (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296))))} is VALID [2019-02-27 12:54:59,137 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-27 12:54:59,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-27 12:54:59,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2019-02-27 12:54:59,158 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-27 12:54:59,159 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-02-27 12:54:59,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:54:59,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-02-27 12:54:59,266 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:54:59,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-27 12:54:59,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-27 12:54:59,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-02-27 12:54:59,268 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-02-27 12:54:59,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:54:59,453 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-02-27 12:54:59,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-27 12:54:59,453 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-02-27 12:54:59,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:54:59,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-27 12:54:59,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-02-27 12:54:59,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-27 12:54:59,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-02-27 12:54:59,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 6 transitions. [2019-02-27 12:54:59,474 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:54:59,474 INFO L225 Difference]: With dead ends: 7 [2019-02-27 12:54:59,474 INFO L226 Difference]: Without dead ends: 0 [2019-02-27 12:54:59,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-02-27 12:54:59,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-27 12:54:59,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-27 12:54:59,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:54:59,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-02-27 12:54:59,476 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-27 12:54:59,476 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-27 12:54:59,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:54:59,476 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-27 12:54:59,476 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-27 12:54:59,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:54:59,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:54:59,477 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-27 12:54:59,477 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-27 12:54:59,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:54:59,477 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-27 12:54:59,477 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-27 12:54:59,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:54:59,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:54:59,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:54:59,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:54:59,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-27 12:54:59,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-27 12:54:59,478 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-02-27 12:54:59,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:54:59,478 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-27 12:54:59,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-27 12:54:59,479 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-27 12:54:59,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:54:59,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-27 12:54:59,558 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 101) no Hoare annotation was computed. [2019-02-27 12:54:59,558 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 11 102) no Hoare annotation was computed. [2019-02-27 12:54:59,559 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 11 102) no Hoare annotation was computed. [2019-02-27 12:54:59,559 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 11 102) no Hoare annotation was computed. [2019-02-27 12:54:59,559 INFO L444 ceAbstractionStarter]: At program point L91(lines 91 100) the Hoare annotation is: false [2019-02-27 12:54:59,559 INFO L444 ceAbstractionStarter]: At program point L75(lines 75 92) the Hoare annotation is: (let ((.cse1 (div ~SIZE 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (<= ~SIZE 536870912) (= ~SIZE (+ .cse0 ULTIMATE.start_linear_search_~n)) (<= (+ ULTIMATE.start_linear_search_~j~5 .cse0 1) (+ (* 4294967296 (div ULTIMATE.start_linear_search_~j~5 4294967296)) ~SIZE)) (< 0 (+ (div ULTIMATE.start_linear_search_~n 4294967296) .cse1 1))))) [2019-02-27 12:54:59,560 INFO L444 ceAbstractionStarter]: At program point L99(lines 65 99) the Hoare annotation is: (let ((.cse0 (div ~SIZE 4294967296))) (and (<= ~SIZE 536870912) (= ~SIZE (+ (* 4294967296 .cse0) ULTIMATE.start_linear_search_~n)) (< 0 (+ (div ULTIMATE.start_linear_search_~n 4294967296) .cse0 1)))) [2019-02-27 12:54:59,561 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2019-02-27 12:54:59,564 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2019-02-27 12:54:59,564 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2019-02-27 12:54:59,564 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2019-02-27 12:54:59,565 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2019-02-27 12:54:59,572 INFO L202 PluginConnector]: Adding new model linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.02 12:54:59 BoogieIcfgContainer [2019-02-27 12:54:59,573 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-27 12:54:59,574 INFO L168 Benchmark]: Toolchain (without parser) took 6085.32 ms. Allocated memory was 134.7 MB in the beginning and 220.7 MB in the end (delta: 86.0 MB). Free memory was 109.6 MB in the beginning and 139.5 MB in the end (delta: -29.9 MB). Peak memory consumption was 56.1 MB. Max. memory is 7.1 GB. [2019-02-27 12:54:59,575 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 134.7 MB. Free memory is still 110.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-27 12:54:59,576 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.62 ms. Allocated memory is still 134.7 MB. Free memory was 109.6 MB in the beginning and 107.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-02-27 12:54:59,577 INFO L168 Benchmark]: Boogie Preprocessor took 37.28 ms. Allocated memory is still 134.7 MB. Free memory was 107.9 MB in the beginning and 106.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-27 12:54:59,578 INFO L168 Benchmark]: RCFGBuilder took 566.72 ms. Allocated memory is still 134.7 MB. Free memory was 106.6 MB in the beginning and 91.5 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2019-02-27 12:54:59,579 INFO L168 Benchmark]: TraceAbstraction took 5434.19 ms. Allocated memory was 134.7 MB in the beginning and 220.7 MB in the end (delta: 86.0 MB). Free memory was 91.1 MB in the beginning and 139.5 MB in the end (delta: -48.3 MB). Peak memory consumption was 37.6 MB. Max. memory is 7.1 GB. [2019-02-27 12:54:59,583 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 134.7 MB. Free memory is still 110.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.62 ms. Allocated memory is still 134.7 MB. Free memory was 109.6 MB in the beginning and 107.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.28 ms. Allocated memory is still 134.7 MB. Free memory was 107.9 MB in the beginning and 106.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 566.72 ms. Allocated memory is still 134.7 MB. Free memory was 106.6 MB in the beginning and 91.5 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5434.19 ms. Allocated memory was 134.7 MB in the beginning and 220.7 MB in the end (delta: 86.0 MB). Free memory was 91.1 MB in the beginning and 139.5 MB in the end (delta: -48.3 MB). Peak memory consumption was 37.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 101]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: ((~SIZE <= 536870912 && ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n) && linear_search_~j~5 + 4294967296 * (~SIZE / 4294967296) + 1 <= 4294967296 * (linear_search_~j~5 / 4294967296) + ~SIZE) && 0 < linear_search_~n / 4294967296 + ~SIZE / 4294967296 + 1 - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: (~SIZE <= 536870912 && ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n) && 0 < linear_search_~n / 4294967296 + ~SIZE / 4294967296 + 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 5.3s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4 SDtfs, 0 SDslu, 1 SDs, 0 SdLazy, 8 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 5 NumberOfFragments, 63 HoareAnnotationTreeSize, 3 FomulaSimplifications, 104 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 18 ConstructedInterpolants, 3 QuantifiedInterpolants, 1226 SizeOfPredicates, 3 NumberOfNonLiveVariables, 93 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 3/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...