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/mcmillan2006.c.i_3.bpl
--------------------------------------------------------------------------------
This is Ultimate 0.1.24-c30ebe1
[2018-12-17 14:12:22,439 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-12-17 14:12:22,441 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-12-17 14:12:22,452 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-12-17 14:12:22,453 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-12-17 14:12:22,454 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-12-17 14:12:22,455 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-12-17 14:12:22,457 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-12-17 14:12:22,458 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-12-17 14:12:22,459 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-12-17 14:12:22,460 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-12-17 14:12:22,461 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-12-17 14:12:22,462 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-12-17 14:12:22,463 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-12-17 14:12:22,464 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-12-17 14:12:22,464 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-12-17 14:12:22,465 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-12-17 14:12:22,467 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-12-17 14:12:22,469 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-12-17 14:12:22,471 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-12-17 14:12:22,472 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-12-17 14:12:22,473 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-12-17 14:12:22,476 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-12-17 14:12:22,476 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-12-17 14:12:22,476 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-12-17 14:12:22,477 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-12-17 14:12:22,478 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-12-17 14:12:22,479 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-12-17 14:12:22,480 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-12-17 14:12:22,481 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-12-17 14:12:22,482 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-12-17 14:12:22,482 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-12-17 14:12:22,483 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring...
[2018-12-17 14:12:22,483 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values
[2018-12-17 14:12:22,484 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-12-17 14:12:22,485 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-12-17 14:12:22,485 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
[2018-12-17 14:12:22,500 INFO L110 SettingsManager]: Loading preferences was successful
[2018-12-17 14:12:22,501 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-12-17 14:12:22,502 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2018-12-17 14:12:22,502 INFO L133 SettingsManager]: * Show backtranslation warnings=false
[2018-12-17 14:12:22,502 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-12-17 14:12:22,502 INFO L133 SettingsManager]: * User list type=DISABLED
[2018-12-17 14:12:22,502 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2018-12-17 14:12:22,503 INFO L133 SettingsManager]: * Explicit value domain=true
[2018-12-17 14:12:22,504 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain
[2018-12-17 14:12:22,504 INFO L133 SettingsManager]: * Octagon Domain=false
[2018-12-17 14:12:22,504 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain
[2018-12-17 14:12:22,504 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true
[2018-12-17 14:12:22,504 INFO L133 SettingsManager]: * Interval Domain=false
[2018-12-17 14:12:22,505 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-12-17 14:12:22,505 INFO L133 SettingsManager]: * Create parallel compositions if possible=false
[2018-12-17 14:12:22,507 INFO L133 SettingsManager]: * Use SBE=true
[2018-12-17 14:12:22,507 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-12-17 14:12:22,507 INFO L133 SettingsManager]: * sizeof long=4
[2018-12-17 14:12:22,507 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-12-17 14:12:22,507 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-12-17 14:12:22,508 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-12-17 14:12:22,508 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2018-12-17 14:12:22,508 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-12-17 14:12:22,508 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2018-12-17 14:12:22,508 INFO L133 SettingsManager]: * sizeof long double=12
[2018-12-17 14:12:22,509 INFO L133 SettingsManager]: * Check if freed pointer was valid=false
[2018-12-17 14:12:22,510 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2018-12-17 14:12:22,511 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-12-17 14:12:22,511 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements
[2018-12-17 14:12:22,511 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-12-17 14:12:22,511 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-12-17 14:12:22,511 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-12-17 14:12:22,512 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2018-12-17 14:12:22,513 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-12-17 14:12:22,513 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN
[2018-12-17 14:12:22,513 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2018-12-17 14:12:22,513 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-12-17 14:12:22,513 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-12-17 14:12:22,514 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES
[2018-12-17 14:12:22,563 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-12-17 14:12:22,578 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-12-17 14:12:22,582 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2018-12-17 14:12:22,584 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser...
[2018-12-17 14:12:22,584 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized
[2018-12-17 14:12:22,585 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/mcmillan2006.c.i_3.bpl
[2018-12-17 14:12:22,585 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/mcmillan2006.c.i_3.bpl'
[2018-12-17 14:12:22,636 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-12-17 14:12:22,638 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-12-17 14:12:22,639 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2018-12-17 14:12:22,639 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2018-12-17 14:12:22,639 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized
[2018-12-17 14:12:22,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:22" (1/1) ...
[2018-12-17 14:12:22,671 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:22" (1/1) ...
[2018-12-17 14:12:22,680 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2018-12-17 14:12:22,681 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-12-17 14:12:22,681 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-12-17 14:12:22,681 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-12-17 14:12:22,694 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:22" (1/1) ...
[2018-12-17 14:12:22,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:22" (1/1) ...
[2018-12-17 14:12:22,696 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:22" (1/1) ...
[2018-12-17 14:12:22,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:22" (1/1) ...
[2018-12-17 14:12:22,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:22" (1/1) ...
[2018-12-17 14:12:22,702 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:22" (1/1) ...
[2018-12-17 14:12:22,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:22" (1/1) ...
[2018-12-17 14:12:22,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-12-17 14:12:22,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-12-17 14:12:22,706 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-12-17 14:12:22,706 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-12-17 14:12:22,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:22" (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
[2018-12-17 14:12:22,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-12-17 14:12:22,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-12-17 14:12:23,322 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-12-17 14:12:23,323 INFO L280 CfgBuilder]: Removed 2 assue(true) statements.
[2018-12-17 14:12:23,324 INFO L202 PluginConnector]: Adding new model mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:12:23 BoogieIcfgContainer
[2018-12-17 14:12:23,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-12-17 14:12:23,326 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-12-17 14:12:23,326 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-12-17 14:12:23,329 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-12-17 14:12:23,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:22" (1/2) ...
[2018-12-17 14:12:23,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b47a0d and model type mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:12:23, skipping insertion in model container
[2018-12-17 14:12:23,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:12:23" (2/2) ...
[2018-12-17 14:12:23,333 INFO L112 eAbstractionObserver]: Analyzing ICFG mcmillan2006.c.i_3.bpl
[2018-12-17 14:12:23,344 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-12-17 14:12:23,355 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2018-12-17 14:12:23,374 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2018-12-17 14:12:23,416 INFO L382 AbstractCegarLoop]: Interprodecural is true
[2018-12-17 14:12:23,416 INFO L383 AbstractCegarLoop]: Hoare is true
[2018-12-17 14:12:23,416 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-12-17 14:12:23,416 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2018-12-17 14:12:23,417 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-12-17 14:12:23,417 INFO L387 AbstractCegarLoop]: Difference is false
[2018-12-17 14:12:23,417 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-12-17 14:12:23,417 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-12-17 14:12:23,439 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states.
[2018-12-17 14:12:23,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4
[2018-12-17 14:12:23,458 INFO L394 BasicCegarLoop]: Found error trace
[2018-12-17 14:12:23,459 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1]
[2018-12-17 14:12:23,462 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2018-12-17 14:12:23,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2018-12-17 14:12:23,468 INFO L82 PathProgramCache]: Analyzing trace with hash 30017, now seen corresponding path program 1 times
[2018-12-17 14:12:23,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-12-17 14:12:23,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-12-17 14:12:23,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-12-17 14:12:23,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-12-17 14:12:23,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-12-17 14:12:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-17 14:12:23,708 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_~i~8, main_#t~mem5, main_#t~post4, main_~i~9, main_~n~7, main_~x~7.base, main_~x~7.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~n~7 := main_#t~nondet0;havoc main_#t~nondet0;assume !!(0 <= main_~n~7 && main_~n~7 <= 1000);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;#Ultimate.alloc_~size := main_~n~7 * 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_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;main_~x~7.base, main_~x~7.offset := main_#t~malloc1.base, main_#t~malloc1.offset;main_~i~8 := 0; {11#(= ULTIMATE.start_main_~i~8 0)} is VALID
[2018-12-17 14:12:23,715 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(= ULTIMATE.start_main_~i~8 0)} assume !(main_~i~8 < main_~n~7);main_~i~9 := 0;assume !!(main_~i~9 < main_~n~7);read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := main_~x~7.base, main_~x~7.offset + main_~i~9 * 4, 4;havoc read~int_#value;assume read~int_#value == #memory_int[read~int_#ptr.base,read~int_#ptr.offset];main_#t~mem5 := read~int_#value;__VERIFIER_assert_#in~cond := (if main_#t~mem5 == 0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {10#false} is VALID
[2018-12-17 14:12:23,716 INFO L273 TraceCheckUtils]: 2: Hoare triple {10#false} assume !false; {10#false} is VALID
[2018-12-17 14:12:23,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-12-17 14:12:23,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-12-17 14:12:23,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-12-17 14:12:23,721 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-12-17 14:12:23,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3
[2018-12-17 14:12:23,728 INFO L84 Accepts]: Finished accepts. word is accepted.
[2018-12-17 14:12:23,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states.
[2018-12-17 14:12:23,760 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2018-12-17 14:12:23,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-12-17 14:12:23,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-12-17 14:12:23,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-12-17 14:12:23,771 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states.
[2018-12-17 14:12:23,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-12-17 14:12:23,871 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions.
[2018-12-17 14:12:23,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-12-17 14:12:23,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3
[2018-12-17 14:12:23,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-12-17 14:12:23,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2018-12-17 14:12:23,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions.
[2018-12-17 14:12:23,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2018-12-17 14:12:23,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions.
[2018-12-17 14:12:23,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 10 transitions.
[2018-12-17 14:12:23,978 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2018-12-17 14:12:23,989 INFO L225 Difference]: With dead ends: 9
[2018-12-17 14:12:23,989 INFO L226 Difference]: Without dead ends: 5
[2018-12-17 14:12:23,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-12-17 14:12:24,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states.
[2018-12-17 14:12:24,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5.
[2018-12-17 14:12:24,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2018-12-17 14:12:24,077 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states.
[2018-12-17 14:12:24,077 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states.
[2018-12-17 14:12:24,078 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states.
[2018-12-17 14:12:24,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-12-17 14:12:24,079 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions.
[2018-12-17 14:12:24,080 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions.
[2018-12-17 14:12:24,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2018-12-17 14:12:24,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2018-12-17 14:12:24,081 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states.
[2018-12-17 14:12:24,082 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states.
[2018-12-17 14:12:24,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-12-17 14:12:24,083 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions.
[2018-12-17 14:12:24,083 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions.
[2018-12-17 14:12:24,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2018-12-17 14:12:24,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2018-12-17 14:12:24,086 INFO L88 GeneralOperation]: Finished isEquivalent.
[2018-12-17 14:12:24,086 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2018-12-17 14:12:24,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2018-12-17 14:12:24,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions.
[2018-12-17 14:12:24,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3
[2018-12-17 14:12:24,091 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-12-17 14:12:24,091 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions.
[2018-12-17 14:12:24,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-12-17 14:12:24,094 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions.
[2018-12-17 14:12:24,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5
[2018-12-17 14:12:24,094 INFO L394 BasicCegarLoop]: Found error trace
[2018-12-17 14:12:24,095 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1]
[2018-12-17 14:12:24,095 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2018-12-17 14:12:24,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2018-12-17 14:12:24,096 INFO L82 PathProgramCache]: Analyzing trace with hash 928552, now seen corresponding path program 1 times
[2018-12-17 14:12:24,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-12-17 14:12:24,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-12-17 14:12:24,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-12-17 14:12:24,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-12-17 14:12:24,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-12-17 14:12:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-17 14:12:24,602 INFO L273 TraceCheckUtils]: 0: Hoare triple {45#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_~i~8, main_#t~mem5, main_#t~post4, main_~i~9, main_~n~7, main_~x~7.base, main_~x~7.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~n~7 := main_#t~nondet0;havoc main_#t~nondet0;assume !!(0 <= main_~n~7 && main_~n~7 <= 1000);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;#Ultimate.alloc_~size := main_~n~7 * 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_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;main_~x~7.base, main_~x~7.offset := main_#t~malloc1.base, main_#t~malloc1.offset;main_~i~8 := 0; {47#(and (= ULTIMATE.start_main_~i~8 0) (= ULTIMATE.start_main_~x~7.offset 0))} is VALID
[2018-12-17 14:12:24,616 INFO L273 TraceCheckUtils]: 1: Hoare triple {47#(and (= ULTIMATE.start_main_~i~8 0) (= ULTIMATE.start_main_~x~7.offset 0))} assume !!(main_~i~8 < main_~n~7);write~int_old_#memory_int := #memory_int;write~int_#value, write~int_#ptr.base, write~int_#ptr.offset, write~int_#sizeOfWrittenType := 0, main_~x~7.base, main_~x~7.offset + main_~i~8 * 4, 4;havoc #memory_int;assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base,write~int_#ptr.offset := write~int_#value];main_#t~post2 := main_~i~8;main_~i~8 := main_#t~post2 + 1;havoc main_#t~post2; {48#(and (= ULTIMATE.start_main_~x~7.offset 0) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x~7.base) 0)))} is VALID
[2018-12-17 14:12:24,629 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#(and (= ULTIMATE.start_main_~x~7.offset 0) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x~7.base) 0)))} assume !(main_~i~8 < main_~n~7);main_~i~9 := 0;assume !!(main_~i~9 < main_~n~7);read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := main_~x~7.base, main_~x~7.offset + main_~i~9 * 4, 4;havoc read~int_#value;assume read~int_#value == #memory_int[read~int_#ptr.base,read~int_#ptr.offset];main_#t~mem5 := read~int_#value;__VERIFIER_assert_#in~cond := (if main_#t~mem5 == 0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {46#false} is VALID
[2018-12-17 14:12:24,630 INFO L273 TraceCheckUtils]: 3: Hoare triple {46#false} assume !false; {46#false} is VALID
[2018-12-17 14:12:24,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-12-17 14:12:24,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-12-17 14:12:24,631 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION
[2018-12-17 14:12:24,632 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions:
[2018-12-17 14:12:24,634 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9]
[2018-12-17 14:12:24,675 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain]
[2018-12-17 14:12:24,675 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2)
[2018-12-17 14:12:25,044 INFO L263 AbstractInterpreter]: Some error location(s) were reachable
[2018-12-17 14:12:25,046 INFO L272 AbstractInterpreter]: Visited 4 different actions 13 times. Merged at 3 different actions 9 times. Widened at 1 different actions 1 times. Performed 302 root evaluator evaluations with a maximum evaluation depth of 4. Performed 302 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 0 variables.
[2018-12-17 14:12:25,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2018-12-17 14:12:25,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown
[2018-12-17 14:12:25,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-12-17 14:12:25,053 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
[2018-12-17 14:12:25,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-12-17 14:12:25,063 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP)
[2018-12-17 14:12:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-17 14:12:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-17 14:12:25,134 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-12-17 14:12:25,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-12-17 14:12:25,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-12-17 14:12:25,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-12-17 14:12:25,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-12-17 14:12:25,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-12-17 14:12:25,479 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7
[2018-12-17 14:12:25,587 INFO L273 TraceCheckUtils]: 0: Hoare triple {45#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_~i~8, main_#t~mem5, main_#t~post4, main_~i~9, main_~n~7, main_~x~7.base, main_~x~7.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~n~7 := main_#t~nondet0;havoc main_#t~nondet0;assume !!(0 <= main_~n~7 && main_~n~7 <= 1000);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;#Ultimate.alloc_~size := main_~n~7 * 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_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;main_~x~7.base, main_~x~7.offset := main_#t~malloc1.base, main_#t~malloc1.offset;main_~i~8 := 0; {52#(= ULTIMATE.start_main_~i~8 0)} is VALID
[2018-12-17 14:12:25,606 INFO L273 TraceCheckUtils]: 1: Hoare triple {52#(= ULTIMATE.start_main_~i~8 0)} assume !!(main_~i~8 < main_~n~7);write~int_old_#memory_int := #memory_int;write~int_#value, write~int_#ptr.base, write~int_#ptr.offset, write~int_#sizeOfWrittenType := 0, main_~x~7.base, main_~x~7.offset + main_~i~8 * 4, 4;havoc #memory_int;assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base,write~int_#ptr.offset := write~int_#value];main_#t~post2 := main_~i~8;main_~i~8 := main_#t~post2 + 1;havoc main_#t~post2; {56#(= (select (select |#memory_int| ULTIMATE.start_main_~x~7.base) ULTIMATE.start_main_~x~7.offset) 0)} is VALID
[2018-12-17 14:12:25,615 INFO L273 TraceCheckUtils]: 2: Hoare triple {56#(= (select (select |#memory_int| ULTIMATE.start_main_~x~7.base) ULTIMATE.start_main_~x~7.offset) 0)} assume !(main_~i~8 < main_~n~7);main_~i~9 := 0;assume !!(main_~i~9 < main_~n~7);read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := main_~x~7.base, main_~x~7.offset + main_~i~9 * 4, 4;havoc read~int_#value;assume read~int_#value == #memory_int[read~int_#ptr.base,read~int_#ptr.offset];main_#t~mem5 := read~int_#value;__VERIFIER_assert_#in~cond := (if main_#t~mem5 == 0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {46#false} is VALID
[2018-12-17 14:12:25,616 INFO L273 TraceCheckUtils]: 3: Hoare triple {46#false} assume !false; {46#false} is VALID
[2018-12-17 14:12:25,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-12-17 14:12:25,617 INFO L316 TraceCheckSpWp]: Computing backward predicates...
[2018-12-17 14:12:25,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12
[2018-12-17 14:12:25,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3
[2018-12-17 14:12:25,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-12-17 14:12:25,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-12-17 14:12:25,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-12-17 14:12:25,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:5
[2018-12-17 14:12:25,925 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN.
[2018-12-17 14:12:25,925 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_ULTIMATE.start_write~int_old_#memory_int_2|, |v_ULTIMATE.start_write~int_#ptr.base_2|, ULTIMATE.start_main_~x~7.offset]. (= 0 (select (store (select |v_ULTIMATE.start_write~int_old_#memory_int_2| |v_ULTIMATE.start_write~int_#ptr.base_2|) (+ (* 4 ULTIMATE.start_main_~i~8) ULTIMATE.start_main_~x~7.offset) 0) ULTIMATE.start_main_~x~7.offset))
[2018-12-17 14:12:25,926 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (= 0 (* 4 ULTIMATE.start_main_~i~8))
[2018-12-17 14:12:25,952 INFO L273 TraceCheckUtils]: 3: Hoare triple {46#false} assume !false; {46#false} is VALID
[2018-12-17 14:12:25,953 INFO L273 TraceCheckUtils]: 2: Hoare triple {56#(= (select (select |#memory_int| ULTIMATE.start_main_~x~7.base) ULTIMATE.start_main_~x~7.offset) 0)} assume !(main_~i~8 < main_~n~7);main_~i~9 := 0;assume !!(main_~i~9 < main_~n~7);read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := main_~x~7.base, main_~x~7.offset + main_~i~9 * 4, 4;havoc read~int_#value;assume read~int_#value == #memory_int[read~int_#ptr.base,read~int_#ptr.offset];main_#t~mem5 := read~int_#value;__VERIFIER_assert_#in~cond := (if main_#t~mem5 == 0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {46#false} is VALID
[2018-12-17 14:12:25,959 INFO L273 TraceCheckUtils]: 1: Hoare triple {52#(= ULTIMATE.start_main_~i~8 0)} assume !!(main_~i~8 < main_~n~7);write~int_old_#memory_int := #memory_int;write~int_#value, write~int_#ptr.base, write~int_#ptr.offset, write~int_#sizeOfWrittenType := 0, main_~x~7.base, main_~x~7.offset + main_~i~8 * 4, 4;havoc #memory_int;assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base,write~int_#ptr.offset := write~int_#value];main_#t~post2 := main_~i~8;main_~i~8 := main_#t~post2 + 1;havoc main_#t~post2; {56#(= (select (select |#memory_int| ULTIMATE.start_main_~x~7.base) ULTIMATE.start_main_~x~7.offset) 0)} is VALID
[2018-12-17 14:12:25,960 INFO L273 TraceCheckUtils]: 0: Hoare triple {45#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_~i~8, main_#t~mem5, main_#t~post4, main_~i~9, main_~n~7, main_~x~7.base, main_~x~7.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~n~7 := main_#t~nondet0;havoc main_#t~nondet0;assume !!(0 <= main_~n~7 && main_~n~7 <= 1000);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;#Ultimate.alloc_~size := main_~n~7 * 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_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;main_~x~7.base, main_~x~7.offset := main_#t~malloc1.base, main_#t~malloc1.offset;main_~i~8 := 0; {52#(= ULTIMATE.start_main_~i~8 0)} is VALID
[2018-12-17 14:12:25,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-12-17 14:12:25,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences.
[2018-12-17 14:12:25,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5
[2018-12-17 14:12:25,982 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences
[2018-12-17 14:12:25,982 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4
[2018-12-17 14:12:25,983 INFO L84 Accepts]: Finished accepts. word is accepted.
[2018-12-17 14:12:25,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states.
[2018-12-17 14:12:26,007 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2018-12-17 14:12:26,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-12-17 14:12:26,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-12-17 14:12:26,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2018-12-17 14:12:26,008 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 6 states.
[2018-12-17 14:12:26,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-12-17 14:12:26,137 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions.
[2018-12-17 14:12:26,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-12-17 14:12:26,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4
[2018-12-17 14:12:26,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-12-17 14:12:26,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2018-12-17 14:12:26,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions.
[2018-12-17 14:12:26,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2018-12-17 14:12:26,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions.
[2018-12-17 14:12:26,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 5 transitions.
[2018-12-17 14:12:26,161 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2018-12-17 14:12:26,161 INFO L225 Difference]: With dead ends: 5
[2018-12-17 14:12:26,162 INFO L226 Difference]: Without dead ends: 0
[2018-12-17 14:12:26,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2018-12-17 14:12:26,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2018-12-17 14:12:26,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2018-12-17 14:12:26,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2018-12-17 14:12:26,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states.
[2018-12-17 14:12:26,165 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states.
[2018-12-17 14:12:26,165 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states.
[2018-12-17 14:12:26,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-12-17 14:12:26,165 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2018-12-17 14:12:26,165 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2018-12-17 14:12:26,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2018-12-17 14:12:26,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2018-12-17 14:12:26,166 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states.
[2018-12-17 14:12:26,166 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states.
[2018-12-17 14:12:26,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-12-17 14:12:26,166 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2018-12-17 14:12:26,166 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2018-12-17 14:12:26,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2018-12-17 14:12:26,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2018-12-17 14:12:26,167 INFO L88 GeneralOperation]: Finished isEquivalent.
[2018-12-17 14:12:26,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2018-12-17 14:12:26,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2018-12-17 14:12:26,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2018-12-17 14:12:26,168 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4
[2018-12-17 14:12:26,168 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-12-17 14:12:26,168 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2018-12-17 14:12:26,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-12-17 14:12:26,168 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2018-12-17 14:12:26,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2018-12-17 14:12:26,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2018-12-17 14:12:26,220 INFO L444 ceAbstractionStarter]: At program point L65(lines 50 66) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~x~7.offset 0))) (or (and (= ULTIMATE.start_main_~i~8 0) .cse0) (and .cse0 (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x~7.base) 0)))))
[2018-12-17 14:12:26,220 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 9 83) no Hoare annotation was computed.
[2018-12-17 14:12:26,220 INFO L444 ceAbstractionStarter]: At program point L80(lines 80 81) the Hoare annotation is: false
[2018-12-17 14:12:26,220 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 82) no Hoare annotation was computed.
[2018-12-17 14:12:26,220 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 9 83) no Hoare annotation was computed.
[2018-12-17 14:12:26,220 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 9 83) no Hoare annotation was computed.
[2018-12-17 14:12:26,222 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation
[2018-12-17 14:12:26,225 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation
[2018-12-17 14:12:26,225 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation
[2018-12-17 14:12:26,225 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation
[2018-12-17 14:12:26,225 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[2018-12-17 14:12:26,232 INFO L202 PluginConnector]: Adding new model mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 02:12:26 BoogieIcfgContainer
[2018-12-17 14:12:26,233 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-12-17 14:12:26,234 INFO L168 Benchmark]: Toolchain (without parser) took 3597.57 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 714.1 MB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -686.4 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB.
[2018-12-17 14:12:26,236 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-12-17 14:12:26,237 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.80 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-12-17 14:12:26,237 INFO L168 Benchmark]: Boogie Preprocessor took 24.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-12-17 14:12:26,238 INFO L168 Benchmark]: RCFGBuilder took 618.95 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB.
[2018-12-17 14:12:26,239 INFO L168 Benchmark]: TraceAbstraction took 2906.67 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 714.1 MB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -707.5 MB). Peak memory consumption was 6.6 MB. Max. memory is 7.1 GB.
[2018-12-17 14:12:26,243 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
* Boogie Procedure Inliner took 41.80 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
* Boogie Preprocessor took 24.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
* RCFGBuilder took 618.95 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 2906.67 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 714.1 MB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -707.5 MB). Peak memory consumption was 6.6 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- PositiveResult [Line: 82]: 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: 80]: Loop Invariant
Derived loop invariant: false
- InvariantResult [Line: 50]: Loop Invariant
Derived loop invariant: (main_~i~8 == 0 && main_~x~7.offset == 0) || (main_~x~7.offset == 0 && 0 == #memory_int[main_~x~7.base][0])
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 2.8s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4 SDtfs, 0 SDslu, 1 SDs, 0 SdLazy, 9 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s 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, 2 LocationsWithAnnotation, 2 PreInvPairs, 3 NumberOfFragments, 20 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 131 SizeOfPredicates, 16 NumberOfNonLiveVariables, 65 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be correct!
Received shutdown request...