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-1de736e-m [2019-02-14 16:19:00,838 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-14 16:19:00,840 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-14 16:19:00,860 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-14 16:19:00,861 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-14 16:19:00,863 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-14 16:19:00,866 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-14 16:19:00,870 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-14 16:19:00,871 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-14 16:19:00,875 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-14 16:19:00,878 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-14 16:19:00,879 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-14 16:19:00,880 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-14 16:19:00,881 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-14 16:19:00,884 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-14 16:19:00,886 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-14 16:19:00,887 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-14 16:19:00,898 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-14 16:19:00,900 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-14 16:19:00,904 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-14 16:19:00,905 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-14 16:19:00,907 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-14 16:19:00,912 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-14 16:19:00,912 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-14 16:19:00,913 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-14 16:19:00,915 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-14 16:19:00,916 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-14 16:19:00,919 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-14 16:19:00,920 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-14 16:19:00,922 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-14 16:19:00,923 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-14 16:19:00,924 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-14 16:19:00,925 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-14 16:19:00,925 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-14 16:19:00,926 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-14 16:19:00,927 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-14 16:19:00,927 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-14 16:19:00,948 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-14 16:19:00,949 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-14 16:19:00,949 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-14 16:19:00,950 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-14 16:19:00,950 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-14 16:19:00,950 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-14 16:19:00,950 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-14 16:19:00,951 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-14 16:19:00,951 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-14 16:19:00,951 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-14 16:19:00,952 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-14 16:19:00,952 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-14 16:19:00,952 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-14 16:19:00,952 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-14 16:19:00,953 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-14 16:19:00,953 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-14 16:19:00,954 INFO L133 SettingsManager]: * Use SBE=true [2019-02-14 16:19:00,954 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-14 16:19:00,954 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-14 16:19:00,954 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-14 16:19:00,955 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-14 16:19:00,955 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-14 16:19:00,955 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-14 16:19:00,955 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-14 16:19:00,955 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-14 16:19:00,956 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-14 16:19:00,957 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-14 16:19:00,958 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-14 16:19:00,958 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-14 16:19:00,958 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-14 16:19:00,958 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-14 16:19:00,959 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-14 16:19:00,960 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-14 16:19:00,960 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-14 16:19:00,960 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-14 16:19:00,960 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-14 16:19:00,960 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-14 16:19:00,961 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-14 16:19:00,961 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-14 16:19:00,961 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-14 16:19:01,008 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-14 16:19:01,022 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-14 16:19:01,027 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-14 16:19:01,029 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-14 16:19:01,029 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-14 16:19:01,030 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 [2019-02-14 16:19:01,031 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/mcmillan2006.c.i_3.bpl' [2019-02-14 16:19:01,097 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-14 16:19:01,098 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-14 16:19:01,099 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-14 16:19:01,099 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-14 16:19:01,099 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-14 16:19:01,118 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 14.02 04:19:01" (1/1) ... [2019-02-14 16:19:01,131 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 14.02 04:19:01" (1/1) ... [2019-02-14 16:19:01,140 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-14 16:19:01,141 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-14 16:19:01,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-14 16:19:01,142 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-14 16:19:01,152 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 14.02 04:19:01" (1/1) ... [2019-02-14 16:19:01,153 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 14.02 04:19:01" (1/1) ... [2019-02-14 16:19:01,154 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 14.02 04:19:01" (1/1) ... [2019-02-14 16:19:01,155 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 14.02 04:19:01" (1/1) ... [2019-02-14 16:19:01,162 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 14.02 04:19:01" (1/1) ... [2019-02-14 16:19:01,164 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 14.02 04:19:01" (1/1) ... [2019-02-14 16:19:01,165 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 14.02 04:19:01" (1/1) ... [2019-02-14 16:19:01,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-14 16:19:01,168 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-14 16:19:01,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-14 16:19:01,168 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-14 16:19:01,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:19:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-14 16:19:01,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-14 16:19:01,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-14 16:19:01,593 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-14 16:19:01,593 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-02-14 16:19:01,595 INFO L202 PluginConnector]: Adding new model mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 04:19:01 BoogieIcfgContainer [2019-02-14 16:19:01,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-14 16:19:01,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-14 16:19:01,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-14 16:19:01,599 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-14 16:19:01,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:19:01" (1/2) ... [2019-02-14 16:19:01,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74e6ed47 and model type mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 04:19:01, skipping insertion in model container [2019-02-14 16:19:01,601 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 14.02 04:19:01" (2/2) ... [2019-02-14 16:19:01,603 INFO L112 eAbstractionObserver]: Analyzing ICFG mcmillan2006.c.i_3.bpl [2019-02-14 16:19:01,612 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-14 16:19:01,620 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-14 16:19:01,637 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-14 16:19:01,670 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-14 16:19:01,670 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-14 16:19:01,670 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-14 16:19:01,670 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-14 16:19:01,670 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-14 16:19:01,671 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-14 16:19:01,671 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-14 16:19:01,671 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-14 16:19:01,686 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-14 16:19:01,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-14 16:19:01,692 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:19:01,693 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-14 16:19:01,696 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:19:01,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:19:01,702 INFO L82 PathProgramCache]: Analyzing trace with hash 30017, now seen corresponding path program 1 times [2019-02-14 16:19:01,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:19:01,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:01,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:19:01,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:01,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:19:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:01,944 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 [2019-02-14 16:19:01,949 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 [2019-02-14 16:19:01,949 INFO L273 TraceCheckUtils]: 2: Hoare triple {10#false} assume !false; {10#false} is VALID [2019-02-14 16:19:01,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:19:01,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-14 16:19:01,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-14 16:19:01,954 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-14 16:19:01,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-14 16:19:01,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:19:01,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-14 16:19:02,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:19:02,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-14 16:19:02,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-14 16:19:02,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-14 16:19:02,010 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-02-14 16:19:02,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:02,121 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-02-14 16:19:02,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-14 16:19:02,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-14 16:19:02,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:19:02,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-14 16:19:02,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-02-14 16:19:02,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-14 16:19:02,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-02-14 16:19:02,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 10 transitions. [2019-02-14 16:19:02,219 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:19:02,229 INFO L225 Difference]: With dead ends: 9 [2019-02-14 16:19:02,229 INFO L226 Difference]: Without dead ends: 5 [2019-02-14 16:19:02,232 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 [2019-02-14 16:19:02,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-02-14 16:19:02,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-02-14 16:19:02,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:19:02,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-02-14 16:19:02,282 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-02-14 16:19:02,282 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-02-14 16:19:02,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:02,284 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-02-14 16:19:02,284 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-14 16:19:02,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:02,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:02,285 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-02-14 16:19:02,285 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-02-14 16:19:02,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:02,287 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-02-14 16:19:02,287 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-14 16:19:02,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:02,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:02,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:19:02,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:19:02,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-14 16:19:02,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-02-14 16:19:02,291 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-02-14 16:19:02,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:19:02,291 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-02-14 16:19:02,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-14 16:19:02,292 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-14 16:19:02,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-14 16:19:02,292 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:19:02,293 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-14 16:19:02,293 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:19:02,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:19:02,293 INFO L82 PathProgramCache]: Analyzing trace with hash 928552, now seen corresponding path program 1 times [2019-02-14 16:19:02,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:19:02,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:02,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:19:02,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:02,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:19:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:02,603 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 [2019-02-14 16:19:02,612 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 [2019-02-14 16:19:02,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 [2019-02-14 16:19:02,629 INFO L273 TraceCheckUtils]: 3: Hoare triple {46#false} assume !false; {46#false} is VALID [2019-02-14 16:19:02,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:19:02,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:19:02,631 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:19:02,632 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-14 16:19:02,634 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2019-02-14 16:19:02,673 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-14 16:19:02,674 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-14 16:19:03,144 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-14 16:19:03,146 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. [2019-02-14 16:19:03,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:19:03,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-14 16:19:03,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:19:03,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-14 16:19:03,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:19:03,172 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-14 16:19:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:03,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:19:03,631 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 [2019-02-14 16:19:03,643 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 [2019-02-14 16:19:03,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:19:03,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:19:03,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:19:03,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-02-14 16:19:03,797 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 [2019-02-14 16:19:03,809 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 [2019-02-14 16:19:03,822 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 [2019-02-14 16:19:03,823 INFO L273 TraceCheckUtils]: 3: Hoare triple {46#false} assume !false; {46#false} is VALID [2019-02-14 16:19:03,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:19:03,824 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:19:03,960 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 [2019-02-14 16:19:04,077 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 [2019-02-14 16:19:04,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:19:04,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:19:04,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:19:04,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:5 [2019-02-14 16:19:04,107 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:19:04,107 WARN L398 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)) [2019-02-14 16:19:04,108 WARN L399 uantifierElimination]: ElimStorePlain result: ∀ []. (= 0 (* 4 ULTIMATE.start_main_~i~8)) [2019-02-14 16:19:04,114 INFO L273 TraceCheckUtils]: 3: Hoare triple {46#false} assume !false; {46#false} is VALID [2019-02-14 16:19:04,116 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 [2019-02-14 16:19:04,118 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 [2019-02-14 16:19:04,119 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 [2019-02-14 16:19:04,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:19:04,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-14 16:19:04,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-02-14 16:19:04,142 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-14 16:19:04,143 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-14 16:19:04,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:19:04,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-02-14 16:19:04,169 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:19:04,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-14 16:19:04,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-14 16:19:04,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-02-14 16:19:04,170 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 6 states. [2019-02-14 16:19:04,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:04,225 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-02-14 16:19:04,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-14 16:19:04,225 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-14 16:19:04,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:19:04,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-14 16:19:04,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2019-02-14 16:19:04,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-14 16:19:04,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2019-02-14 16:19:04,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 5 transitions. [2019-02-14 16:19:04,253 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:19:04,253 INFO L225 Difference]: With dead ends: 5 [2019-02-14 16:19:04,253 INFO L226 Difference]: Without dead ends: 0 [2019-02-14 16:19:04,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-02-14 16:19:04,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-14 16:19:04,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-14 16:19:04,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:19:04,255 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-02-14 16:19:04,255 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-14 16:19:04,255 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-14 16:19:04,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:04,255 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-14 16:19:04,255 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-14 16:19:04,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:04,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:04,256 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-14 16:19:04,256 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-14 16:19:04,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:04,256 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-14 16:19:04,256 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-14 16:19:04,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:04,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:04,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:19:04,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:19:04,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-14 16:19:04,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-14 16:19:04,257 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2019-02-14 16:19:04,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:19:04,257 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-14 16:19:04,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-14 16:19:04,258 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-14 16:19:04,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:04,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-14 16:19:04,356 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))))) [2019-02-14 16:19:04,357 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 9 83) no Hoare annotation was computed. [2019-02-14 16:19:04,357 INFO L444 ceAbstractionStarter]: At program point L80(lines 80 81) the Hoare annotation is: false [2019-02-14 16:19:04,357 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 9 83) no Hoare annotation was computed. [2019-02-14 16:19:04,357 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 9 83) no Hoare annotation was computed. [2019-02-14 16:19:04,357 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 82) no Hoare annotation was computed. [2019-02-14 16:19:04,359 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2019-02-14 16:19:04,389 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2019-02-14 16:19:04,389 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2019-02-14 16:19:04,389 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2019-02-14 16:19:04,390 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. [2019-02-14 16:19:04,398 INFO L202 PluginConnector]: Adding new model mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 04:19:04 BoogieIcfgContainer [2019-02-14 16:19:04,399 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-14 16:19:04,400 INFO L168 Benchmark]: Toolchain (without parser) took 3303.00 ms. Allocated memory was 141.0 MB in the beginning and 223.3 MB in the end (delta: 82.3 MB). Free memory was 108.2 MB in the beginning and 171.5 MB in the end (delta: -63.2 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. [2019-02-14 16:19:04,403 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 141.0 MB. Free memory is still 109.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-14 16:19:04,403 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.75 ms. Allocated memory is still 141.0 MB. Free memory was 108.2 MB in the beginning and 106.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-02-14 16:19:04,405 INFO L168 Benchmark]: Boogie Preprocessor took 26.42 ms. Allocated memory is still 141.0 MB. Free memory was 106.5 MB in the beginning and 105.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-02-14 16:19:04,406 INFO L168 Benchmark]: RCFGBuilder took 427.06 ms. Allocated memory is still 141.0 MB. Free memory was 105.2 MB in the beginning and 91.7 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2019-02-14 16:19:04,407 INFO L168 Benchmark]: TraceAbstraction took 2802.99 ms. Allocated memory was 141.0 MB in the beginning and 223.3 MB in the end (delta: 82.3 MB). Free memory was 91.3 MB in the beginning and 171.5 MB in the end (delta: -80.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-02-14 16:19:04,414 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 141.0 MB. Free memory is still 109.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.75 ms. Allocated memory is still 141.0 MB. Free memory was 108.2 MB in the beginning and 106.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.42 ms. Allocated memory is still 141.0 MB. Free memory was 106.5 MB in the beginning and 105.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 427.06 ms. Allocated memory is still 141.0 MB. Free memory was 105.2 MB in the beginning and 91.7 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2802.99 ms. Allocated memory was 141.0 MB in the beginning and 223.3 MB in the end (delta: 82.3 MB). Free memory was 91.3 MB in the beginning and 171.5 MB in the end (delta: -80.2 MB). Peak memory consumption was 2.1 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.6s 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.3s 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.5s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 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.0s SatisfiabilityAnalysisTime, 1.3s 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...