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 --rcfgbuilder.size.of.a.code.block SingleStatement -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/linear_sea.ch.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1c58c86 [2019-05-15 10:15:10,481 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-05-15 10:15:10,483 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-05-15 10:15:10,497 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-15 10:15:10,497 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-05-15 10:15:10,498 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-15 10:15:10,500 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-05-15 10:15:10,502 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-05-15 10:15:10,505 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-05-15 10:15:10,506 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-05-15 10:15:10,508 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-05-15 10:15:10,508 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-05-15 10:15:10,509 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-05-15 10:15:10,510 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-05-15 10:15:10,520 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-05-15 10:15:10,522 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-15 10:15:10,523 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-05-15 10:15:10,527 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-15 10:15:10,530 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-05-15 10:15:10,533 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-05-15 10:15:10,534 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-05-15 10:15:10,536 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-05-15 10:15:10,538 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-15 10:15:10,539 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-15 10:15:10,539 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-05-15 10:15:10,540 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-05-15 10:15:10,541 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-05-15 10:15:10,542 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-05-15 10:15:10,542 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-05-15 10:15:10,545 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-05-15 10:15:10,546 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-05-15 10:15:10,548 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-05-15 10:15:10,549 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-15 10:15:10,550 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-05-15 10:15:10,550 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-05-15 10:15:10,550 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-05-15 10:15:10,551 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-05-15 10:15:10,552 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-05-15 10:15:10,554 INFO L181 SettingsManager]: Finished resetting all preferences to default values... Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement [2019-05-15 10:15:10,588 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-05-15 10:15:10,603 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-15 10:15:10,611 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-05-15 10:15:10,613 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-05-15 10:15:10,613 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-05-15 10:15:10,614 INFO L430 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-05-15 10:15:10,614 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/linear_sea.ch.i_4.bpl' [2019-05-15 10:15:10,689 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-05-15 10:15:10,690 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-05-15 10:15:10,691 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-15 10:15:10,691 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-05-15 10:15:10,692 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-05-15 10:15:10,710 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 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,727 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 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,735 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-15 10:15:10,736 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-05-15 10:15:10,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-05-15 10:15:10,736 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-05-15 10:15:10,747 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 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,747 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 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,749 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 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,749 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 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,754 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 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,756 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 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,758 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 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-15 10:15:10,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-05-15 10:15:10,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-05-15 10:15:10,761 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-05-15 10:15:10,762 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 15.05 10:15:10" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-05-15 10:15:10,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-05-15 10:15:10,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-05-15 10:15:11,465 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-05-15 10:15:11,465 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-05-15 10:15:11,466 INFO L202 PluginConnector]: Adding new model linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:15:11 BoogieIcfgContainer [2019-05-15 10:15:11,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-05-15 10:15:11,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-05-15 10:15:11,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-05-15 10:15:11,471 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-05-15 10:15:11,471 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 15.05 10:15:10" (1/2) ... [2019-05-15 10:15:11,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a2491ed and model type linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.05 10:15:11, skipping insertion in model container [2019-05-15 10:15:11,473 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 15.05 10:15:11" (2/2) ... [2019-05-15 10:15:11,475 INFO L109 eAbstractionObserver]: Analyzing ICFG linear_sea.ch.i_4.bpl [2019-05-15 10:15:11,484 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-15 10:15:11,493 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-05-15 10:15:11,510 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-05-15 10:15:11,536 INFO L127 ementStrategyFactory]: Using default assertion order modulation [2019-05-15 10:15:11,537 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-05-15 10:15:11,538 INFO L378 AbstractCegarLoop]: Hoare is false [2019-05-15 10:15:11,538 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-05-15 10:15:11,538 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-05-15 10:15:11,538 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-05-15 10:15:11,538 INFO L382 AbstractCegarLoop]: Difference is false [2019-05-15 10:15:11,539 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-05-15 10:15:11,539 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-15 10:15:11,556 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2019-05-15 10:15:11,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-05-15 10:15:11,566 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:15:11,568 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-15 10:15:11,570 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:15:11,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:15:11,576 INFO L82 PathProgramCache]: Analyzing trace with hash 2000761124, now seen corresponding path program 1 times [2019-05-15 10:15:11,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:15:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:11,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 10 conjunts are in the unsatisfiable core [2019-05-15 10:15:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:11,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:15:12,821 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-05-15 10:15:13,524 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 15 [2019-05-15 10:15:13,882 INFO L273 TraceCheckUtils]: 0: Hoare triple {59#true} #NULL.base, #NULL.offset := 0, 0; {59#true} is VALID [2019-05-15 10:15:13,886 INFO L273 TraceCheckUtils]: 1: Hoare triple {59#true} #valid := #valid[0 := 0]; {59#true} is VALID [2019-05-15 10:15:13,887 INFO L273 TraceCheckUtils]: 2: Hoare triple {59#true} ~SIZE := 0; {59#true} is VALID [2019-05-15 10:15:13,887 INFO L273 TraceCheckUtils]: 3: Hoare triple {59#true} havoc main_#res; {59#true} is VALID [2019-05-15 10:15:13,888 INFO L273 TraceCheckUtils]: 4: Hoare triple {59#true} havoc main_#t~nondet3, main_#t~ret5, main_~#a~7.base, main_~#a~7.offset; {59#true} is VALID [2019-05-15 10:15:13,888 INFO L273 TraceCheckUtils]: 5: Hoare triple {59#true} ~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; {59#true} is VALID [2019-05-15 10:15:13,889 INFO L273 TraceCheckUtils]: 6: Hoare triple {59#true} havoc main_#t~nondet3; {59#true} is VALID [2019-05-15 10:15:13,889 INFO L273 TraceCheckUtils]: 7: Hoare triple {59#true} #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid; {59#true} is VALID [2019-05-15 10:15:13,889 INFO L273 TraceCheckUtils]: 8: Hoare triple {59#true} #Ultimate.alloc_~size := ~SIZE % 4294967296 * 4; {59#true} is VALID [2019-05-15 10:15:13,890 INFO L273 TraceCheckUtils]: 9: Hoare triple {59#true} havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset; {59#true} is VALID [2019-05-15 10:15:13,890 INFO L273 TraceCheckUtils]: 10: Hoare triple {59#true} havoc #valid, #length; {59#true} is VALID [2019-05-15 10:15:13,891 INFO L273 TraceCheckUtils]: 11: Hoare triple {59#true} assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0; {59#true} is VALID [2019-05-15 10:15:13,891 INFO L273 TraceCheckUtils]: 12: Hoare triple {59#true} assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1]; {59#true} is VALID [2019-05-15 10:15:13,891 INFO L273 TraceCheckUtils]: 13: Hoare triple {59#true} assume #Ultimate.alloc_#res.offset == 0; {59#true} is VALID [2019-05-15 10:15:13,892 INFO L273 TraceCheckUtils]: 14: Hoare triple {59#true} assume #Ultimate.alloc_#res.base != 0; {59#true} is VALID [2019-05-15 10:15:13,892 INFO L273 TraceCheckUtils]: 15: Hoare triple {59#true} assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size]; {59#true} is VALID [2019-05-15 10:15:13,892 INFO L273 TraceCheckUtils]: 16: Hoare triple {59#true} main_~#a~7.base, main_~#a~7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset; {59#true} is VALID [2019-05-15 10:15:13,893 INFO L273 TraceCheckUtils]: 17: Hoare triple {59#true} write~int_old_#memory_int := #memory_int; {59#true} is VALID [2019-05-15 10:15:13,894 INFO L273 TraceCheckUtils]: 18: Hoare triple {59#true} 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; {59#true} is VALID [2019-05-15 10:15:13,894 INFO L273 TraceCheckUtils]: 19: Hoare triple {59#true} havoc #memory_int; {59#true} is VALID [2019-05-15 10:15:13,894 INFO L273 TraceCheckUtils]: 20: Hoare triple {59#true} assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base,write~int_#ptr.offset := write~int_#value]; {59#true} is VALID [2019-05-15 10:15:13,909 INFO L273 TraceCheckUtils]: 21: Hoare triple {59#true} 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; {127#(or (and (= (mod ~SIZE 4294967296) (+ |ULTIMATE.start_linear_search_#in~n| 4294967296)) (< 2147483647 (mod ~SIZE 4294967296))) (and (= (mod ~SIZE 4294967296) |ULTIMATE.start_linear_search_#in~n|) (<= (mod ~SIZE 4294967296) 2147483647)))} is VALID [2019-05-15 10:15:13,913 INFO L273 TraceCheckUtils]: 22: Hoare triple {127#(or (and (= (mod ~SIZE 4294967296) (+ |ULTIMATE.start_linear_search_#in~n| 4294967296)) (< 2147483647 (mod ~SIZE 4294967296))) (and (= (mod ~SIZE 4294967296) |ULTIMATE.start_linear_search_#in~n|) (<= (mod ~SIZE 4294967296) 2147483647)))} havoc linear_search_#res; {127#(or (and (= (mod ~SIZE 4294967296) (+ |ULTIMATE.start_linear_search_#in~n| 4294967296)) (< 2147483647 (mod ~SIZE 4294967296))) (and (= (mod ~SIZE 4294967296) |ULTIMATE.start_linear_search_#in~n|) (<= (mod ~SIZE 4294967296) 2147483647)))} is VALID [2019-05-15 10:15:13,918 INFO L273 TraceCheckUtils]: 23: Hoare triple {127#(or (and (= (mod ~SIZE 4294967296) (+ |ULTIMATE.start_linear_search_#in~n| 4294967296)) (< 2147483647 (mod ~SIZE 4294967296))) (and (= (mod ~SIZE 4294967296) |ULTIMATE.start_linear_search_#in~n|) (<= (mod ~SIZE 4294967296) 2147483647)))} 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; {127#(or (and (= (mod ~SIZE 4294967296) (+ |ULTIMATE.start_linear_search_#in~n| 4294967296)) (< 2147483647 (mod ~SIZE 4294967296))) (and (= (mod ~SIZE 4294967296) |ULTIMATE.start_linear_search_#in~n|) (<= (mod ~SIZE 4294967296) 2147483647)))} is VALID [2019-05-15 10:15:13,922 INFO L273 TraceCheckUtils]: 24: Hoare triple {127#(or (and (= (mod ~SIZE 4294967296) (+ |ULTIMATE.start_linear_search_#in~n| 4294967296)) (< 2147483647 (mod ~SIZE 4294967296))) (and (= (mod ~SIZE 4294967296) |ULTIMATE.start_linear_search_#in~n|) (<= (mod ~SIZE 4294967296) 2147483647)))} linear_search_~a.base, linear_search_~a.offset := linear_search_#in~a.base, linear_search_#in~a.offset; {127#(or (and (= (mod ~SIZE 4294967296) (+ |ULTIMATE.start_linear_search_#in~n| 4294967296)) (< 2147483647 (mod ~SIZE 4294967296))) (and (= (mod ~SIZE 4294967296) |ULTIMATE.start_linear_search_#in~n|) (<= (mod ~SIZE 4294967296) 2147483647)))} is VALID [2019-05-15 10:15:13,926 INFO L273 TraceCheckUtils]: 25: Hoare triple {127#(or (and (= (mod ~SIZE 4294967296) (+ |ULTIMATE.start_linear_search_#in~n| 4294967296)) (< 2147483647 (mod ~SIZE 4294967296))) (and (= (mod ~SIZE 4294967296) |ULTIMATE.start_linear_search_#in~n|) (<= (mod ~SIZE 4294967296) 2147483647)))} linear_search_~n := linear_search_#in~n; {140#(or (and (< 2147483647 (mod ~SIZE 4294967296)) (= (mod ~SIZE 4294967296) (+ ULTIMATE.start_linear_search_~n 4294967296))) (and (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n) (<= (mod ~SIZE 4294967296) 2147483647)))} is VALID [2019-05-15 10:15:13,927 INFO L273 TraceCheckUtils]: 26: Hoare triple {140#(or (and (< 2147483647 (mod ~SIZE 4294967296)) (= (mod ~SIZE 4294967296) (+ ULTIMATE.start_linear_search_~n 4294967296))) (and (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n) (<= (mod ~SIZE 4294967296) 2147483647)))} linear_search_~q := linear_search_#in~q; {140#(or (and (< 2147483647 (mod ~SIZE 4294967296)) (= (mod ~SIZE 4294967296) (+ ULTIMATE.start_linear_search_~n 4294967296))) (and (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n) (<= (mod ~SIZE 4294967296) 2147483647)))} is VALID [2019-05-15 10:15:13,927 INFO L273 TraceCheckUtils]: 27: Hoare triple {140#(or (and (< 2147483647 (mod ~SIZE 4294967296)) (= (mod ~SIZE 4294967296) (+ ULTIMATE.start_linear_search_~n 4294967296))) (and (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n) (<= (mod ~SIZE 4294967296) 2147483647)))} linear_search_~j~5 := 0; {147#(and (or (and (< 2147483647 (mod ~SIZE 4294967296)) (= (mod ~SIZE 4294967296) (+ ULTIMATE.start_linear_search_~n 4294967296))) (and (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n) (<= (mod ~SIZE 4294967296) 2147483647))) (= 0 ULTIMATE.start_linear_search_~j~5))} is VALID [2019-05-15 10:15:13,930 INFO L273 TraceCheckUtils]: 28: Hoare triple {147#(and (or (and (< 2147483647 (mod ~SIZE 4294967296)) (= (mod ~SIZE 4294967296) (+ ULTIMATE.start_linear_search_~n 4294967296))) (and (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n) (<= (mod ~SIZE 4294967296) 2147483647))) (= 0 ULTIMATE.start_linear_search_~j~5))} linear_search_#t~short1 := linear_search_~j~5 % 4294967296 < linear_search_~n % 4294967296; {151#(and (= 0 ULTIMATE.start_linear_search_~j~5) (or (and (not |ULTIMATE.start_linear_search_#t~short1|) (<= (mod ~SIZE 4294967296) (mod ULTIMATE.start_linear_search_~j~5 4294967296))) (and (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)) |ULTIMATE.start_linear_search_#t~short1|)))} is VALID [2019-05-15 10:15:13,935 INFO L273 TraceCheckUtils]: 29: Hoare triple {151#(and (= 0 ULTIMATE.start_linear_search_~j~5) (or (and (not |ULTIMATE.start_linear_search_#t~short1|) (<= (mod ~SIZE 4294967296) (mod ULTIMATE.start_linear_search_~j~5 4294967296))) (and (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)) |ULTIMATE.start_linear_search_#t~short1|)))} assume linear_search_#t~short1; {155#(and (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)) (= 0 ULTIMATE.start_linear_search_~j~5))} is VALID [2019-05-15 10:15:13,936 INFO L273 TraceCheckUtils]: 30: Hoare triple {155#(and (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)) (= 0 ULTIMATE.start_linear_search_~j~5))} 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; {155#(and (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)) (= 0 ULTIMATE.start_linear_search_~j~5))} is VALID [2019-05-15 10:15:13,938 INFO L273 TraceCheckUtils]: 31: Hoare triple {155#(and (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)) (= 0 ULTIMATE.start_linear_search_~j~5))} havoc read~int_#value; {155#(and (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)) (= 0 ULTIMATE.start_linear_search_~j~5))} is VALID [2019-05-15 10:15:13,939 INFO L273 TraceCheckUtils]: 32: Hoare triple {155#(and (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)) (= 0 ULTIMATE.start_linear_search_~j~5))} assume read~int_#value == #memory_int[read~int_#ptr.base,read~int_#ptr.offset]; {155#(and (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)) (= 0 ULTIMATE.start_linear_search_~j~5))} is VALID [2019-05-15 10:15:13,940 INFO L273 TraceCheckUtils]: 33: Hoare triple {155#(and (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)) (= 0 ULTIMATE.start_linear_search_~j~5))} linear_search_#t~mem0 := read~int_#value; {155#(and (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)) (= 0 ULTIMATE.start_linear_search_~j~5))} is VALID [2019-05-15 10:15:13,941 INFO L273 TraceCheckUtils]: 34: Hoare triple {155#(and (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)) (= 0 ULTIMATE.start_linear_search_~j~5))} linear_search_#t~short1 := linear_search_#t~mem0 != linear_search_~q; {155#(and (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)) (= 0 ULTIMATE.start_linear_search_~j~5))} is VALID [2019-05-15 10:15:13,943 INFO L273 TraceCheckUtils]: 35: Hoare triple {155#(and (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)) (= 0 ULTIMATE.start_linear_search_~j~5))} assume !linear_search_#t~short1; {155#(and (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)) (= 0 ULTIMATE.start_linear_search_~j~5))} is VALID [2019-05-15 10:15:13,944 INFO L273 TraceCheckUtils]: 36: Hoare triple {155#(and (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)) (= 0 ULTIMATE.start_linear_search_~j~5))} havoc linear_search_#t~mem0; {155#(and (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)) (= 0 ULTIMATE.start_linear_search_~j~5))} is VALID [2019-05-15 10:15:13,946 INFO L273 TraceCheckUtils]: 37: Hoare triple {155#(and (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)) (= 0 ULTIMATE.start_linear_search_~j~5))} havoc linear_search_#t~short1; {155#(and (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)) (= 0 ULTIMATE.start_linear_search_~j~5))} is VALID [2019-05-15 10:15:13,956 INFO L273 TraceCheckUtils]: 38: Hoare triple {155#(and (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)) (= 0 ULTIMATE.start_linear_search_~j~5))} assume !(linear_search_~j~5 % 4294967296 < ~SIZE % 4294967296); {60#false} is VALID [2019-05-15 10:15:13,956 INFO L273 TraceCheckUtils]: 39: Hoare triple {60#false} linear_search_#res := 0; {60#false} is VALID [2019-05-15 10:15:13,957 INFO L273 TraceCheckUtils]: 40: Hoare triple {60#false} main_#t~ret5 := linear_search_#res; {60#false} is VALID [2019-05-15 10:15:13,957 INFO L273 TraceCheckUtils]: 41: Hoare triple {60#false} assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647; {60#false} is VALID [2019-05-15 10:15:13,957 INFO L273 TraceCheckUtils]: 42: Hoare triple {60#false} __VERIFIER_assert_#in~cond := main_#t~ret5; {60#false} is VALID [2019-05-15 10:15:13,957 INFO L273 TraceCheckUtils]: 43: Hoare triple {60#false} havoc __VERIFIER_assert_~cond; {60#false} is VALID [2019-05-15 10:15:13,958 INFO L273 TraceCheckUtils]: 44: Hoare triple {60#false} __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {60#false} is VALID [2019-05-15 10:15:13,958 INFO L273 TraceCheckUtils]: 45: Hoare triple {60#false} assume __VERIFIER_assert_~cond == 0; {60#false} is VALID [2019-05-15 10:15:13,958 INFO L273 TraceCheckUtils]: 46: Hoare triple {60#false} assume !false; {60#false} is VALID [2019-05-15 10:15:13,958 INFO L273 TraceCheckUtils]: 47: Hoare triple {60#false} assume !false; {60#false} is VALID [2019-05-15 10:15:13,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:15:13,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:15:13,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-05-15 10:15:13,980 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-05-15 10:15:13,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:15:13,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2019-05-15 10:15:14,096 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:14,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-05-15 10:15:14,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-05-15 10:15:14,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-05-15 10:15:14,107 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 7 states. [2019-05-15 10:15:14,768 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-05-15 10:15:15,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:15,332 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-05-15 10:15:15,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-05-15 10:15:15,332 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-05-15 10:15:15,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:15:15,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-05-15 10:15:15,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2019-05-15 10:15:15,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-05-15 10:15:15,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2019-05-15 10:15:15,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 71 transitions. [2019-05-15 10:15:15,528 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:15,547 INFO L225 Difference]: With dead ends: 69 [2019-05-15 10:15:15,548 INFO L226 Difference]: Without dead ends: 66 [2019-05-15 10:15:15,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-05-15 10:15:15,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-05-15 10:15:15,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2019-05-15 10:15:15,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:15:15,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 62 states. [2019-05-15 10:15:15,580 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 62 states. [2019-05-15 10:15:15,580 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 62 states. [2019-05-15 10:15:15,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:15,587 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-05-15 10:15:15,587 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-05-15 10:15:15,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:15,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:15,588 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 66 states. [2019-05-15 10:15:15,588 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 66 states. [2019-05-15 10:15:15,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:15,593 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-05-15 10:15:15,593 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-05-15 10:15:15,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:15,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:15,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:15:15,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:15:15,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-05-15 10:15:15,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-05-15 10:15:15,600 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 48 [2019-05-15 10:15:15,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:15:15,601 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-05-15 10:15:15,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-05-15 10:15:15,601 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-05-15 10:15:15,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-05-15 10:15:15,603 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:15:15,603 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-15 10:15:15,604 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:15:15,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:15:15,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1927844105, now seen corresponding path program 1 times [2019-05-15 10:15:15,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:15:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:15,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 11 conjunts are in the unsatisfiable core [2019-05-15 10:15:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:15,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:15:19,095 WARN L188 SmtUtils]: Spent 2.94 s on a formula simplification. DAG size of input: 30 DAG size of output: 13 [2019-05-15 10:15:20,185 INFO L273 TraceCheckUtils]: 0: Hoare triple {482#true} #NULL.base, #NULL.offset := 0, 0; {482#true} is VALID [2019-05-15 10:15:20,186 INFO L273 TraceCheckUtils]: 1: Hoare triple {482#true} #valid := #valid[0 := 0]; {482#true} is VALID [2019-05-15 10:15:20,186 INFO L273 TraceCheckUtils]: 2: Hoare triple {482#true} ~SIZE := 0; {482#true} is VALID [2019-05-15 10:15:20,187 INFO L273 TraceCheckUtils]: 3: Hoare triple {482#true} havoc main_#res; {482#true} is VALID [2019-05-15 10:15:20,187 INFO L273 TraceCheckUtils]: 4: Hoare triple {482#true} havoc main_#t~nondet3, main_#t~ret5, main_~#a~7.base, main_~#a~7.offset; {482#true} is VALID [2019-05-15 10:15:20,193 INFO L273 TraceCheckUtils]: 5: Hoare triple {482#true} ~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; {502#(exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296))))} is VALID [2019-05-15 10:15:20,194 INFO L273 TraceCheckUtils]: 6: Hoare triple {502#(exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296))))} havoc main_#t~nondet3; {502#(exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296))))} is VALID [2019-05-15 10:15:20,195 INFO L273 TraceCheckUtils]: 7: Hoare triple {502#(exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296))))} #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid; {502#(exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296))))} is VALID [2019-05-15 10:15:20,195 INFO L273 TraceCheckUtils]: 8: Hoare triple {502#(exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296))))} #Ultimate.alloc_~size := ~SIZE % 4294967296 * 4; {502#(exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296))))} is VALID [2019-05-15 10:15:20,195 INFO L273 TraceCheckUtils]: 9: Hoare triple {502#(exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296))))} havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset; {502#(exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296))))} is VALID [2019-05-15 10:15:20,196 INFO L273 TraceCheckUtils]: 10: Hoare triple {502#(exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296))))} havoc #valid, #length; {502#(exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296))))} is VALID [2019-05-15 10:15:20,198 INFO L273 TraceCheckUtils]: 11: Hoare triple {502#(exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296))))} assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0; {502#(exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296))))} is VALID [2019-05-15 10:15:20,202 INFO L273 TraceCheckUtils]: 12: Hoare triple {502#(exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296))))} assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1]; {502#(exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296))))} is VALID [2019-05-15 10:15:20,202 INFO L273 TraceCheckUtils]: 13: Hoare triple {502#(exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296))))} assume #Ultimate.alloc_#res.offset == 0; {502#(exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296))))} is VALID [2019-05-15 10:15:20,205 INFO L273 TraceCheckUtils]: 14: Hoare triple {502#(exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296))))} assume #Ultimate.alloc_#res.base != 0; {502#(exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296))))} is VALID [2019-05-15 10:15:20,207 INFO L273 TraceCheckUtils]: 15: Hoare triple {502#(exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296))))} assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size]; {502#(exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296))))} is VALID [2019-05-15 10:15:20,207 INFO L273 TraceCheckUtils]: 16: Hoare triple {502#(exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296))))} main_~#a~7.base, main_~#a~7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset; {502#(exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296))))} is VALID [2019-05-15 10:15:20,208 INFO L273 TraceCheckUtils]: 17: Hoare triple {502#(exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296))))} write~int_old_#memory_int := #memory_int; {502#(exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296))))} is VALID [2019-05-15 10:15:20,209 INFO L273 TraceCheckUtils]: 18: Hoare triple {502#(exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296))))} 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; {502#(exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296))))} is VALID [2019-05-15 10:15:20,209 INFO L273 TraceCheckUtils]: 19: Hoare triple {502#(exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296))))} havoc #memory_int; {502#(exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296))))} is VALID [2019-05-15 10:15:20,210 INFO L273 TraceCheckUtils]: 20: Hoare triple {502#(exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296))))} assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base,write~int_#ptr.offset := write~int_#value]; {502#(exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296))))} is VALID [2019-05-15 10:15:20,211 INFO L273 TraceCheckUtils]: 21: Hoare triple {502#(exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296))))} 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; {551#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) |ULTIMATE.start_linear_search_#in~n|))} is VALID [2019-05-15 10:15:20,216 INFO L273 TraceCheckUtils]: 22: Hoare triple {551#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) |ULTIMATE.start_linear_search_#in~n|))} havoc linear_search_#res; {551#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) |ULTIMATE.start_linear_search_#in~n|))} is VALID [2019-05-15 10:15:20,217 INFO L273 TraceCheckUtils]: 23: Hoare triple {551#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) |ULTIMATE.start_linear_search_#in~n|))} 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; {551#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) |ULTIMATE.start_linear_search_#in~n|))} is VALID [2019-05-15 10:15:20,218 INFO L273 TraceCheckUtils]: 24: Hoare triple {551#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) |ULTIMATE.start_linear_search_#in~n|))} linear_search_~a.base, linear_search_~a.offset := linear_search_#in~a.base, linear_search_#in~a.offset; {551#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) |ULTIMATE.start_linear_search_#in~n|))} is VALID [2019-05-15 10:15:20,218 INFO L273 TraceCheckUtils]: 25: Hoare triple {551#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) |ULTIMATE.start_linear_search_#in~n|))} linear_search_~n := linear_search_#in~n; {564#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n))} is VALID [2019-05-15 10:15:20,219 INFO L273 TraceCheckUtils]: 26: Hoare triple {564#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n))} linear_search_~q := linear_search_#in~q; {564#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n))} is VALID [2019-05-15 10:15:20,221 INFO L273 TraceCheckUtils]: 27: Hoare triple {564#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n))} linear_search_~j~5 := 0; {564#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n))} is VALID [2019-05-15 10:15:20,222 INFO L273 TraceCheckUtils]: 28: Hoare triple {564#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n))} linear_search_#t~short1 := linear_search_~j~5 % 4294967296 < linear_search_~n % 4294967296; {564#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n))} is VALID [2019-05-15 10:15:20,223 INFO L273 TraceCheckUtils]: 29: Hoare triple {564#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n))} assume linear_search_#t~short1; {564#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n))} is VALID [2019-05-15 10:15:20,224 INFO L273 TraceCheckUtils]: 30: Hoare triple {564#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n))} 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; {564#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n))} is VALID [2019-05-15 10:15:20,227 INFO L273 TraceCheckUtils]: 31: Hoare triple {564#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n))} havoc read~int_#value; {564#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n))} is VALID [2019-05-15 10:15:20,228 INFO L273 TraceCheckUtils]: 32: Hoare triple {564#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n))} assume read~int_#value == #memory_int[read~int_#ptr.base,read~int_#ptr.offset]; {564#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n))} is VALID [2019-05-15 10:15:20,229 INFO L273 TraceCheckUtils]: 33: Hoare triple {564#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n))} linear_search_#t~mem0 := read~int_#value; {564#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n))} is VALID [2019-05-15 10:15:20,230 INFO L273 TraceCheckUtils]: 34: Hoare triple {564#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n))} linear_search_#t~short1 := linear_search_#t~mem0 != linear_search_~q; {564#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n))} is VALID [2019-05-15 10:15:20,230 INFO L273 TraceCheckUtils]: 35: Hoare triple {564#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n))} assume !!linear_search_#t~short1; {564#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n))} is VALID [2019-05-15 10:15:20,232 INFO L273 TraceCheckUtils]: 36: Hoare triple {564#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n))} havoc linear_search_#t~mem0; {564#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n))} is VALID [2019-05-15 10:15:20,234 INFO L273 TraceCheckUtils]: 37: Hoare triple {564#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n))} havoc linear_search_#t~short1; {564#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n))} is VALID [2019-05-15 10:15:20,237 INFO L273 TraceCheckUtils]: 38: Hoare triple {564#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n))} linear_search_#t~post2 := linear_search_~j~5; {564#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n))} is VALID [2019-05-15 10:15:20,237 INFO L273 TraceCheckUtils]: 39: Hoare triple {564#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n))} linear_search_~j~5 := linear_search_#t~post2 + 1; {564#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n))} is VALID [2019-05-15 10:15:20,238 INFO L273 TraceCheckUtils]: 40: Hoare triple {564#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n))} havoc linear_search_#t~post2; {564#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n))} is VALID [2019-05-15 10:15:20,240 INFO L273 TraceCheckUtils]: 41: Hoare triple {564#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n))} linear_search_#t~short1 := linear_search_~j~5 % 4294967296 < linear_search_~n % 4294967296; {613#(or (and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)) |ULTIMATE.start_linear_search_#t~short1|) (and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (not |ULTIMATE.start_linear_search_#t~short1|) (<= (mod ~SIZE 4294967296) (mod ULTIMATE.start_linear_search_~j~5 4294967296))))} is VALID [2019-05-15 10:15:20,242 INFO L273 TraceCheckUtils]: 42: Hoare triple {613#(or (and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)) |ULTIMATE.start_linear_search_#t~short1|) (and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (not |ULTIMATE.start_linear_search_#t~short1|) (<= (mod ~SIZE 4294967296) (mod ULTIMATE.start_linear_search_~j~5 4294967296))))} assume linear_search_#t~short1; {617#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)))} is VALID [2019-05-15 10:15:20,243 INFO L273 TraceCheckUtils]: 43: Hoare triple {617#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)))} 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; {617#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)))} is VALID [2019-05-15 10:15:20,245 INFO L273 TraceCheckUtils]: 44: Hoare triple {617#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)))} havoc read~int_#value; {617#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)))} is VALID [2019-05-15 10:15:20,245 INFO L273 TraceCheckUtils]: 45: Hoare triple {617#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)))} assume read~int_#value == #memory_int[read~int_#ptr.base,read~int_#ptr.offset]; {617#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)))} is VALID [2019-05-15 10:15:20,246 INFO L273 TraceCheckUtils]: 46: Hoare triple {617#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)))} linear_search_#t~mem0 := read~int_#value; {617#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)))} is VALID [2019-05-15 10:15:20,247 INFO L273 TraceCheckUtils]: 47: Hoare triple {617#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)))} linear_search_#t~short1 := linear_search_#t~mem0 != linear_search_~q; {617#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)))} is VALID [2019-05-15 10:15:20,248 INFO L273 TraceCheckUtils]: 48: Hoare triple {617#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)))} assume !linear_search_#t~short1; {617#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)))} is VALID [2019-05-15 10:15:20,250 INFO L273 TraceCheckUtils]: 49: Hoare triple {617#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)))} havoc linear_search_#t~mem0; {617#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)))} is VALID [2019-05-15 10:15:20,250 INFO L273 TraceCheckUtils]: 50: Hoare triple {617#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)))} havoc linear_search_#t~short1; {617#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)))} is VALID [2019-05-15 10:15:20,251 INFO L273 TraceCheckUtils]: 51: Hoare triple {617#(and (exists ((|ULTIMATE.start_main_#t~nondet3| Int)) (and (= ~SIZE (+ (div (mod |ULTIMATE.start_main_#t~nondet3| 4294967296) 8) 1)) (<= 0 (mod |ULTIMATE.start_main_#t~nondet3| 4294967296)))) (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)))} assume !(linear_search_~j~5 % 4294967296 < ~SIZE % 4294967296); {483#false} is VALID [2019-05-15 10:15:20,252 INFO L273 TraceCheckUtils]: 52: Hoare triple {483#false} linear_search_#res := 0; {483#false} is VALID [2019-05-15 10:15:20,252 INFO L273 TraceCheckUtils]: 53: Hoare triple {483#false} main_#t~ret5 := linear_search_#res; {483#false} is VALID [2019-05-15 10:15:20,252 INFO L273 TraceCheckUtils]: 54: Hoare triple {483#false} assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647; {483#false} is VALID [2019-05-15 10:15:20,252 INFO L273 TraceCheckUtils]: 55: Hoare triple {483#false} __VERIFIER_assert_#in~cond := main_#t~ret5; {483#false} is VALID [2019-05-15 10:15:20,253 INFO L273 TraceCheckUtils]: 56: Hoare triple {483#false} havoc __VERIFIER_assert_~cond; {483#false} is VALID [2019-05-15 10:15:20,253 INFO L273 TraceCheckUtils]: 57: Hoare triple {483#false} __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {483#false} is VALID [2019-05-15 10:15:20,253 INFO L273 TraceCheckUtils]: 58: Hoare triple {483#false} assume __VERIFIER_assert_~cond == 0; {483#false} is VALID [2019-05-15 10:15:20,254 INFO L273 TraceCheckUtils]: 59: Hoare triple {483#false} assume !false; {483#false} is VALID [2019-05-15 10:15:20,254 INFO L273 TraceCheckUtils]: 60: Hoare triple {483#false} assume !false; {483#false} is VALID [2019-05-15 10:15:20,276 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-05-15 10:15:20,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:15:20,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-05-15 10:15:20,278 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2019-05-15 10:15:20,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:15:20,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2019-05-15 10:15:20,444 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:20,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-05-15 10:15:20,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-05-15 10:15:20,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-05-15 10:15:20,445 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 7 states. [2019-05-15 10:15:22,935 WARN L188 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 22 [2019-05-15 10:15:35,008 WARN L188 SmtUtils]: Spent 12.05 s on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2019-05-15 10:15:35,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:35,321 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-05-15 10:15:35,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-05-15 10:15:35,322 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2019-05-15 10:15:35,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:15:35,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-05-15 10:15:35,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2019-05-15 10:15:35,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-05-15 10:15:35,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2019-05-15 10:15:35,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2019-05-15 10:15:35,427 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:35,427 INFO L225 Difference]: With dead ends: 52 [2019-05-15 10:15:35,427 INFO L226 Difference]: Without dead ends: 0 [2019-05-15 10:15:35,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-05-15 10:15:35,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-05-15 10:15:35,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-05-15 10:15:35,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:15:35,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-05-15 10:15:35,430 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:15:35,430 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:15:35,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:35,430 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:15:35,430 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:15:35,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:35,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:35,431 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:15:35,431 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:15:35,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:35,431 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:15:35,431 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:15:35,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:35,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:35,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:15:35,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:15:35,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-05-15 10:15:35,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-05-15 10:15:35,432 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 61 [2019-05-15 10:15:35,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:15:35,432 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-05-15 10:15:35,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-05-15 10:15:35,433 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:15:35,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:35,438 INFO L202 PluginConnector]: Adding new model linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:15:35 BoogieIcfgContainer [2019-05-15 10:15:35,438 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-05-15 10:15:35,439 INFO L168 Benchmark]: Toolchain (without parser) took 24749.62 ms. Allocated memory was 138.9 MB in the beginning and 244.8 MB in the end (delta: 105.9 MB). Free memory was 108.3 MB in the beginning and 215.6 MB in the end (delta: -107.2 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-05-15 10:15:35,440 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory is still 110.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-05-15 10:15:35,441 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.31 ms. Allocated memory is still 138.9 MB. Free memory was 108.3 MB in the beginning and 106.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-05-15 10:15:35,442 INFO L168 Benchmark]: Boogie Preprocessor took 24.21 ms. Allocated memory is still 138.9 MB. Free memory was 106.6 MB in the beginning and 105.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-05-15 10:15:35,443 INFO L168 Benchmark]: RCFGBuilder took 705.96 ms. Allocated memory is still 138.9 MB. Free memory was 105.3 MB in the beginning and 82.4 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. [2019-05-15 10:15:35,443 INFO L168 Benchmark]: TraceAbstraction took 23970.26 ms. Allocated memory was 138.9 MB in the beginning and 244.8 MB in the end (delta: 105.9 MB). Free memory was 82.2 MB in the beginning and 215.6 MB in the end (delta: -133.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-05-15 10:15:35,447 INFO L337 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.22 ms. Allocated memory is still 138.9 MB. Free memory is still 110.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.31 ms. Allocated memory is still 138.9 MB. Free memory was 108.3 MB in the beginning and 106.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.21 ms. Allocated memory is still 138.9 MB. Free memory was 106.6 MB in the beginning and 105.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 705.96 ms. Allocated memory is still 138.9 MB. Free memory was 105.3 MB in the beginning and 82.4 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23970.26 ms. Allocated memory was 138.9 MB in the beginning and 244.8 MB in the end (delta: 105.9 MB). Free memory was 82.2 MB in the beginning and 215.6 MB in the end (delta: -133.4 MB). There was no memory consumed. 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 56 locations, 1 error locations. SAFE Result, 23.9s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 16.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 84 SDtfs, 146 SDslu, 228 SDs, 0 SdLazy, 100 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 19.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 109 NumberOfCodeBlocks, 109 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 107 ConstructedInterpolants, 46 QuantifiedInterpolants, 74284 SizeOfPredicates, 11 NumberOfNonLiveVariables, 212 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1/8 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...