java -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_array_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f57a05f [2019-01-07 21:56:21,255 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 21:56:21,257 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 21:56:21,271 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 21:56:21,271 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 21:56:21,272 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 21:56:21,273 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 21:56:21,275 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 21:56:21,277 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 21:56:21,278 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 21:56:21,279 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 21:56:21,279 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 21:56:21,280 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 21:56:21,281 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 21:56:21,282 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 21:56:21,283 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 21:56:21,283 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 21:56:21,285 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 21:56:21,287 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 21:56:21,289 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 21:56:21,290 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 21:56:21,291 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 21:56:21,294 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 21:56:21,294 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 21:56:21,294 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 21:56:21,295 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 21:56:21,296 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 21:56:21,297 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 21:56:21,298 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 21:56:21,299 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 21:56:21,299 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 21:56:21,300 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 21:56:21,300 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 21:56:21,301 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 21:56:21,301 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 21:56:21,302 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 21:56:21,303 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-07 21:56:21,316 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 21:56:21,316 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 21:56:21,317 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 21:56:21,317 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 21:56:21,317 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 21:56:21,318 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 21:56:21,318 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 21:56:21,318 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 21:56:21,318 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 21:56:21,318 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-07 21:56:21,319 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-07 21:56:21,319 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 21:56:21,319 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 21:56:21,320 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 21:56:21,320 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 21:56:21,320 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 21:56:21,320 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 21:56:21,320 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 21:56:21,321 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 21:56:21,321 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 21:56:21,321 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 21:56:21,321 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 21:56:21,321 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 21:56:21,321 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 21:56:21,322 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 21:56:21,322 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 21:56:21,322 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 21:56:21,322 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 21:56:21,322 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 21:56:21,323 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 21:56:21,323 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 21:56:21,323 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 21:56:21,323 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 21:56:21,323 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 21:56:21,323 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 21:56:21,324 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 21:56:21,324 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 21:56:21,324 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 21:56:21,324 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 21:56:21,356 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 21:56:21,370 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 21:56:21,374 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 21:56:21,375 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 21:56:21,376 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 21:56:21,377 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl [2019-01-07 21:56:21,377 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl' [2019-01-07 21:56:21,412 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 21:56:21,414 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 21:56:21,415 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 21:56:21,416 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 21:56:21,416 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 21:56:21,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:56:21" (1/1) ... [2019-01-07 21:56:21,454 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:56:21" (1/1) ... [2019-01-07 21:56:21,461 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-07 21:56:21,461 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-07 21:56:21,462 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-07 21:56:21,468 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 21:56:21,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 21:56:21,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 21:56:21,470 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 21:56:21,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:56:21" (1/1) ... [2019-01-07 21:56:21,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:56:21" (1/1) ... [2019-01-07 21:56:21,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:56:21" (1/1) ... [2019-01-07 21:56:21,494 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:56:21" (1/1) ... [2019-01-07 21:56:21,500 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:56:21" (1/1) ... [2019-01-07 21:56:21,508 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:56:21" (1/1) ... [2019-01-07 21:56:21,509 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:56:21" (1/1) ... [2019-01-07 21:56:21,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 21:56:21,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 21:56:21,511 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 21:56:21,511 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 21:56:21,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:56:21" (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-01-07 21:56:21,597 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-01-07 21:56:21,597 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-07 21:56:21,597 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-07 21:56:21,843 INFO L278 CfgBuilder]: Using library mode [2019-01-07 21:56:21,844 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-07 21:56:21,845 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 09:56:21 BoogieIcfgContainer [2019-01-07 21:56:21,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 21:56:21,846 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 21:56:21,846 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 21:56:21,849 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 21:56:21,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:56:21" (1/2) ... [2019-01-07 21:56:21,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24610016 and model type ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 09:56:21, skipping insertion in model container [2019-01-07 21:56:21,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 09:56:21" (2/2) ... [2019-01-07 21:56:21,853 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit01.bpl [2019-01-07 21:56:21,864 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 21:56:21,873 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-07 21:56:21,891 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-07 21:56:21,924 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 21:56:21,924 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 21:56:21,925 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 21:56:21,925 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 21:56:21,925 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 21:56:21,925 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 21:56:21,926 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 21:56:21,926 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 21:56:21,942 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-07 21:56:21,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 21:56:21,950 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:21,950 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 21:56:21,953 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:21,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:21,960 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-01-07 21:56:21,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:22,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:22,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:56:22,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:22,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:22,103 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-07 21:56:22,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 21:56:22,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-07 21:56:22,105 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:56:22,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 21:56:22,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 21:56:22,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 21:56:22,126 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-07 21:56:22,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:22,184 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-07 21:56:22,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 21:56:22,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-07 21:56:22,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:22,199 INFO L225 Difference]: With dead ends: 11 [2019-01-07 21:56:22,199 INFO L226 Difference]: Without dead ends: 5 [2019-01-07 21:56:22,203 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-01-07 21:56:22,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-07 21:56:22,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-07 21:56:22,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-07 21:56:22,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-07 21:56:22,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-07 21:56:22,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:22,238 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-07 21:56:22,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 21:56:22,238 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-07 21:56:22,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:56:22,239 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:22,239 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:56:22,239 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:22,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:22,240 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-01-07 21:56:22,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:22,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:22,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:56:22,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:22,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:22,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:22,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:22,557 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:22,558 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:56:22,560 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [7] [2019-01-07 21:56:22,624 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 21:56:22,624 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:56:24,823 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-07 21:56:24,825 INFO L272 AbstractInterpreter]: Visited 4 different actions 15 times. Merged at 2 different actions 7 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 21:56:24,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:24,840 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-07 21:56:25,047 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 42.22% of their original sizes. [2019-01-07 21:56:25,048 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-07 21:56:27,185 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_36 Int) (v_idx_34 Int) (v_idx_35 Int)) (exists ((v_v_281_1 Int) (v_b_26_1 Int) (v_v_279_1 Int)) (and (<= (+ c_r 1) v_b_26_1) (<= 2 (* 2 v_b_26_1)) (<= 0 (* 2 c_r)) (or (< v_idx_36 v_b_26_1) (= v_v_281_1 (select c_a v_idx_36))) (<= 0 c_r) (or (= (select c_a v_idx_34) v_v_279_1) (<= 0 v_idx_34)) (<= 1 (+ v_b_26_1 c_r)) (<= 1 v_b_26_1) (or (= 0 (select c_a v_idx_35)) (<= v_b_26_1 v_idx_35) (< v_idx_35 0))))) is different from false [2019-01-07 21:56:27,206 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-01-07 21:56:27,206 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-07 21:56:27,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-07 21:56:27,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2019-01-07 21:56:27,208 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:56:27,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 21:56:27,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 21:56:27,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2019-01-07 21:56:27,211 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-01-07 21:56:31,383 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_36 Int) (v_idx_34 Int) (v_idx_35 Int)) (exists ((v_v_281_1 Int) (v_b_26_1 Int) (v_v_279_1 Int)) (and (<= (+ c_r 1) v_b_26_1) (<= 2 (* 2 v_b_26_1)) (<= 0 (* 2 c_r)) (or (< v_idx_36 v_b_26_1) (= v_v_281_1 (select c_a v_idx_36))) (<= 0 c_r) (or (= (select c_a v_idx_34) v_v_279_1) (<= 0 v_idx_34)) (<= 1 (+ v_b_26_1 c_r)) (<= 1 v_b_26_1) (or (= 0 (select c_a v_idx_35)) (<= v_b_26_1 v_idx_35) (< v_idx_35 0))))) (forall ((v_idx_30 Int) (v_idx_29 Int) (v_idx_28 Int)) (exists ((v_v_281_1 Int) (v_v_279_1 Int)) (and (<= 0 c_i) (<= 0 (* 2 c_i)) (or (= v_v_281_1 (select c_a v_idx_30)) (< v_idx_30 c_i)) (or (< v_idx_29 0) (<= c_i v_idx_29) (= (select c_a v_idx_29) 0)) (or (= (select c_a v_idx_28) v_v_279_1) (<= 0 v_idx_28)))))) is different from false [2019-01-07 21:56:31,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:31,419 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-07 21:56:31,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 21:56:31,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-07 21:56:31,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:31,420 INFO L225 Difference]: With dead ends: 5 [2019-01-07 21:56:31,420 INFO L226 Difference]: Without dead ends: 0 [2019-01-07 21:56:31,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=7, Invalid=5, Unknown=2, NotChecked=6, Total=20 [2019-01-07 21:56:31,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-07 21:56:31,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-07 21:56:31,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-07 21:56:31,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-07 21:56:31,423 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2019-01-07 21:56:31,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:31,423 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-07 21:56:31,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 21:56:31,424 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-07 21:56:31,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 21:56:31,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-07 21:56:31,473 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 23 35) no Hoare annotation was computed. [2019-01-07 21:56:31,473 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 23 35) no Hoare annotation was computed. [2019-01-07 21:56:31,474 INFO L444 ceAbstractionStarter]: At program point L29-1(lines 29 32) the Hoare annotation is: (forall ((v_idx_30 Int) (v_idx_29 Int) (v_idx_28 Int)) (exists ((v_v_281_1 Int) (v_v_279_1 Int)) (and (<= 0 i) (<= 0 (* 2 i)) (or (= v_v_281_1 (select a v_idx_30)) (< v_idx_30 i)) (or (< v_idx_29 0) (<= i v_idx_29) (= (select a v_idx_29) 0)) (or (= (select a v_idx_28) v_v_279_1) (<= 0 v_idx_28))))) [2019-01-07 21:56:31,474 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 34) no Hoare annotation was computed. [2019-01-07 21:56:31,474 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 23 35) no Hoare annotation was computed. [2019-01-07 21:56:31,475 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-07 21:56:31,484 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.01 09:56:31 BoogieIcfgContainer [2019-01-07 21:56:31,484 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-07 21:56:31,485 INFO L168 Benchmark]: Toolchain (without parser) took 10071.62 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.0 MB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -696.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 7.1 GB. [2019-01-07 21:56:31,487 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 21:56:31,488 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.63 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 21:56:31,489 INFO L168 Benchmark]: Boogie Preprocessor took 40.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 21:56:31,489 INFO L168 Benchmark]: RCFGBuilder took 334.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-01-07 21:56:31,491 INFO L168 Benchmark]: TraceAbstraction took 9638.12 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -717.7 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. [2019-01-07 21:56:31,495 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 53.63 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 334.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9638.12 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -717.7 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 34]: 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: 29]: Loop Invariant Derived loop invariant: (forall v_idx_30 : int, v_idx_29 : int, v_idx_28 : int :: (exists v_v_281_1 : int, v_v_279_1 : int :: (((0 <= i && 0 <= 2 * i) && (v_v_281_1 == a[v_idx_30] || v_idx_30 < i)) && ((v_idx_29 < 0 || i <= v_idx_29) || a[v_idx_29] == 0)) && (a[v_idx_28] == v_v_279_1 || 0 <= v_idx_28))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 9.5s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 4.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6 SDtfs, 1 SDslu, 4 SDs, 0 SdLazy, 3 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s 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, 2.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 0.0 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 41 HoareAnnotationTreeSize, 1 FomulaSimplifications, 46 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 71 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...