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/sum_array.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 14:31:11,238 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 14:31:11,240 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 14:31:11,252 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 14:31:11,252 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 14:31:11,253 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 14:31:11,255 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 14:31:11,257 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 14:31:11,259 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 14:31:11,260 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 14:31:11,261 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 14:31:11,261 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 14:31:11,262 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 14:31:11,263 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 14:31:11,264 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 14:31:11,265 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 14:31:11,266 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 14:31:11,268 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 14:31:11,271 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 14:31:11,273 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 14:31:11,274 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 14:31:11,276 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 14:31:11,284 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 14:31:11,284 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 14:31:11,285 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 14:31:11,289 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 14:31:11,290 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 14:31:11,291 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 14:31:11,295 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 14:31:11,296 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 14:31:11,297 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 14:31:11,297 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 14:31:11,298 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 14:31:11,299 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 14:31:11,301 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 14:31:11,302 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 14:31:11,304 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-01-31 14:31:11,327 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 14:31:11,328 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 14:31:11,329 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 14:31:11,331 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 14:31:11,331 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 14:31:11,332 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 14:31:11,332 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 14:31:11,332 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 14:31:11,332 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-31 14:31:11,332 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 14:31:11,332 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-31 14:31:11,333 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-31 14:31:11,333 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 14:31:11,333 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 14:31:11,334 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 14:31:11,334 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 14:31:11,334 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 14:31:11,334 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 14:31:11,334 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 14:31:11,335 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 14:31:11,335 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 14:31:11,335 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 14:31:11,335 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 14:31:11,335 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 14:31:11,335 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 14:31:11,336 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 14:31:11,336 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 14:31:11,336 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 14:31:11,336 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 14:31:11,336 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 14:31:11,337 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 14:31:11,337 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 14:31:11,337 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 14:31:11,337 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 14:31:11,337 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 14:31:11,337 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 14:31:11,338 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 14:31:11,338 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 14:31:11,338 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 14:31:11,338 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 14:31:11,369 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 14:31:11,383 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 14:31:11,387 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 14:31:11,389 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 14:31:11,389 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 14:31:11,390 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum_array.i_3.bpl [2019-01-31 14:31:11,391 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum_array.i_3.bpl' [2019-01-31 14:31:11,466 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 14:31:11,467 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 14:31:11,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 14:31:11,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 14:31:11,468 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 14:31:11,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:11" (1/1) ... [2019-01-31 14:31:11,502 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:11" (1/1) ... [2019-01-31 14:31:11,512 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 14:31:11,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 14:31:11,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 14:31:11,513 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 14:31:11,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:11" (1/1) ... [2019-01-31 14:31:11,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:11" (1/1) ... [2019-01-31 14:31:11,527 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:11" (1/1) ... [2019-01-31 14:31:11,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:11" (1/1) ... [2019-01-31 14:31:11,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:11" (1/1) ... [2019-01-31 14:31:11,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:11" (1/1) ... [2019-01-31 14:31:11,538 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:11" (1/1) ... [2019-01-31 14:31:11,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 14:31:11,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 14:31:11,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 14:31:11,544 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 14:31:11,546 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:11" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 14:31:11,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 14:31:11,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 14:31:12,050 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 14:31:12,050 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-31 14:31:12,052 INFO L202 PluginConnector]: Adding new model sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:31:12 BoogieIcfgContainer [2019-01-31 14:31:12,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 14:31:12,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 14:31:12,053 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 14:31:12,056 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 14:31:12,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:11" (1/2) ... [2019-01-31 14:31:12,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f57ca5f and model type sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 02:31:12, skipping insertion in model container [2019-01-31 14:31:12,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:31:12" (2/2) ... [2019-01-31 14:31:12,060 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_array.i_3.bpl [2019-01-31 14:31:12,070 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 14:31:12,078 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-31 14:31:12,096 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-31 14:31:12,131 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 14:31:12,132 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 14:31:12,132 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 14:31:12,132 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 14:31:12,132 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 14:31:12,133 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 14:31:12,133 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 14:31:12,133 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 14:31:12,152 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-01-31 14:31:12,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 14:31:12,169 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:12,170 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 14:31:12,175 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:12,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:12,181 INFO L82 PathProgramCache]: Analyzing trace with hash 28790250, now seen corresponding path program 1 times [2019-01-31 14:31:12,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:12,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:12,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:12,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:12,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:12,500 INFO L273 TraceCheckUtils]: 0: Hoare triple {11#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~nondet4, main_#t~post3, main_#t~post5, main_#t~post6, main_~M~6, main_~A~6, main_~B~6, main_~C~6, main_~i~6;main_~M~6 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~A~6;havoc main_~B~6;havoc main_~C~6;havoc main_~i~6;main_~i~6 := 0; {13#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-31 14:31:12,513 INFO L273 TraceCheckUtils]: 1: Hoare triple {13#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);main_~i~6 := 0; {14#(<= ULTIMATE.start_main_~M~6 (* 4294967296 (div ULTIMATE.start_main_~M~6 4294967296)))} is VALID [2019-01-31 14:31:12,518 INFO L273 TraceCheckUtils]: 2: Hoare triple {14#(<= ULTIMATE.start_main_~M~6 (* 4294967296 (div ULTIMATE.start_main_~M~6 4294967296)))} assume !(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);main_~i~6 := 0; {14#(<= ULTIMATE.start_main_~M~6 (* 4294967296 (div ULTIMATE.start_main_~M~6 4294967296)))} is VALID [2019-01-31 14:31:12,525 INFO L273 TraceCheckUtils]: 3: Hoare triple {14#(<= ULTIMATE.start_main_~M~6 (* 4294967296 (div ULTIMATE.start_main_~M~6 4294967296)))} assume !(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);main_~i~6 := 0;assume !!(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~C~6[main_~i~6 % 4294967296] == main_~A~6[main_~i~6 % 4294967296] + main_~B~6[main_~i~6 % 4294967296] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {12#false} is VALID [2019-01-31 14:31:12,526 INFO L273 TraceCheckUtils]: 4: Hoare triple {12#false} assume !false; {12#false} is VALID [2019-01-31 14:31:12,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:12,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:31:12,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-31 14:31:12,530 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:31:12,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-31 14:31:12,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:12,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-31 14:31:12,567 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:12,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 14:31:12,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 14:31:12,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-31 14:31:12,577 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 4 states. [2019-01-31 14:31:13,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:13,174 INFO L93 Difference]: Finished difference Result 17 states and 26 transitions. [2019-01-31 14:31:13,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 14:31:13,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-31 14:31:13,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:13,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:13,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2019-01-31 14:31:13,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:13,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2019-01-31 14:31:13,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2019-01-31 14:31:13,314 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:13,324 INFO L225 Difference]: With dead ends: 17 [2019-01-31 14:31:13,324 INFO L226 Difference]: Without dead ends: 9 [2019-01-31 14:31:13,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-31 14:31:13,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-31 14:31:13,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-31 14:31:13,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:13,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 9 states. [2019-01-31 14:31:13,420 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2019-01-31 14:31:13,421 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2019-01-31 14:31:13,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:13,422 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2019-01-31 14:31:13,423 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2019-01-31 14:31:13,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:13,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:13,423 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2019-01-31 14:31:13,423 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2019-01-31 14:31:13,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:13,425 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2019-01-31 14:31:13,426 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2019-01-31 14:31:13,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:13,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:13,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:13,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:13,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-31 14:31:13,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-01-31 14:31:13,431 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 5 [2019-01-31 14:31:13,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:13,431 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-01-31 14:31:13,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 14:31:13,432 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2019-01-31 14:31:13,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 14:31:13,432 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:13,433 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 14:31:13,433 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:13,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:13,434 INFO L82 PathProgramCache]: Analyzing trace with hash 266557342, now seen corresponding path program 1 times [2019-01-31 14:31:13,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:13,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:13,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:13,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:13,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:14,246 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 5 [2019-01-31 14:31:14,443 INFO L273 TraceCheckUtils]: 0: Hoare triple {82#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~nondet4, main_#t~post3, main_#t~post5, main_#t~post6, main_~M~6, main_~A~6, main_~B~6, main_~C~6, main_~i~6;main_~M~6 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~A~6;havoc main_~B~6;havoc main_~C~6;havoc main_~i~6;main_~i~6 := 0; {84#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-31 14:31:14,443 INFO L273 TraceCheckUtils]: 1: Hoare triple {84#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~A~6 := main_~A~6[main_~i~6 % 4294967296 := main_#t~nondet2];havoc main_#t~nondet2;assume !!(main_~A~6[main_~i~6 % 4294967296] <= 1000000);main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {82#true} is VALID [2019-01-31 14:31:14,444 INFO L273 TraceCheckUtils]: 2: Hoare triple {82#true} assume !(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);main_~i~6 := 0; {82#true} is VALID [2019-01-31 14:31:14,444 INFO L273 TraceCheckUtils]: 3: Hoare triple {82#true} assume !!(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;main_~B~6 := main_~B~6[main_~i~6 % 4294967296 := main_#t~nondet4];havoc main_#t~nondet4;assume !!(main_~B~6[main_~i~6 % 4294967296] <= 1000000);main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 + 1;havoc main_#t~post3; {82#true} is VALID [2019-01-31 14:31:14,448 INFO L273 TraceCheckUtils]: 4: Hoare triple {82#true} assume !(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);main_~i~6 := 0; {85#(= ULTIMATE.start_main_~i~6 (* 4294967296 (div ULTIMATE.start_main_~i~6 4294967296)))} is VALID [2019-01-31 14:31:14,449 INFO L273 TraceCheckUtils]: 5: Hoare triple {85#(= ULTIMATE.start_main_~i~6 (* 4294967296 (div ULTIMATE.start_main_~i~6 4294967296)))} assume !!(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);main_~C~6 := main_~C~6[main_~i~6 % 4294967296 := main_~A~6[main_~i~6 % 4294967296] + main_~B~6[main_~i~6 % 4294967296]];main_#t~post5 := main_~i~6;main_~i~6 := main_#t~post5 + 1;havoc main_#t~post5; {86#(= (select ULTIMATE.start_main_~C~6 0) (+ (select ULTIMATE.start_main_~B~6 0) (select ULTIMATE.start_main_~A~6 0)))} is VALID [2019-01-31 14:31:14,455 INFO L273 TraceCheckUtils]: 6: Hoare triple {86#(= (select ULTIMATE.start_main_~C~6 0) (+ (select ULTIMATE.start_main_~B~6 0) (select ULTIMATE.start_main_~A~6 0)))} assume !(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);main_~i~6 := 0;assume !!(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~C~6[main_~i~6 % 4294967296] == main_~A~6[main_~i~6 % 4294967296] + main_~B~6[main_~i~6 % 4294967296] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {83#false} is VALID [2019-01-31 14:31:14,455 INFO L273 TraceCheckUtils]: 7: Hoare triple {83#false} assume !false; {83#false} is VALID [2019-01-31 14:31:14,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 14:31:14,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:14,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:31:14,457 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 14:31:14,459 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [19], [21], [23] [2019-01-31 14:31:14,499 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 14:31:14,499 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 14:31:15,035 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 14:31:15,036 INFO L272 AbstractInterpreter]: Visited 8 different actions 24 times. Merged at 3 different actions 8 times. Never widened. Performed 314 root evaluator evaluations with a maximum evaluation depth of 5. Performed 314 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 11 fixpoints after 6 different actions. Largest state had 0 variables. [2019-01-31 14:31:15,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:15,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 14:31:15,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:15,042 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-01-31 14:31:15,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:15,052 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 14:31:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:15,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:31:15,417 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-01-31 14:31:15,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:15,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:31:15,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:1 [2019-01-31 14:31:15,517 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:31:15,518 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~A~6_8, v_ULTIMATE.start_main_~i~6_17, |v_ULTIMATE.start_main_#t~nondet2_4|]. (and (<= 0 v_ULTIMATE.start_main_~i~6_17) (= (store v_ULTIMATE.start_main_~A~6_8 (mod v_ULTIMATE.start_main_~i~6_17 4294967296) |v_ULTIMATE.start_main_#t~nondet2_4|) ULTIMATE.start_main_~A~6) (<= v_ULTIMATE.start_main_~i~6_17 0)) [2019-01-31 14:31:15,518 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. true [2019-01-31 14:31:15,616 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-01-31 14:31:15,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:15,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:31:15,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:1 [2019-01-31 14:31:15,637 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:31:15,638 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~B~6_8, v_ULTIMATE.start_main_~i~6_18, |v_ULTIMATE.start_main_#t~nondet4_4|]. (and (<= 0 v_ULTIMATE.start_main_~i~6_18) (= (store v_ULTIMATE.start_main_~B~6_8 (mod v_ULTIMATE.start_main_~i~6_18 4294967296) |v_ULTIMATE.start_main_#t~nondet4_4|) ULTIMATE.start_main_~B~6) (<= v_ULTIMATE.start_main_~i~6_18 0)) [2019-01-31 14:31:15,638 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. true [2019-01-31 14:31:15,682 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 18 treesize of output 17 [2019-01-31 14:31:15,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:15,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 14:31:15,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2019-01-31 14:31:15,742 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:31:15,742 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~i~6_19, v_ULTIMATE.start_main_~C~6_7]. (and (<= v_ULTIMATE.start_main_~i~6_19 0) (<= 0 v_ULTIMATE.start_main_~i~6_19) (= (let ((.cse0 (mod v_ULTIMATE.start_main_~i~6_19 4294967296))) (store v_ULTIMATE.start_main_~C~6_7 .cse0 (+ (select ULTIMATE.start_main_~B~6 .cse0) (select ULTIMATE.start_main_~A~6 .cse0)))) ULTIMATE.start_main_~C~6)) [2019-01-31 14:31:15,743 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_ULTIMATE.start_main_~i~6_19]. (and (<= v_ULTIMATE.start_main_~i~6_19 0) (<= 0 v_ULTIMATE.start_main_~i~6_19) (let ((.cse0 (mod v_ULTIMATE.start_main_~i~6_19 4294967296))) (= (+ (select ULTIMATE.start_main_~B~6 .cse0) (select ULTIMATE.start_main_~A~6 .cse0)) (select ULTIMATE.start_main_~C~6 .cse0)))) [2019-01-31 14:31:15,833 INFO L273 TraceCheckUtils]: 0: Hoare triple {82#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~nondet4, main_#t~post3, main_#t~post5, main_#t~post6, main_~M~6, main_~A~6, main_~B~6, main_~C~6, main_~i~6;main_~M~6 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~A~6;havoc main_~B~6;havoc main_~C~6;havoc main_~i~6;main_~i~6 := 0; {84#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-31 14:31:15,834 INFO L273 TraceCheckUtils]: 1: Hoare triple {84#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~A~6 := main_~A~6[main_~i~6 % 4294967296 := main_#t~nondet2];havoc main_#t~nondet2;assume !!(main_~A~6[main_~i~6 % 4294967296] <= 1000000);main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {82#true} is VALID [2019-01-31 14:31:15,845 INFO L273 TraceCheckUtils]: 2: Hoare triple {82#true} assume !(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);main_~i~6 := 0; {84#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-31 14:31:15,846 INFO L273 TraceCheckUtils]: 3: Hoare triple {84#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;main_~B~6 := main_~B~6[main_~i~6 % 4294967296 := main_#t~nondet4];havoc main_#t~nondet4;assume !!(main_~B~6[main_~i~6 % 4294967296] <= 1000000);main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 + 1;havoc main_#t~post3; {82#true} is VALID [2019-01-31 14:31:15,847 INFO L273 TraceCheckUtils]: 4: Hoare triple {82#true} assume !(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);main_~i~6 := 0; {84#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-31 14:31:15,848 INFO L273 TraceCheckUtils]: 5: Hoare triple {84#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);main_~C~6 := main_~C~6[main_~i~6 % 4294967296 := main_~A~6[main_~i~6 % 4294967296] + main_~B~6[main_~i~6 % 4294967296]];main_#t~post5 := main_~i~6;main_~i~6 := main_#t~post5 + 1;havoc main_#t~post5; {86#(= (select ULTIMATE.start_main_~C~6 0) (+ (select ULTIMATE.start_main_~B~6 0) (select ULTIMATE.start_main_~A~6 0)))} is VALID [2019-01-31 14:31:15,850 INFO L273 TraceCheckUtils]: 6: Hoare triple {86#(= (select ULTIMATE.start_main_~C~6 0) (+ (select ULTIMATE.start_main_~B~6 0) (select ULTIMATE.start_main_~A~6 0)))} assume !(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);main_~i~6 := 0;assume !!(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~C~6[main_~i~6 % 4294967296] == main_~A~6[main_~i~6 % 4294967296] + main_~B~6[main_~i~6 % 4294967296] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {83#false} is VALID [2019-01-31 14:31:15,850 INFO L273 TraceCheckUtils]: 7: Hoare triple {83#false} assume !false; {83#false} is VALID [2019-01-31 14:31:15,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:15,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 14:31:15,956 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 11 treesize of output 9 [2019-01-31 14:31:15,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:15,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:31:15,979 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:5 [2019-01-31 14:31:16,004 INFO L273 TraceCheckUtils]: 7: Hoare triple {83#false} assume !false; {83#false} is VALID [2019-01-31 14:31:16,006 INFO L273 TraceCheckUtils]: 6: Hoare triple {86#(= (select ULTIMATE.start_main_~C~6 0) (+ (select ULTIMATE.start_main_~B~6 0) (select ULTIMATE.start_main_~A~6 0)))} assume !(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);main_~i~6 := 0;assume !!(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~C~6[main_~i~6 % 4294967296] == main_~A~6[main_~i~6 % 4294967296] + main_~B~6[main_~i~6 % 4294967296] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {83#false} is VALID [2019-01-31 14:31:16,007 INFO L273 TraceCheckUtils]: 5: Hoare triple {85#(= ULTIMATE.start_main_~i~6 (* 4294967296 (div ULTIMATE.start_main_~i~6 4294967296)))} assume !!(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);main_~C~6 := main_~C~6[main_~i~6 % 4294967296 := main_~A~6[main_~i~6 % 4294967296] + main_~B~6[main_~i~6 % 4294967296]];main_#t~post5 := main_~i~6;main_~i~6 := main_#t~post5 + 1;havoc main_#t~post5; {86#(= (select ULTIMATE.start_main_~C~6 0) (+ (select ULTIMATE.start_main_~B~6 0) (select ULTIMATE.start_main_~A~6 0)))} is VALID [2019-01-31 14:31:16,009 INFO L273 TraceCheckUtils]: 4: Hoare triple {82#true} assume !(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);main_~i~6 := 0; {85#(= ULTIMATE.start_main_~i~6 (* 4294967296 (div ULTIMATE.start_main_~i~6 4294967296)))} is VALID [2019-01-31 14:31:16,009 INFO L273 TraceCheckUtils]: 3: Hoare triple {82#true} assume !!(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;main_~B~6 := main_~B~6[main_~i~6 % 4294967296 := main_#t~nondet4];havoc main_#t~nondet4;assume !!(main_~B~6[main_~i~6 % 4294967296] <= 1000000);main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 + 1;havoc main_#t~post3; {82#true} is VALID [2019-01-31 14:31:16,010 INFO L273 TraceCheckUtils]: 2: Hoare triple {82#true} assume !(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);main_~i~6 := 0; {82#true} is VALID [2019-01-31 14:31:16,010 INFO L273 TraceCheckUtils]: 1: Hoare triple {82#true} assume !!(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~A~6 := main_~A~6[main_~i~6 % 4294967296 := main_#t~nondet2];havoc main_#t~nondet2;assume !!(main_~A~6[main_~i~6 % 4294967296] <= 1000000);main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {82#true} is VALID [2019-01-31 14:31:16,010 INFO L273 TraceCheckUtils]: 0: Hoare triple {82#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~nondet4, main_#t~post3, main_#t~post5, main_#t~post6, main_~M~6, main_~A~6, main_~B~6, main_~C~6, main_~i~6;main_~M~6 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~A~6;havoc main_~B~6;havoc main_~C~6;havoc main_~i~6;main_~i~6 := 0; {82#true} is VALID [2019-01-31 14:31:16,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-31 14:31:16,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 14:31:16,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2019-01-31 14:31:16,032 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 14:31:16,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-31 14:31:16,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:16,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2019-01-31 14:31:16,073 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:16,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 14:31:16,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 14:31:16,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-31 14:31:16,074 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 5 states. [2019-01-31 14:31:16,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:16,204 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2019-01-31 14:31:16,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 14:31:16,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-31 14:31:16,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:16,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-31 14:31:16,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-31 14:31:16,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-31 14:31:16,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-31 14:31:16,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 11 transitions. [2019-01-31 14:31:16,238 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:16,239 INFO L225 Difference]: With dead ends: 9 [2019-01-31 14:31:16,239 INFO L226 Difference]: Without dead ends: 0 [2019-01-31 14:31:16,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-31 14:31:16,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-31 14:31:16,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-31 14:31:16,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:16,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:16,241 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:16,242 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:16,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:16,242 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-31 14:31:16,242 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 14:31:16,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:16,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:16,243 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:16,243 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:16,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:16,243 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-31 14:31:16,243 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 14:31:16,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:16,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:16,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:16,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:16,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-31 14:31:16,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-31 14:31:16,244 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2019-01-31 14:31:16,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:16,244 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-31 14:31:16,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 14:31:16,244 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 14:31:16,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:16,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-31 14:31:16,302 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 92) no Hoare annotation was computed. [2019-01-31 14:31:16,302 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 92) no Hoare annotation was computed. [2019-01-31 14:31:16,302 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 92) no Hoare annotation was computed. [2019-01-31 14:31:16,302 INFO L444 ceAbstractionStarter]: At program point L89(lines 56 89) the Hoare annotation is: (or (and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6)) (= (select ULTIMATE.start_main_~C~6 0) (+ (select ULTIMATE.start_main_~B~6 0) (select ULTIMATE.start_main_~A~6 0)))) [2019-01-31 14:31:16,303 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 91) no Hoare annotation was computed. [2019-01-31 14:31:16,303 INFO L444 ceAbstractionStarter]: At program point L82(lines 82 90) the Hoare annotation is: false [2019-01-31 14:31:16,303 INFO L451 ceAbstractionStarter]: At program point L47(lines 28 47) the Hoare annotation is: true [2019-01-31 14:31:16,303 INFO L451 ceAbstractionStarter]: At program point L66(lines 37 66) the Hoare annotation is: true [2019-01-31 14:31:16,304 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2019-01-31 14:31:16,311 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2019-01-31 14:31:16,311 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2019-01-31 14:31:16,311 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2019-01-31 14:31:16,311 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2019-01-31 14:31:16,317 INFO L202 PluginConnector]: Adding new model sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 02:31:16 BoogieIcfgContainer [2019-01-31 14:31:16,318 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-31 14:31:16,319 INFO L168 Benchmark]: Toolchain (without parser) took 4852.71 ms. Allocated memory was 142.1 MB in the beginning and 224.4 MB in the end (delta: 82.3 MB). Free memory was 109.1 MB in the beginning and 142.8 MB in the end (delta: -33.7 MB). Peak memory consumption was 48.6 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:16,320 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 142.1 MB. Free memory is still 110.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 14:31:16,321 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.77 ms. Allocated memory is still 142.1 MB. Free memory was 109.1 MB in the beginning and 107.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:16,322 INFO L168 Benchmark]: Boogie Preprocessor took 26.39 ms. Allocated memory is still 142.1 MB. Free memory was 107.4 MB in the beginning and 106.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:16,323 INFO L168 Benchmark]: RCFGBuilder took 508.41 ms. Allocated memory is still 142.1 MB. Free memory was 106.1 MB in the beginning and 92.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:16,323 INFO L168 Benchmark]: TraceAbstraction took 4264.47 ms. Allocated memory was 142.1 MB in the beginning and 224.4 MB in the end (delta: 82.3 MB). Free memory was 92.1 MB in the beginning and 142.8 MB in the end (delta: -50.7 MB). Peak memory consumption was 31.6 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:16,328 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.19 ms. Allocated memory is still 142.1 MB. Free memory is still 110.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.77 ms. Allocated memory is still 142.1 MB. Free memory was 109.1 MB in the beginning and 107.4 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.39 ms. Allocated memory is still 142.1 MB. Free memory was 107.4 MB in the beginning and 106.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 508.41 ms. Allocated memory is still 142.1 MB. Free memory was 106.1 MB in the beginning and 92.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4264.47 ms. Allocated memory was 142.1 MB in the beginning and 224.4 MB in the end (delta: 82.3 MB). Free memory was 92.1 MB in the beginning and 142.8 MB in the end (delta: -50.7 MB). Peak memory consumption was 31.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: 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: 28]: Loop Invariant Derived loop invariant: true - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: true - InvariantResult [Line: 82]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: (main_~i~6 <= 0 && 0 <= main_~i~6) || main_~C~6[0] == main_~B~6[0] + main_~A~6[0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. SAFE Result, 4.1s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6 SDtfs, 1 SDslu, 3 SDs, 0 SdLazy, 30 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=1, 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, 4 LocationsWithAnnotation, 4 PreInvPairs, 11 NumberOfFragments, 22 HoareAnnotationTreeSize, 4 FomulaSimplifications, 14 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 697 SizeOfPredicates, 7 NumberOfNonLiveVariables, 41 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 3/9 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...