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_array_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Sandman01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 13:45:33,234 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 13:45:33,235 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 13:45:33,249 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 13:45:33,250 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 13:45:33,251 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 13:45:33,252 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 13:45:33,254 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 13:45:33,256 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 13:45:33,257 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 13:45:33,258 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 13:45:33,258 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 13:45:33,259 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 13:45:33,260 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 13:45:33,270 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 13:45:33,271 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 13:45:33,272 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 13:45:33,274 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 13:45:33,276 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 13:45:33,277 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 13:45:33,278 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 13:45:33,279 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 13:45:33,281 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 13:45:33,281 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 13:45:33,282 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 13:45:33,283 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 13:45:33,283 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 13:45:33,286 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 13:45:33,287 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 13:45:33,288 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 13:45:33,288 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 13:45:33,289 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 13:45:33,289 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 13:45:33,289 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 13:45:33,292 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 13:45:33,293 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 13:45:33,294 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-02-28 13:45:33,307 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 13:45:33,307 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 13:45:33,308 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 13:45:33,308 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 13:45:33,308 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 13:45:33,308 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 13:45:33,308 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 13:45:33,309 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 13:45:33,309 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 13:45:33,309 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-28 13:45:33,309 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-28 13:45:33,309 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 13:45:33,310 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 13:45:33,310 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 13:45:33,310 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 13:45:33,311 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 13:45:33,311 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 13:45:33,311 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 13:45:33,311 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 13:45:33,311 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 13:45:33,312 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 13:45:33,312 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 13:45:33,312 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 13:45:33,312 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 13:45:33,312 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 13:45:33,312 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 13:45:33,313 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 13:45:33,313 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 13:45:33,313 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 13:45:33,313 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 13:45:33,313 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:45:33,314 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 13:45:33,314 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 13:45:33,314 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 13:45:33,314 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 13:45:33,314 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 13:45:33,315 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 13:45:33,315 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 13:45:33,315 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 13:45:33,359 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 13:45:33,370 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 13:45:33,373 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 13:45:33,375 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 13:45:33,375 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 13:45:33,376 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Sandman01.bpl [2019-02-28 13:45:33,376 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Sandman01.bpl' [2019-02-28 13:45:33,410 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 13:45:33,412 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 13:45:33,413 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 13:45:33,413 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 13:45:33,413 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 13:45:33,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:45:33" (1/1) ... [2019-02-28 13:45:33,439 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:45:33" (1/1) ... [2019-02-28 13:45:33,445 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-28 13:45:33,445 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-28 13:45:33,446 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-28 13:45:33,448 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 13:45:33,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 13:45:33,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 13:45:33,449 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 13:45:33,459 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:45:33" (1/1) ... [2019-02-28 13:45:33,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:45:33" (1/1) ... [2019-02-28 13:45:33,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:45:33" (1/1) ... [2019-02-28 13:45:33,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:45:33" (1/1) ... [2019-02-28 13:45:33,463 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:45:33" (1/1) ... [2019-02-28 13:45:33,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:45:33" (1/1) ... [2019-02-28 13:45:33,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:45:33" (1/1) ... [2019-02-28 13:45:33,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 13:45:33,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 13:45:33,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 13:45:33,471 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 13:45:33,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:45:33" (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:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:45:33,529 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-02-28 13:45:33,529 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-02-28 13:45:33,530 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-02-28 13:45:33,816 INFO L278 CfgBuilder]: Using library mode [2019-02-28 13:45:33,816 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-02-28 13:45:33,818 INFO L202 PluginConnector]: Adding new model Sandman01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:45:33 BoogieIcfgContainer [2019-02-28 13:45:33,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 13:45:33,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 13:45:33,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 13:45:33,822 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 13:45:33,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:45:33" (1/2) ... [2019-02-28 13:45:33,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1098ceb2 and model type Sandman01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 01:45:33, skipping insertion in model container [2019-02-28 13:45:33,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:45:33" (2/2) ... [2019-02-28 13:45:33,826 INFO L112 eAbstractionObserver]: Analyzing ICFG Sandman01.bpl [2019-02-28 13:45:33,849 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 13:45:33,862 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-28 13:45:33,889 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-28 13:45:33,954 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 13:45:33,954 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 13:45:33,954 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 13:45:33,954 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 13:45:33,954 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 13:45:33,954 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 13:45:33,958 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 13:45:33,958 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 13:45:33,975 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-28 13:45:33,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 13:45:33,980 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:45:33,981 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 13:45:33,985 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:45:34,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:45:34,003 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2019-02-28 13:45:34,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:45:34,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:45:34,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:45:34,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:45:34,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:45:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:45:34,277 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} a := a[x := 0];a := a[y := 1000]; {11#(or (= (select main_a main_x) 0) (= main_x main_y))} is VALID [2019-02-28 13:45:34,282 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(or (= (select main_a main_x) 0) (= main_x main_y))} assume x > y && a[x] == 1000; {10#false} is VALID [2019-02-28 13:45:34,283 INFO L273 TraceCheckUtils]: 2: Hoare triple {10#false} assume !(a[y] <= 0); {10#false} is VALID [2019-02-28 13:45:34,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:45:34,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:45:34,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 13:45:34,287 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:45:34,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 13:45:34,293 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:45:34,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-28 13:45:34,322 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:45:34,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 13:45:34,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 13:45:34,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:45:34,331 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-02-28 13:45:34,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:45:34,461 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-02-28 13:45:34,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 13:45:34,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 13:45:34,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:45:34,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:45:34,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-02-28 13:45:34,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:45:34,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-02-28 13:45:34,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 14 transitions. [2019-02-28 13:45:34,567 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:45:34,577 INFO L225 Difference]: With dead ends: 13 [2019-02-28 13:45:34,577 INFO L226 Difference]: Without dead ends: 5 [2019-02-28 13:45:34,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:45:34,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-02-28 13:45:34,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-02-28 13:45:34,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:45:34,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-02-28 13:45:34,660 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-02-28 13:45:34,661 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-02-28 13:45:34,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:45:34,663 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-02-28 13:45:34,663 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-28 13:45:34,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:45:34,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:45:34,664 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-02-28 13:45:34,665 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-02-28 13:45:34,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:45:34,666 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-02-28 13:45:34,667 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-28 13:45:34,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:45:34,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:45:34,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:45:34,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:45:34,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-28 13:45:34,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-02-28 13:45:34,671 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-02-28 13:45:34,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:45:34,671 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-02-28 13:45:34,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 13:45:34,672 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-28 13:45:34,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 13:45:34,672 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:45:34,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 13:45:34,673 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:45:34,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:45:34,674 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2019-02-28 13:45:34,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:45:34,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:45:34,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:45:34,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:45:34,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:45:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:45:35,189 INFO L273 TraceCheckUtils]: 0: Hoare triple {46#true} a := a[x := 0];a := a[y := 1000]; {48#(or (= (select main_a main_x) 0) (= main_x main_y))} is VALID [2019-02-28 13:45:35,200 INFO L273 TraceCheckUtils]: 1: Hoare triple {48#(or (= (select main_a main_x) 0) (= main_x main_y))} a := a[x := a[x] + 1];a := a[y := a[y] - 1]; {49#(or (not (= (select main_a main_x) 1000)) (= main_x main_y))} is VALID [2019-02-28 13:45:35,212 INFO L273 TraceCheckUtils]: 2: Hoare triple {49#(or (not (= (select main_a main_x) 1000)) (= main_x main_y))} assume x > y && a[x] == 1000; {47#false} is VALID [2019-02-28 13:45:35,213 INFO L273 TraceCheckUtils]: 3: Hoare triple {47#false} assume !(a[y] <= 0); {47#false} is VALID [2019-02-28 13:45:35,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:45:35,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:45:35,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:45:35,215 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 13:45:35,218 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [9] [2019-02-28 13:45:35,290 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 13:45:35,290 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 13:45:36,971 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 13:45:36,973 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 13:45:36,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:45:36,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 13:45:36,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:45:36,978 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 13:45:36,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:45:36,989 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 13:45:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:45:36,998 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-28 13:45:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:45:37,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:45:37,122 INFO L442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-02-28 13:45:37,149 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2019-02-28 13:45:37,156 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-02-28 13:45:37,174 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-28 13:45:37,207 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-28 13:45:37,208 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:9, output treesize:21 [2019-02-28 13:45:37,217 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:45:37,218 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_main_a_11]. (= (store (store v_main_a_11 main_x 0) main_y 1000) main_a) [2019-02-28 13:45:37,218 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (= (select main_a main_y) 1000))) (or (and (= main_y main_x) .cse0) (and (= (select main_a main_x) 0) .cse0))) [2019-02-28 13:45:37,337 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2019-02-28 13:45:37,343 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:45:37,369 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 27 [2019-02-28 13:45:37,416 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 19 [2019-02-28 13:45:37,427 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:45:37,431 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:45:37,440 INFO L315 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:45:37,461 INFO L169 IndexEqualityManager]: detected equality via solver [2019-02-28 13:45:37,497 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-02-28 13:45:37,542 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-02-28 13:45:37,545 INFO L315 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-28 13:45:37,547 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:45:37,553 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:45:37,573 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-28 13:45:37,574 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:69, output treesize:21