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/toy/tooDifficultLoopInvariant/ArrayInit01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-e4dfe74 [2018-12-18 17:52:16,183 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-18 17:52:16,186 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-18 17:52:16,198 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-18 17:52:16,199 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-18 17:52:16,200 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-18 17:52:16,202 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-18 17:52:16,204 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-18 17:52:16,206 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-18 17:52:16,207 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-18 17:52:16,208 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-18 17:52:16,208 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-18 17:52:16,209 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-18 17:52:16,210 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-18 17:52:16,212 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-18 17:52:16,212 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-18 17:52:16,213 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-18 17:52:16,215 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-18 17:52:16,218 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-18 17:52:16,219 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-18 17:52:16,221 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-18 17:52:16,222 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-18 17:52:16,225 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-18 17:52:16,225 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-18 17:52:16,225 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-18 17:52:16,226 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-18 17:52:16,228 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-18 17:52:16,229 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-18 17:52:16,230 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-18 17:52:16,231 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-18 17:52:16,231 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-18 17:52:16,232 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-18 17:52:16,232 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-18 17:52:16,233 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-18 17:52:16,234 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-18 17:52:16,235 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-18 17:52:16,235 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-18 17:52:16,253 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-18 17:52:16,253 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-18 17:52:16,254 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-18 17:52:16,254 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-18 17:52:16,254 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-18 17:52:16,255 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-18 17:52:16,255 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-18 17:52:16,255 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-18 17:52:16,255 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-18 17:52:16,256 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-18 17:52:16,256 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-18 17:52:16,256 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-18 17:52:16,257 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-18 17:52:16,257 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-18 17:52:16,258 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-18 17:52:16,258 INFO L133 SettingsManager]: * Use SBE=true [2018-12-18 17:52:16,258 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-18 17:52:16,258 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-18 17:52:16,260 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-18 17:52:16,260 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-18 17:52:16,261 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-18 17:52:16,261 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-18 17:52:16,261 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-18 17:52:16,261 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-18 17:52:16,261 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-18 17:52:16,262 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-18 17:52:16,262 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-18 17:52:16,263 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-18 17:52:16,263 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-18 17:52:16,263 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-18 17:52:16,263 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-18 17:52:16,263 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-18 17:52:16,264 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-18 17:52:16,264 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-18 17:52:16,264 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-18 17:52:16,264 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-18 17:52:16,265 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-18 17:52:16,265 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-18 17:52:16,265 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-18 17:52:16,314 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-18 17:52:16,330 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-18 17:52:16,336 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-18 17:52:16,338 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-18 17:52:16,339 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-18 17:52:16,340 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl [2018-12-18 17:52:16,340 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl' [2018-12-18 17:52:16,390 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-18 17:52:16,392 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-18 17:52:16,393 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-18 17:52:16,393 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-18 17:52:16,393 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-18 17:52:16,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 05:52:16" (1/1) ... [2018-12-18 17:52:16,425 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 05:52:16" (1/1) ... [2018-12-18 17:52:16,434 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-18 17:52:16,434 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-18 17:52:16,435 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-18 17:52:16,437 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-18 17:52:16,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-18 17:52:16,439 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-18 17:52:16,439 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-18 17:52:16,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 05:52:16" (1/1) ... [2018-12-18 17:52:16,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 05:52:16" (1/1) ... [2018-12-18 17:52:16,454 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 05:52:16" (1/1) ... [2018-12-18 17:52:16,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 05:52:16" (1/1) ... [2018-12-18 17:52:16,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 05:52:16" (1/1) ... [2018-12-18 17:52:16,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 05:52:16" (1/1) ... [2018-12-18 17:52:16,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 05:52:16" (1/1) ... [2018-12-18 17:52:16,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-18 17:52:16,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-18 17:52:16,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-18 17:52:16,469 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-18 17:52:16,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 05:52:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-18 17:52:16,551 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-18 17:52:16,552 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-18 17:52:16,552 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-18 17:52:16,798 INFO L272 CfgBuilder]: Using library mode [2018-12-18 17:52:16,799 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-18 17:52:16,799 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:52:16 BoogieIcfgContainer [2018-12-18 17:52:16,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-18 17:52:16,801 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-18 17:52:16,801 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-18 17:52:16,804 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-18 17:52:16,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 05:52:16" (1/2) ... [2018-12-18 17:52:16,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39fd0a7b and model type ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:52:16, skipping insertion in model container [2018-12-18 17:52:16,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:52:16" (2/2) ... [2018-12-18 17:52:16,808 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit01.bpl [2018-12-18 17:52:16,819 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-18 17:52:16,828 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-18 17:52:16,865 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-18 17:52:16,936 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-18 17:52:16,936 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-18 17:52:16,936 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-18 17:52:16,937 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-18 17:52:16,937 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-18 17:52:16,937 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-18 17:52:16,937 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-18 17:52:16,937 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-18 17:52:16,956 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-18 17:52:16,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-18 17:52:16,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 17:52:16,968 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-18 17:52:16,971 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-18 17:52:16,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 17:52:16,978 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2018-12-18 17:52:16,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 17:52:17,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 17:52:17,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 17:52:17,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 17:52:17,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 17:52:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 17:52:17,182 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} i := 0;assume j == i; {11#(= i 0)} is VALID [2018-12-18 17:52:17,192 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(= i 0)} assume !(i < n);assume 0 <= r && r < n; {10#false} is VALID [2018-12-18 17:52:17,192 INFO L273 TraceCheckUtils]: 2: Hoare triple {10#false} assume !(a[r] == 0); {10#false} is VALID [2018-12-18 17:52:17,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 17:52:17,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-18 17:52:17,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-18 17:52:17,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-18 17:52:17,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-18 17:52:17,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 17:52:17,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-18 17:52:17,231 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 17:52:17,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-18 17:52:17,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-18 17:52:17,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-18 17:52:17,244 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-18 17:52:17,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 17:52:17,354 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-18 17:52:17,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-18 17:52:17,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-18 17:52:17,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 17:52:17,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 17:52:17,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2018-12-18 17:52:17,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 17:52:17,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2018-12-18 17:52:17,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 11 transitions. [2018-12-18 17:52:17,418 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 17:52:17,429 INFO L225 Difference]: With dead ends: 11 [2018-12-18 17:52:17,429 INFO L226 Difference]: Without dead ends: 5 [2018-12-18 17:52:17,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-18 17:52:17,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-18 17:52:17,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-18 17:52:17,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 17:52:17,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2018-12-18 17:52:17,503 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2018-12-18 17:52:17,503 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2018-12-18 17:52:17,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 17:52:17,505 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2018-12-18 17:52:17,505 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-18 17:52:17,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 17:52:17,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 17:52:17,506 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2018-12-18 17:52:17,506 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2018-12-18 17:52:17,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 17:52:17,507 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2018-12-18 17:52:17,507 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-18 17:52:17,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 17:52:17,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 17:52:17,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 17:52:17,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 17:52:17,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-18 17:52:17,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-18 17:52:17,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-18 17:52:17,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 17:52:17,512 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-18 17:52:17,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-18 17:52:17,512 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-18 17:52:17,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-18 17:52:17,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 17:52:17,513 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-18 17:52:17,513 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-18 17:52:17,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 17:52:17,513 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2018-12-18 17:52:17,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 17:52:17,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 17:52:17,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 17:52:17,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 17:52:17,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 17:52:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 17:52:18,034 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 7 [2018-12-18 17:52:18,041 INFO L273 TraceCheckUtils]: 0: Hoare triple {44#true} i := 0;assume j == i; {46#(= i 0)} is VALID [2018-12-18 17:52:18,051 INFO L273 TraceCheckUtils]: 1: Hoare triple {46#(= i 0)} assume i < n;a := a[i := 0];i := i + 1; {47#(and (<= i 1) (= 0 (select a 0)))} is VALID [2018-12-18 17:52:18,055 INFO L273 TraceCheckUtils]: 2: Hoare triple {47#(and (<= i 1) (= 0 (select a 0)))} assume !(i < n);assume 0 <= r && r < n; {48#(and (= r 0) (= 0 (select a r)))} is VALID [2018-12-18 17:52:18,060 INFO L273 TraceCheckUtils]: 3: Hoare triple {48#(and (= r 0) (= 0 (select a r)))} assume !(a[r] == 0); {45#false} is VALID [2018-12-18 17:52:18,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 17:52:18,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 17:52:18,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-18 17:52:18,063 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-18 17:52:18,065 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [7] [2018-12-18 17:52:18,105 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-18 17:52:18,105 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-18 17:52:18,339 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-18 17:52:18,341 INFO L272 AbstractInterpreter]: Visited 4 different actions 13 times. Merged at 3 different actions 9 times. Widened at 1 different actions 1 times. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-18 17:52:18,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 17:52:18,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-18 17:52:18,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 17:52:18,348 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-18 17:52:18,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 17:52:18,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-18 17:52:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 17:52:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 17:52:18,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-18 17:52:18,693 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 6 treesize of output 5 [2018-12-18 17:52:18,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 17:52:18,720 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. [2018-12-18 17:52:18,720 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-18 17:52:18,724 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 17:52:18,724 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_a_5, v_i_5]. (and (= a (store v_a_5 v_i_5 0)) (<= i (+ v_i_5 1)) (<= v_i_5 0)) [2018-12-18 17:52:18,725 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_i_5]. (and (<= i (+ v_i_5 1)) (= (select a v_i_5) 0) (<= v_i_5 0)) [2018-12-18 17:52:18,992 INFO L273 TraceCheckUtils]: 0: Hoare triple {44#true} i := 0;assume j == i; {52#(<= i 0)} is VALID [2018-12-18 17:52:19,006 INFO L273 TraceCheckUtils]: 1: Hoare triple {52#(<= i 0)} assume i < n;a := a[i := 0];i := i + 1; {56#(exists ((v_i_5 Int)) (and (<= i (+ v_i_5 1)) (= (select a v_i_5) 0) (<= v_i_5 0)))} is VALID [2018-12-18 17:52:19,021 INFO L273 TraceCheckUtils]: 2: Hoare triple {56#(exists ((v_i_5 Int)) (and (<= i (+ v_i_5 1)) (= (select a v_i_5) 0) (<= v_i_5 0)))} assume !(i < n);assume 0 <= r && r < n; {48#(and (= r 0) (= 0 (select a r)))} is VALID [2018-12-18 17:52:19,029 INFO L273 TraceCheckUtils]: 3: Hoare triple {48#(and (= r 0) (= 0 (select a r)))} assume !(a[r] == 0); {45#false} is VALID [2018-12-18 17:52:19,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 17:52:19,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-18 17:52:19,540 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-12-18 17:52:19,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-18 17:52:19,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 17:52:19,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 17:52:19,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2018-12-18 17:52:19,823 INFO L273 TraceCheckUtils]: 3: Hoare triple {63#(= (select a r) 0)} assume !(a[r] == 0); {45#false} is VALID [2018-12-18 17:52:19,829 INFO L273 TraceCheckUtils]: 2: Hoare triple {67#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= (select a r) 0)))} assume !(i < n);assume 0 <= r && r < n; {63#(= (select a r) 0)} is VALID [2018-12-18 17:52:19,831 INFO L273 TraceCheckUtils]: 1: Hoare triple {52#(<= i 0)} assume i < n;a := a[i := 0];i := i + 1; {67#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= (select a r) 0)))} is VALID [2018-12-18 17:52:19,831 INFO L273 TraceCheckUtils]: 0: Hoare triple {44#true} i := 0;assume j == i; {52#(<= i 0)} is VALID [2018-12-18 17:52:19,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 17:52:19,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-18 17:52:19,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2018-12-18 17:52:19,855 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-18 17:52:19,856 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2018-12-18 17:52:19,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 17:52:19,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-12-18 17:52:19,868 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 17:52:19,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-18 17:52:19,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-18 17:52:19,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-18 17:52:19,870 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 7 states. [2018-12-18 17:52:20,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 17:52:20,021 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-18 17:52:20,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-18 17:52:20,021 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2018-12-18 17:52:20,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 17:52:20,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-18 17:52:20,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2018-12-18 17:52:20,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-18 17:52:20,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2018-12-18 17:52:20,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 8 transitions. [2018-12-18 17:52:20,044 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 17:52:20,045 INFO L225 Difference]: With dead ends: 8 [2018-12-18 17:52:20,046 INFO L226 Difference]: Without dead ends: 6 [2018-12-18 17:52:20,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-18 17:52:20,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-18 17:52:20,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-18 17:52:20,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 17:52:20,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states. Second operand 6 states. [2018-12-18 17:52:20,055 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2018-12-18 17:52:20,055 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2018-12-18 17:52:20,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 17:52:20,057 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-12-18 17:52:20,057 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-18 17:52:20,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 17:52:20,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 17:52:20,057 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2018-12-18 17:52:20,057 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2018-12-18 17:52:20,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 17:52:20,058 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-12-18 17:52:20,059 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-18 17:52:20,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 17:52:20,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 17:52:20,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 17:52:20,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 17:52:20,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-18 17:52:20,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-18 17:52:20,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-18 17:52:20,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 17:52:20,061 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-18 17:52:20,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-18 17:52:20,061 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-18 17:52:20,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-18 17:52:20,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 17:52:20,062 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-18 17:52:20,062 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-18 17:52:20,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 17:52:20,063 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2018-12-18 17:52:20,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 17:52:20,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 17:52:20,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 17:52:20,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 17:52:20,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 17:52:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 17:52:20,388 INFO L273 TraceCheckUtils]: 0: Hoare triple {107#true} i := 0;assume j == i; {109#(= i 0)} is VALID [2018-12-18 17:52:20,390 INFO L273 TraceCheckUtils]: 1: Hoare triple {109#(= i 0)} assume i < n;a := a[i := 0];i := i + 1; {110#(and (<= i 1) (= 0 (select (store a i 0) 0)))} is VALID [2018-12-18 17:52:20,391 INFO L273 TraceCheckUtils]: 2: Hoare triple {110#(and (<= i 1) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {111#(and (<= i 2) (or (<= i 1) (= 0 (select a 1))) (= 0 (select a 0)))} is VALID [2018-12-18 17:52:20,396 INFO L273 TraceCheckUtils]: 3: Hoare triple {111#(and (<= i 2) (or (<= i 1) (= 0 (select a 1))) (= 0 (select a 0)))} assume !(i < n);assume 0 <= r && r < n; {112#(= 0 (select a r))} is VALID [2018-12-18 17:52:20,400 INFO L273 TraceCheckUtils]: 4: Hoare triple {112#(= 0 (select a r))} assume !(a[r] == 0); {108#false} is VALID [2018-12-18 17:52:20,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 17:52:20,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 17:52:20,401 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-18 17:52:20,401 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-18 17:52:20,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-18 17:52:20,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 17:52:20,401 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-18 17:52:20,411 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-18 17:52:20,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-18 17:52:20,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-18 17:52:20,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-18 17:52:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 17:52:20,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-18 17:52:20,462 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 6 treesize of output 5 [2018-12-18 17:52:20,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 17:52:20,471 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. [2018-12-18 17:52:20,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-18 17:52:20,475 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 17:52:20,475 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_a_7, v_i_7]. (and (= a (store v_a_7 v_i_7 0)) (<= v_i_7 0) (<= i (+ v_i_7 1))) [2018-12-18 17:52:20,475 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_i_7]. (and (= 0 (select a v_i_7)) (<= v_i_7 0) (<= i (+ v_i_7 1))) [2018-12-18 17:52:20,542 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-18 17:52:20,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 17:52:20,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-18 17:52:20,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-12-18 17:52:20,579 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 17:52:20,579 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_a_8, v_i_8, v_i_7]. (and (= 0 (select v_a_8 v_i_7)) (= a (store v_a_8 v_i_8 0)) (<= v_i_8 (+ v_i_7 1)) (<= v_i_7 0) (<= i (+ v_i_8 1))) [2018-12-18 17:52:20,579 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_i_7, v_i_8]. (and (= 0 (select a v_i_7)) (<= v_i_8 (+ v_i_7 1)) (= (select a v_i_8) 0) (<= v_i_7 0) (<= i (+ v_i_8 1))) [2018-12-18 17:52:20,907 INFO L273 TraceCheckUtils]: 0: Hoare triple {107#true} i := 0;assume j == i; {116#(<= i 0)} is VALID [2018-12-18 17:52:20,909 INFO L273 TraceCheckUtils]: 1: Hoare triple {116#(<= i 0)} assume i < n;a := a[i := 0];i := i + 1; {120#(exists ((v_i_7 Int)) (and (= 0 (select a v_i_7)) (<= v_i_7 0) (<= i (+ v_i_7 1))))} is VALID [2018-12-18 17:52:20,910 INFO L273 TraceCheckUtils]: 2: Hoare triple {120#(exists ((v_i_7 Int)) (and (= 0 (select a v_i_7)) (<= v_i_7 0) (<= i (+ v_i_7 1))))} assume i < n;a := a[i := 0];i := i + 1; {124#(exists ((v_i_8 Int) (v_i_7 Int)) (and (= 0 (select a v_i_7)) (<= v_i_8 (+ v_i_7 1)) (= (select a v_i_8) 0) (<= v_i_7 0) (<= i (+ v_i_8 1))))} is VALID [2018-12-18 17:52:20,912 INFO L273 TraceCheckUtils]: 3: Hoare triple {124#(exists ((v_i_8 Int) (v_i_7 Int)) (and (= 0 (select a v_i_7)) (<= v_i_8 (+ v_i_7 1)) (= (select a v_i_8) 0) (<= v_i_7 0) (<= i (+ v_i_8 1))))} assume !(i < n);assume 0 <= r && r < n; {128#(and (exists ((v_i_8 Int) (v_i_7 Int)) (and (= 0 (select a v_i_7)) (<= v_i_8 (+ v_i_7 1)) (= (select a v_i_8) 0) (<= v_i_7 0) (<= r v_i_8))) (<= 0 r))} is VALID [2018-12-18 17:52:20,913 INFO L273 TraceCheckUtils]: 4: Hoare triple {128#(and (exists ((v_i_8 Int) (v_i_7 Int)) (and (= 0 (select a v_i_7)) (<= v_i_8 (+ v_i_7 1)) (= (select a v_i_8) 0) (<= v_i_7 0) (<= r v_i_8))) (<= 0 r))} assume !(a[r] == 0); {108#false} is VALID [2018-12-18 17:52:20,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 17:52:20,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-18 17:52:21,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-18 17:52:21,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 17:52:21,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 17:52:21,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2018-12-18 17:52:21,243 INFO L273 TraceCheckUtils]: 4: Hoare triple {112#(= 0 (select a r))} assume !(a[r] == 0); {108#false} is VALID [2018-12-18 17:52:21,245 INFO L273 TraceCheckUtils]: 3: Hoare triple {135#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume !(i < n);assume 0 <= r && r < n; {112#(= 0 (select a r))} is VALID [2018-12-18 17:52:21,246 INFO L273 TraceCheckUtils]: 2: Hoare triple {135#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {135#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2018-12-18 17:52:21,247 INFO L273 TraceCheckUtils]: 1: Hoare triple {116#(<= i 0)} assume i < n;a := a[i := 0];i := i + 1; {135#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2018-12-18 17:52:21,249 INFO L273 TraceCheckUtils]: 0: Hoare triple {107#true} i := 0;assume j == i; {116#(<= i 0)} is VALID [2018-12-18 17:52:21,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-18 17:52:21,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-18 17:52:21,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2018-12-18 17:52:21,270 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-18 17:52:21,270 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2018-12-18 17:52:21,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 17:52:21,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-12-18 17:52:21,298 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 17:52:21,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-18 17:52:21,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-18 17:52:21,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-18 17:52:21,299 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 10 states. [2018-12-18 17:52:21,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 17:52:21,560 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-18 17:52:21,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-18 17:52:21,560 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2018-12-18 17:52:21,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 17:52:21,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-18 17:52:21,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2018-12-18 17:52:21,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-18 17:52:21,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2018-12-18 17:52:21,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 9 transitions. [2018-12-18 17:52:21,608 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 17:52:21,609 INFO L225 Difference]: With dead ends: 9 [2018-12-18 17:52:21,609 INFO L226 Difference]: Without dead ends: 7 [2018-12-18 17:52:21,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-12-18 17:52:21,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-18 17:52:21,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-18 17:52:21,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 17:52:21,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2018-12-18 17:52:21,620 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2018-12-18 17:52:21,620 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2018-12-18 17:52:21,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 17:52:21,621 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-12-18 17:52:21,621 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-18 17:52:21,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 17:52:21,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 17:52:21,622 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2018-12-18 17:52:21,623 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2018-12-18 17:52:21,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 17:52:21,624 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-12-18 17:52:21,624 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-18 17:52:21,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 17:52:21,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 17:52:21,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 17:52:21,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 17:52:21,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-18 17:52:21,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-18 17:52:21,626 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-18 17:52:21,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 17:52:21,626 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-18 17:52:21,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-18 17:52:21,626 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-18 17:52:21,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-18 17:52:21,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 17:52:21,626 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-18 17:52:21,627 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-18 17:52:21,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 17:52:21,627 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2018-12-18 17:52:21,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 17:52:21,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 17:52:21,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-18 17:52:21,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 17:52:21,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 17:52:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 17:52:21,952 INFO L273 TraceCheckUtils]: 0: Hoare triple {186#true} i := 0;assume j == i; {188#(= i 0)} is VALID [2018-12-18 17:52:21,956 INFO L273 TraceCheckUtils]: 1: Hoare triple {188#(= i 0)} assume i < n;a := a[i := 0];i := i + 1; {189#(and (<= i 1) (<= 1 i) (= 0 (select (store a i 0) 0)))} is VALID [2018-12-18 17:52:21,957 INFO L273 TraceCheckUtils]: 2: Hoare triple {189#(and (<= i 1) (<= 1 i) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {190#(and (<= i 2) (or (<= i 1) (= 0 (select (store a i 0) 1))) (= 0 (select (store a i 0) 0)))} is VALID [2018-12-18 17:52:21,959 INFO L273 TraceCheckUtils]: 3: Hoare triple {190#(and (<= i 2) (or (<= i 1) (= 0 (select (store a i 0) 1))) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {191#(and (or (<= i 1) (and (<= i 3) (= 0 (select a 1)) (= 0 (select a (+ i (- 1)))))) (= 0 (select a 0)))} is VALID [2018-12-18 17:52:21,960 INFO L273 TraceCheckUtils]: 4: Hoare triple {191#(and (or (<= i 1) (and (<= i 3) (= 0 (select a 1)) (= 0 (select a (+ i (- 1)))))) (= 0 (select a 0)))} assume !(i < n);assume 0 <= r && r < n; {192#(= 0 (select a r))} is VALID [2018-12-18 17:52:21,960 INFO L273 TraceCheckUtils]: 5: Hoare triple {192#(= 0 (select a r))} assume !(a[r] == 0); {187#false} is VALID [2018-12-18 17:52:21,961 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 17:52:21,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 17:52:21,962 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-18 17:52:21,962 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-18 17:52:21,962 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-18 17:52:21,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 17:52:21,963 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-18 17:52:21,974 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-18 17:52:21,974 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-18 17:52:21,979 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-18 17:52:21,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-18 17:52:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 17:52:21,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-18 17:52:22,021 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 6 treesize of output 5 [2018-12-18 17:52:22,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 17:52:22,033 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. [2018-12-18 17:52:22,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-18 17:52:22,037 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 17:52:22,038 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_a_11, v_i_11]. (and (<= v_i_11 0) (<= i (+ v_i_11 1)) (= a (store v_a_11 v_i_11 0))) [2018-12-18 17:52:22,038 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_i_11]. (and (= 0 (select a v_i_11)) (<= v_i_11 0) (<= i (+ v_i_11 1))) [2018-12-18 17:52:22,099 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-18 17:52:22,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 17:52:22,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-18 17:52:22,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-12-18 17:52:22,231 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 17:52:22,231 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_a_12, v_i_12, v_i_11]. (and (= (select v_a_12 v_i_11) 0) (<= v_i_12 (+ v_i_11 1)) (<= i (+ v_i_12 1)) (<= v_i_11 0) (= a (store v_a_12 v_i_12 0))) [2018-12-18 17:52:22,231 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_i_12, v_i_11]. (and (<= v_i_12 (+ v_i_11 1)) (= 0 (select a v_i_11)) (<= i (+ v_i_12 1)) (<= v_i_11 0) (= 0 (select a v_i_12))) [2018-12-18 17:52:22,310 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-12-18 17:52:22,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 17:52:22,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-18 17:52:22,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-12-18 17:52:22,354 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 17:52:22,355 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_a_13, v_i_13, v_i_12, v_i_11]. (and (<= v_i_12 (+ v_i_11 1)) (= 0 (select v_a_13 v_i_12)) (<= i (+ v_i_13 1)) (<= v_i_13 (+ v_i_12 1)) (= (store v_a_13 v_i_13 0) a) (<= v_i_11 0) (= (select v_a_13 v_i_11) 0)) [2018-12-18 17:52:22,355 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_i_12, v_i_11, v_i_13]. (and (<= v_i_12 (+ v_i_11 1)) (= 0 (select a v_i_11)) (<= i (+ v_i_13 1)) (<= v_i_13 (+ v_i_12 1)) (<= v_i_11 0) (= (select a v_i_13) 0) (= 0 (select a v_i_12))) [2018-12-18 17:52:22,534 INFO L273 TraceCheckUtils]: 0: Hoare triple {186#true} i := 0;assume j == i; {196#(<= i 0)} is VALID [2018-12-18 17:52:22,540 INFO L273 TraceCheckUtils]: 1: Hoare triple {196#(<= i 0)} assume i < n;a := a[i := 0];i := i + 1; {200#(exists ((v_i_11 Int)) (and (= 0 (select a v_i_11)) (<= v_i_11 0) (<= i (+ v_i_11 1))))} is VALID [2018-12-18 17:52:22,541 INFO L273 TraceCheckUtils]: 2: Hoare triple {200#(exists ((v_i_11 Int)) (and (= 0 (select a v_i_11)) (<= v_i_11 0) (<= i (+ v_i_11 1))))} assume i < n;a := a[i := 0];i := i + 1; {204#(exists ((v_i_11 Int) (v_i_12 Int)) (and (= 0 (select a v_i_11)) (<= v_i_12 (+ v_i_11 1)) (<= i (+ v_i_12 1)) (<= v_i_11 0) (= 0 (select a v_i_12))))} is VALID [2018-12-18 17:52:22,543 INFO L273 TraceCheckUtils]: 3: Hoare triple {204#(exists ((v_i_11 Int) (v_i_12 Int)) (and (= 0 (select a v_i_11)) (<= v_i_12 (+ v_i_11 1)) (<= i (+ v_i_12 1)) (<= v_i_11 0) (= 0 (select a v_i_12))))} assume i < n;a := a[i := 0];i := i + 1; {208#(exists ((v_i_11 Int) (v_i_13 Int) (v_i_12 Int)) (and (= 0 (select a v_i_11)) (<= v_i_12 (+ v_i_11 1)) (<= i (+ v_i_13 1)) (<= v_i_13 (+ v_i_12 1)) (<= v_i_11 0) (= (select a v_i_13) 0) (= 0 (select a v_i_12))))} is VALID [2018-12-18 17:52:22,545 INFO L273 TraceCheckUtils]: 4: Hoare triple {208#(exists ((v_i_11 Int) (v_i_13 Int) (v_i_12 Int)) (and (= 0 (select a v_i_11)) (<= v_i_12 (+ v_i_11 1)) (<= i (+ v_i_13 1)) (<= v_i_13 (+ v_i_12 1)) (<= v_i_11 0) (= (select a v_i_13) 0) (= 0 (select a v_i_12))))} assume !(i < n);assume 0 <= r && r < n; {212#(and (<= 0 r) (exists ((v_i_11 Int) (v_i_13 Int) (v_i_12 Int)) (and (= 0 (select a v_i_11)) (<= v_i_12 (+ v_i_11 1)) (<= v_i_13 (+ v_i_12 1)) (<= v_i_11 0) (= (select a v_i_13) 0) (= 0 (select a v_i_12)) (<= r v_i_13))))} is VALID [2018-12-18 17:52:22,547 INFO L273 TraceCheckUtils]: 5: Hoare triple {212#(and (<= 0 r) (exists ((v_i_11 Int) (v_i_13 Int) (v_i_12 Int)) (and (= 0 (select a v_i_11)) (<= v_i_12 (+ v_i_11 1)) (<= v_i_13 (+ v_i_12 1)) (<= v_i_11 0) (= (select a v_i_13) 0) (= 0 (select a v_i_12)) (<= r v_i_13))))} assume !(a[r] == 0); {187#false} is VALID [2018-12-18 17:52:22,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 17:52:22,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-18 17:52:22,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-18 17:52:22,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 17:52:22,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 17:52:22,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2018-12-18 17:52:22,807 INFO L273 TraceCheckUtils]: 5: Hoare triple {192#(= 0 (select a r))} assume !(a[r] == 0); {187#false} is VALID [2018-12-18 17:52:22,808 INFO L273 TraceCheckUtils]: 4: Hoare triple {219#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume !(i < n);assume 0 <= r && r < n; {192#(= 0 (select a r))} is VALID [2018-12-18 17:52:22,810 INFO L273 TraceCheckUtils]: 3: Hoare triple {219#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {219#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2018-12-18 17:52:22,812 INFO L273 TraceCheckUtils]: 2: Hoare triple {219#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {219#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2018-12-18 17:52:22,816 INFO L273 TraceCheckUtils]: 1: Hoare triple {196#(<= i 0)} assume i < n;a := a[i := 0];i := i + 1; {219#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2018-12-18 17:52:22,817 INFO L273 TraceCheckUtils]: 0: Hoare triple {186#true} i := 0;assume j == i; {196#(<= i 0)} is VALID [2018-12-18 17:52:22,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-18 17:52:22,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-18 17:52:22,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 3] total 11 [2018-12-18 17:52:22,839 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-18 17:52:22,840 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2018-12-18 17:52:22,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 17:52:22,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-12-18 17:52:22,864 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 17:52:22,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-18 17:52:22,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-18 17:52:22,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-18 17:52:22,865 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 12 states. [2018-12-18 17:52:23,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 17:52:23,152 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-18 17:52:23,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-18 17:52:23,153 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2018-12-18 17:52:23,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 17:52:23,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-18 17:52:23,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2018-12-18 17:52:23,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-18 17:52:23,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2018-12-18 17:52:23,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 10 transitions. [2018-12-18 17:52:23,173 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 17:52:23,174 INFO L225 Difference]: With dead ends: 10 [2018-12-18 17:52:23,174 INFO L226 Difference]: Without dead ends: 8 [2018-12-18 17:52:23,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-12-18 17:52:23,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-18 17:52:23,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-18 17:52:23,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 17:52:23,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2018-12-18 17:52:23,193 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2018-12-18 17:52:23,193 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2018-12-18 17:52:23,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 17:52:23,194 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-18 17:52:23,194 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-18 17:52:23,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 17:52:23,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 17:52:23,195 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2018-12-18 17:52:23,195 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2018-12-18 17:52:23,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 17:52:23,197 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-18 17:52:23,197 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-18 17:52:23,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 17:52:23,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 17:52:23,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 17:52:23,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 17:52:23,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-18 17:52:23,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-18 17:52:23,199 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-18 17:52:23,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 17:52:23,199 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-18 17:52:23,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-18 17:52:23,200 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-18 17:52:23,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-18 17:52:23,200 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 17:52:23,200 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-18 17:52:23,201 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-18 17:52:23,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 17:52:23,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2018-12-18 17:52:23,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 17:52:23,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 17:52:23,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-18 17:52:23,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 17:52:23,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 17:52:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 17:52:23,844 INFO L273 TraceCheckUtils]: 0: Hoare triple {279#true} i := 0;assume j == i; {281#(= 0 i)} is VALID [2018-12-18 17:52:23,845 INFO L273 TraceCheckUtils]: 1: Hoare triple {281#(= 0 i)} assume i < n;a := a[i := 0];i := i + 1; {282#(and (<= i 1) (<= 1 i) (= 0 (select (store a i 0) 0)))} is VALID [2018-12-18 17:52:23,847 INFO L273 TraceCheckUtils]: 2: Hoare triple {282#(and (<= i 1) (<= 1 i) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {283#(and (<= i 2) (or (<= i 1) (= 0 (select (store a i 0) 1))) (= 0 (select (store a i 0) 0)))} is VALID [2018-12-18 17:52:23,849 INFO L273 TraceCheckUtils]: 3: Hoare triple {283#(and (<= i 2) (or (<= i 1) (= 0 (select (store a i 0) 1))) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {284#(and (or (<= i 1) (and (= 0 (select (store a i 0) 1)) (<= i 3) (= 0 (select (store a i 0) (+ i (- 1)))))) (= 0 (select (store a i 0) 0)))} is VALID [2018-12-18 17:52:23,859 INFO L273 TraceCheckUtils]: 4: Hoare triple {284#(and (or (<= i 1) (and (= 0 (select (store a i 0) 1)) (<= i 3) (= 0 (select (store a i 0) (+ i (- 1)))))) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {285#(and (= 0 (select a 0)) (or (<= i 1) (and (= 0 (select a (+ (+ 1 1) (- 1)))) (<= i 3) (= 0 (select a (+ i (- 1))))) (and (= 0 (select a 1)) (= 0 (select a (+ i (- 1)))) (<= i 4) (= 0 (select a (+ (+ 2 1) (- 1)))))))} is VALID [2018-12-18 17:52:23,861 INFO L273 TraceCheckUtils]: 5: Hoare triple {285#(and (= 0 (select a 0)) (or (<= i 1) (and (= 0 (select a (+ (+ 1 1) (- 1)))) (<= i 3) (= 0 (select a (+ i (- 1))))) (and (= 0 (select a 1)) (= 0 (select a (+ i (- 1)))) (<= i 4) (= 0 (select a (+ (+ 2 1) (- 1)))))))} assume !(i < n);assume 0 <= r && r < n; {286#(= 0 (select a r))} is VALID [2018-12-18 17:52:23,861 INFO L273 TraceCheckUtils]: 6: Hoare triple {286#(= 0 (select a r))} assume !(a[r] == 0); {280#false} is VALID [2018-12-18 17:52:23,862 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 17:52:23,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 17:52:23,863 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-18 17:52:23,863 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-18 17:52:23,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-18 17:52:23,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 17:52:23,863 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-18 17:52:23,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 17:52:23,876 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-18 17:52:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 17:52:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 17:52:23,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-18 17:52:23,933 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 6 treesize of output 5 [2018-12-18 17:52:23,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 17:52:23,973 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. [2018-12-18 17:52:23,974 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-18 17:52:23,976 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 17:52:23,977 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_a_17, v_i_17]. (and (= a (store v_a_17 v_i_17 0)) (<= v_i_17 0) (<= i (+ v_i_17 1))) [2018-12-18 17:52:23,977 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_i_17]. (and (<= v_i_17 0) (= (select a v_i_17) 0) (<= i (+ v_i_17 1))) [2018-12-18 17:52:24,062 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-18 17:52:24,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 17:52:24,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-18 17:52:24,084 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-12-18 17:52:24,090 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 17:52:24,091 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_a_18, v_i_18, v_i_17]. (and (<= v_i_17 0) (= 0 (select v_a_18 v_i_17)) (<= i (+ v_i_18 1)) (<= v_i_18 (+ v_i_17 1)) (= (store v_a_18 v_i_18 0) a)) [2018-12-18 17:52:24,091 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_i_18, v_i_17]. (and (<= v_i_17 0) (<= i (+ v_i_18 1)) (= (select a v_i_17) 0) (= 0 (select a v_i_18)) (<= v_i_18 (+ v_i_17 1))) [2018-12-18 17:52:24,168 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-12-18 17:52:24,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 17:52:24,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-18 17:52:24,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-12-18 17:52:24,208 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 17:52:24,208 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_a_19, v_i_19, v_i_17, v_i_18]. (and (<= v_i_17 0) (<= i (+ v_i_19 1)) (= 0 (select v_a_19 v_i_17)) (= 0 (select v_a_19 v_i_18)) (<= v_i_19 (+ v_i_18 1)) (<= v_i_18 (+ v_i_17 1)) (= (store v_a_19 v_i_19 0) a)) [2018-12-18 17:52:24,208 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_i_19, v_i_17, v_i_18]. (and (<= v_i_17 0) (<= i (+ v_i_19 1)) (= (select a v_i_17) 0) (= 0 (select a v_i_18)) (<= v_i_19 (+ v_i_18 1)) (<= v_i_18 (+ v_i_17 1)) (= (select a v_i_19) 0)) [2018-12-18 17:52:24,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-18 17:52:24,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 17:52:24,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-18 17:52:24,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-12-18 17:52:24,395 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 17:52:24,396 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_a_20, v_i_20, v_i_19, v_i_17, v_i_18]. (and (<= v_i_20 (+ v_i_19 1)) (<= v_i_17 0) (= 0 (select v_a_20 v_i_18)) (= 0 (select v_a_20 v_i_19)) (<= i (+ v_i_20 1)) (<= v_i_19 (+ v_i_18 1)) (= 0 (select v_a_20 v_i_17)) (<= v_i_18 (+ v_i_17 1)) (= (store v_a_20 v_i_20 0) a)) [2018-12-18 17:52:24,396 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_i_20, v_i_19, v_i_17, v_i_18]. (and (<= v_i_20 (+ v_i_19 1)) (<= v_i_17 0) (= (select a v_i_17) 0) (= 0 (select a v_i_18)) (<= i (+ v_i_20 1)) (<= v_i_19 (+ v_i_18 1)) (<= v_i_18 (+ v_i_17 1)) (= (select a v_i_19) 0) (= 0 (select a v_i_20))) [2018-12-18 17:52:24,744 INFO L273 TraceCheckUtils]: 0: Hoare triple {279#true} i := 0;assume j == i; {290#(<= i 0)} is VALID [2018-12-18 17:52:24,747 INFO L273 TraceCheckUtils]: 1: Hoare triple {290#(<= i 0)} assume i < n;a := a[i := 0];i := i + 1; {294#(exists ((v_i_17 Int)) (and (<= v_i_17 0) (= (select a v_i_17) 0) (<= i (+ v_i_17 1))))} is VALID [2018-12-18 17:52:24,750 INFO L273 TraceCheckUtils]: 2: Hoare triple {294#(exists ((v_i_17 Int)) (and (<= v_i_17 0) (= (select a v_i_17) 0) (<= i (+ v_i_17 1))))} assume i < n;a := a[i := 0];i := i + 1; {298#(exists ((v_i_17 Int) (v_i_18 Int)) (and (<= v_i_17 0) (<= i (+ v_i_18 1)) (= (select a v_i_17) 0) (= 0 (select a v_i_18)) (<= v_i_18 (+ v_i_17 1))))} is VALID [2018-12-18 17:52:24,753 INFO L273 TraceCheckUtils]: 3: Hoare triple {298#(exists ((v_i_17 Int) (v_i_18 Int)) (and (<= v_i_17 0) (<= i (+ v_i_18 1)) (= (select a v_i_17) 0) (= 0 (select a v_i_18)) (<= v_i_18 (+ v_i_17 1))))} assume i < n;a := a[i := 0];i := i + 1; {302#(exists ((v_i_17 Int) (v_i_19 Int) (v_i_18 Int)) (and (<= v_i_17 0) (<= i (+ v_i_19 1)) (= (select a v_i_17) 0) (= 0 (select a v_i_18)) (<= v_i_19 (+ v_i_18 1)) (<= v_i_18 (+ v_i_17 1)) (= (select a v_i_19) 0)))} is VALID [2018-12-18 17:52:24,763 INFO L273 TraceCheckUtils]: 4: Hoare triple {302#(exists ((v_i_17 Int) (v_i_19 Int) (v_i_18 Int)) (and (<= v_i_17 0) (<= i (+ v_i_19 1)) (= (select a v_i_17) 0) (= 0 (select a v_i_18)) (<= v_i_19 (+ v_i_18 1)) (<= v_i_18 (+ v_i_17 1)) (= (select a v_i_19) 0)))} assume i < n;a := a[i := 0];i := i + 1; {306#(exists ((v_i_20 Int) (v_i_17 Int) (v_i_19 Int) (v_i_18 Int)) (and (<= v_i_20 (+ v_i_19 1)) (<= v_i_17 0) (= (select a v_i_17) 0) (= 0 (select a v_i_18)) (<= i (+ v_i_20 1)) (<= v_i_19 (+ v_i_18 1)) (<= v_i_18 (+ v_i_17 1)) (= (select a v_i_19) 0) (= 0 (select a v_i_20))))} is VALID [2018-12-18 17:52:24,767 INFO L273 TraceCheckUtils]: 5: Hoare triple {306#(exists ((v_i_20 Int) (v_i_17 Int) (v_i_19 Int) (v_i_18 Int)) (and (<= v_i_20 (+ v_i_19 1)) (<= v_i_17 0) (= (select a v_i_17) 0) (= 0 (select a v_i_18)) (<= i (+ v_i_20 1)) (<= v_i_19 (+ v_i_18 1)) (<= v_i_18 (+ v_i_17 1)) (= (select a v_i_19) 0) (= 0 (select a v_i_20))))} assume !(i < n);assume 0 <= r && r < n; {310#(and (<= 0 r) (exists ((v_i_20 Int) (v_i_17 Int) (v_i_19 Int) (v_i_18 Int)) (and (<= v_i_20 (+ v_i_19 1)) (<= v_i_17 0) (= (select a v_i_17) 0) (<= r v_i_20) (= 0 (select a v_i_18)) (<= v_i_19 (+ v_i_18 1)) (<= v_i_18 (+ v_i_17 1)) (= (select a v_i_19) 0) (= 0 (select a v_i_20)))))} is VALID [2018-12-18 17:52:24,769 INFO L273 TraceCheckUtils]: 6: Hoare triple {310#(and (<= 0 r) (exists ((v_i_20 Int) (v_i_17 Int) (v_i_19 Int) (v_i_18 Int)) (and (<= v_i_20 (+ v_i_19 1)) (<= v_i_17 0) (= (select a v_i_17) 0) (<= r v_i_20) (= 0 (select a v_i_18)) (<= v_i_19 (+ v_i_18 1)) (<= v_i_18 (+ v_i_17 1)) (= (select a v_i_19) 0) (= 0 (select a v_i_20)))))} assume !(a[r] == 0); {280#false} is VALID [2018-12-18 17:52:24,770 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 17:52:24,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-18 17:52:25,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-18 17:52:25,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 17:52:25,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 17:52:25,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2018-12-18 17:52:25,120 INFO L273 TraceCheckUtils]: 6: Hoare triple {286#(= 0 (select a r))} assume !(a[r] == 0); {280#false} is VALID [2018-12-18 17:52:25,128 INFO L273 TraceCheckUtils]: 5: Hoare triple {317#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume !(i < n);assume 0 <= r && r < n; {286#(= 0 (select a r))} is VALID [2018-12-18 17:52:25,129 INFO L273 TraceCheckUtils]: 4: Hoare triple {317#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {317#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2018-12-18 17:52:25,130 INFO L273 TraceCheckUtils]: 3: Hoare triple {317#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {317#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2018-12-18 17:52:25,131 INFO L273 TraceCheckUtils]: 2: Hoare triple {317#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {317#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2018-12-18 17:52:25,133 INFO L273 TraceCheckUtils]: 1: Hoare triple {290#(<= i 0)} assume i < n;a := a[i := 0];i := i + 1; {317#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2018-12-18 17:52:25,134 INFO L273 TraceCheckUtils]: 0: Hoare triple {279#true} i := 0;assume j == i; {290#(<= i 0)} is VALID [2018-12-18 17:52:25,135 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-18 17:52:25,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-18 17:52:25,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 3] total 13 [2018-12-18 17:52:25,158 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-18 17:52:25,158 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2018-12-18 17:52:25,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 17:52:25,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-12-18 17:52:25,190 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 17:52:25,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-18 17:52:25,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-18 17:52:25,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-12-18 17:52:25,191 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 14 states. [2018-12-18 17:52:25,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 17:52:25,679 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-18 17:52:25,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-18 17:52:25,679 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2018-12-18 17:52:25,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 17:52:25,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-18 17:52:25,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2018-12-18 17:52:25,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-18 17:52:25,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2018-12-18 17:52:25,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 11 transitions. [2018-12-18 17:52:25,706 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 17:52:25,706 INFO L225 Difference]: With dead ends: 11 [2018-12-18 17:52:25,707 INFO L226 Difference]: Without dead ends: 9 [2018-12-18 17:52:25,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-12-18 17:52:25,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-18 17:52:25,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-18 17:52:25,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 17:52:25,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 9 states. [2018-12-18 17:52:25,733 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2018-12-18 17:52:25,733 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2018-12-18 17:52:25,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 17:52:25,735 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-18 17:52:25,735 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-18 17:52:25,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 17:52:25,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 17:52:25,736 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2018-12-18 17:52:25,736 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2018-12-18 17:52:25,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 17:52:25,737 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-18 17:52:25,737 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-18 17:52:25,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 17:52:25,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 17:52:25,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 17:52:25,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 17:52:25,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-18 17:52:25,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-18 17:52:25,739 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-18 17:52:25,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 17:52:25,739 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-18 17:52:25,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-18 17:52:25,740 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-18 17:52:25,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-18 17:52:25,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 17:52:25,740 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-18 17:52:25,740 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-18 17:52:25,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 17:52:25,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2018-12-18 17:52:25,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 17:52:25,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 17:52:25,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 17:52:25,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 17:52:25,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 17:52:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 17:52:26,442 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2018-12-18 17:52:26,645 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 23 [2018-12-18 17:52:27,074 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 30 [2018-12-18 17:52:27,128 INFO L273 TraceCheckUtils]: 0: Hoare triple {388#true} i := 0;assume j == i; {390#(= i 0)} is VALID [2018-12-18 17:52:27,131 INFO L273 TraceCheckUtils]: 1: Hoare triple {390#(= i 0)} assume i < n;a := a[i := 0];i := i + 1; {391#(and (<= i 1) (<= 1 i) (= 0 (select (store a i 0) 0)))} is VALID [2018-12-18 17:52:27,132 INFO L273 TraceCheckUtils]: 2: Hoare triple {391#(and (<= i 1) (<= 1 i) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {392#(and (<= 2 i) (= 0 (select (store a i 0) 1)) (<= i 2) (= 0 (select (store a i 0) 0)))} is VALID [2018-12-18 17:52:27,134 INFO L273 TraceCheckUtils]: 3: Hoare triple {392#(and (<= 2 i) (= 0 (select (store a i 0) 1)) (<= i 2) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {393#(and (<= 3 i) (= 0 (select (store a i 0) 1)) (<= i 3) (= 0 (select (store a i 0) (+ i (- 1)))) (= 0 (select (store a i 0) 0)))} is VALID [2018-12-18 17:52:27,136 INFO L273 TraceCheckUtils]: 4: Hoare triple {393#(and (<= 3 i) (= 0 (select (store a i 0) 1)) (<= i 3) (= 0 (select (store a i 0) (+ i (- 1)))) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {394#(and (or (<= i 1) (and (= 0 (select (store a i 0) (+ (+ i (- 1)) (- 1)))) (= 0 (select (store a i 0) 1)) (= 0 (select (store a i 0) (+ i (- 1)))) (<= i 4))) (= 0 (select (store a i 0) 0)))} is VALID [2018-12-18 17:52:27,138 INFO L273 TraceCheckUtils]: 5: Hoare triple {394#(and (or (<= i 1) (and (= 0 (select (store a i 0) (+ (+ i (- 1)) (- 1)))) (= 0 (select (store a i 0) 1)) (= 0 (select (store a i 0) (+ i (- 1)))) (<= i 4))) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {395#(and (or (<= i 1) (and (= 0 (select a (+ (+ i (- 1)) (- 1)))) (or (and (= 0 (select a 1)) (<= i 4)) (and (= 0 (select a (+ (+ (+ i (- 1)) (- 1)) (- 1)))) (= 0 (select a 1)) (<= i 5))) (= 0 (select a (+ i (- 1)))))) (= 0 (select a 0)))} is VALID [2018-12-18 17:52:27,140 INFO L273 TraceCheckUtils]: 6: Hoare triple {395#(and (or (<= i 1) (and (= 0 (select a (+ (+ i (- 1)) (- 1)))) (or (and (= 0 (select a 1)) (<= i 4)) (and (= 0 (select a (+ (+ (+ i (- 1)) (- 1)) (- 1)))) (= 0 (select a 1)) (<= i 5))) (= 0 (select a (+ i (- 1)))))) (= 0 (select a 0)))} assume !(i < n);assume 0 <= r && r < n; {396#(= 0 (select a r))} is VALID [2018-12-18 17:52:27,141 INFO L273 TraceCheckUtils]: 7: Hoare triple {396#(= 0 (select a r))} assume !(a[r] == 0); {389#false} is VALID [2018-12-18 17:52:27,142 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 17:52:27,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 17:52:27,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-18 17:52:27,143 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-18 17:52:27,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-18 17:52:27,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 17:52:27,144 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-18 17:52:27,160 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-18 17:52:27,161 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-18 17:52:27,219 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-18 17:52:27,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-18 17:52:27,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 17:52:27,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-18 17:52:27,348 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 6 treesize of output 5 [2018-12-18 17:52:27,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 17:52:27,377 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. [2018-12-18 17:52:27,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-18 17:52:27,392 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 17:52:27,392 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_a_25, v_i_25]. (and (<= i (+ v_i_25 1)) (= (store v_a_25 v_i_25 0) a) (<= v_i_25 0)) [2018-12-18 17:52:27,393 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_i_25]. (and (<= i (+ v_i_25 1)) (= (select a v_i_25) 0) (<= v_i_25 0)) [2018-12-18 17:52:27,515 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-18 17:52:27,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 17:52:27,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-18 17:52:27,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-12-18 17:52:27,534 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 17:52:27,534 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_a_26, v_i_26, v_i_25]. (and (= (select v_a_26 v_i_25) 0) (= (store v_a_26 v_i_26 0) a) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (<= i (+ v_i_26 1))) [2018-12-18 17:52:27,535 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_i_25, v_i_26]. (and (= (select a v_i_25) 0) (= (select a v_i_26) 0) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (<= i (+ v_i_26 1))) [2018-12-18 17:52:27,676 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-12-18 17:52:27,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 17:52:27,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-18 17:52:27,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-12-18 17:52:27,704 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 17:52:27,704 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_a_27, v_i_27, v_i_26, v_i_25]. (and (<= v_i_27 (+ v_i_26 1)) (= (select v_a_27 v_i_26) 0) (= 0 (select v_a_27 v_i_25)) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (<= i (+ v_i_27 1)) (= a (store v_a_27 v_i_27 0))) [2018-12-18 17:52:27,704 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_i_27, v_i_26, v_i_25]. (and (<= v_i_27 (+ v_i_26 1)) (= (select a v_i_25) 0) (= (select a v_i_26) 0) (= 0 (select a v_i_27)) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (<= i (+ v_i_27 1))) [2018-12-18 17:52:27,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-18 17:52:27,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 17:52:27,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-18 17:52:27,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-12-18 17:52:28,050 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 17:52:28,050 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_a_28, v_i_28, v_i_27, v_i_26, v_i_25]. (and (<= v_i_27 (+ v_i_26 1)) (<= v_i_28 (+ v_i_27 1)) (= 0 (select v_a_28 v_i_26)) (<= i (+ v_i_28 1)) (= (select v_a_28 v_i_27) 0) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (= (store v_a_28 v_i_28 0) a) (= (select v_a_28 v_i_25) 0)) [2018-12-18 17:52:28,051 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_i_27, v_i_26, v_i_25, v_i_28]. (and (<= v_i_27 (+ v_i_26 1)) (= (select a v_i_25) 0) (= (select a v_i_26) 0) (<= v_i_28 (+ v_i_27 1)) (= 0 (select a v_i_27)) (<= i (+ v_i_28 1)) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (= (select a v_i_28) 0)) [2018-12-18 17:52:28,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-12-18 17:52:28,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 17:52:28,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-18 17:52:28,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-12-18 17:52:30,221 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 17:52:30,221 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_a_29, v_i_29, v_i_28, v_i_27, v_i_26, v_i_25]. (and (<= v_i_29 (+ v_i_28 1)) (<= v_i_27 (+ v_i_26 1)) (<= i (+ v_i_29 1)) (= (store v_a_29 v_i_29 0) a) (= 0 (select v_a_29 v_i_28)) (<= v_i_28 (+ v_i_27 1)) (= 0 (select v_a_29 v_i_27)) (= 0 (select v_a_29 v_i_26)) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (= 0 (select v_a_29 v_i_25))) [2018-12-18 17:52:30,221 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_i_29, v_i_28, v_i_27, v_i_26, v_i_25]. (and (<= v_i_29 (+ v_i_28 1)) (<= v_i_27 (+ v_i_26 1)) (<= i (+ v_i_29 1)) (= (select a v_i_25) 0) (= (select a v_i_26) 0) (<= v_i_28 (+ v_i_27 1)) (= 0 (select a v_i_27)) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (= (select a v_i_29) 0) (= (select a v_i_28) 0)) [2018-12-18 17:52:30,687 INFO L273 TraceCheckUtils]: 0: Hoare triple {388#true} i := 0;assume j == i; {400#(<= i 0)} is VALID [2018-12-18 17:52:30,700 INFO L273 TraceCheckUtils]: 1: Hoare triple {400#(<= i 0)} assume i < n;a := a[i := 0];i := i + 1; {404#(exists ((v_i_25 Int)) (and (<= i (+ v_i_25 1)) (= (select a v_i_25) 0) (<= v_i_25 0)))} is VALID [2018-12-18 17:52:30,702 INFO L273 TraceCheckUtils]: 2: Hoare triple {404#(exists ((v_i_25 Int)) (and (<= i (+ v_i_25 1)) (= (select a v_i_25) 0) (<= v_i_25 0)))} assume i < n;a := a[i := 0];i := i + 1; {408#(exists ((v_i_26 Int) (v_i_25 Int)) (and (= (select a v_i_25) 0) (= (select a v_i_26) 0) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (<= i (+ v_i_26 1))))} is VALID [2018-12-18 17:52:30,704 INFO L273 TraceCheckUtils]: 3: Hoare triple {408#(exists ((v_i_26 Int) (v_i_25 Int)) (and (= (select a v_i_25) 0) (= (select a v_i_26) 0) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (<= i (+ v_i_26 1))))} assume i < n;a := a[i := 0];i := i + 1; {412#(exists ((v_i_26 Int) (v_i_25 Int) (v_i_27 Int)) (and (<= v_i_27 (+ v_i_26 1)) (= (select a v_i_25) 0) (= (select a v_i_26) 0) (= 0 (select a v_i_27)) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (<= i (+ v_i_27 1))))} is VALID [2018-12-18 17:52:30,719 INFO L273 TraceCheckUtils]: 4: Hoare triple {412#(exists ((v_i_26 Int) (v_i_25 Int) (v_i_27 Int)) (and (<= v_i_27 (+ v_i_26 1)) (= (select a v_i_25) 0) (= (select a v_i_26) 0) (= 0 (select a v_i_27)) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (<= i (+ v_i_27 1))))} assume i < n;a := a[i := 0];i := i + 1; {416#(exists ((v_i_26 Int) (v_i_25 Int) (v_i_28 Int) (v_i_27 Int)) (and (<= v_i_27 (+ v_i_26 1)) (= (select a v_i_25) 0) (= (select a v_i_26) 0) (<= v_i_28 (+ v_i_27 1)) (= 0 (select a v_i_27)) (<= i (+ v_i_28 1)) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (= (select a v_i_28) 0)))} is VALID [2018-12-18 17:52:31,045 INFO L273 TraceCheckUtils]: 5: Hoare triple {416#(exists ((v_i_26 Int) (v_i_25 Int) (v_i_28 Int) (v_i_27 Int)) (and (<= v_i_27 (+ v_i_26 1)) (= (select a v_i_25) 0) (= (select a v_i_26) 0) (<= v_i_28 (+ v_i_27 1)) (= 0 (select a v_i_27)) (<= i (+ v_i_28 1)) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (= (select a v_i_28) 0)))} assume i < n;a := a[i := 0];i := i + 1; {420#(exists ((v_i_26 Int) (v_i_25 Int) (v_i_28 Int) (v_i_27 Int) (v_i_29 Int)) (and (<= v_i_29 (+ v_i_28 1)) (<= v_i_27 (+ v_i_26 1)) (= (select a v_i_25) 0) (<= i (+ v_i_29 1)) (= (select a v_i_26) 0) (<= v_i_28 (+ v_i_27 1)) (= 0 (select a v_i_27)) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (= (select a v_i_29) 0) (= (select a v_i_28) 0)))} is VALID [2018-12-18 17:52:31,086 INFO L273 TraceCheckUtils]: 6: Hoare triple {420#(exists ((v_i_26 Int) (v_i_25 Int) (v_i_28 Int) (v_i_27 Int) (v_i_29 Int)) (and (<= v_i_29 (+ v_i_28 1)) (<= v_i_27 (+ v_i_26 1)) (= (select a v_i_25) 0) (<= i (+ v_i_29 1)) (= (select a v_i_26) 0) (<= v_i_28 (+ v_i_27 1)) (= 0 (select a v_i_27)) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (= (select a v_i_29) 0) (= (select a v_i_28) 0)))} assume !(i < n);assume 0 <= r && r < n; {424#(and (<= 0 r) (exists ((v_i_26 Int) (v_i_25 Int) (v_i_28 Int) (v_i_27 Int) (v_i_29 Int)) (and (<= v_i_29 (+ v_i_28 1)) (<= v_i_27 (+ v_i_26 1)) (= (select a v_i_25) 0) (<= r v_i_29) (= (select a v_i_26) 0) (<= v_i_28 (+ v_i_27 1)) (= 0 (select a v_i_27)) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (= (select a v_i_29) 0) (= (select a v_i_28) 0))))} is VALID [2018-12-18 17:52:31,089 INFO L273 TraceCheckUtils]: 7: Hoare triple {424#(and (<= 0 r) (exists ((v_i_26 Int) (v_i_25 Int) (v_i_28 Int) (v_i_27 Int) (v_i_29 Int)) (and (<= v_i_29 (+ v_i_28 1)) (<= v_i_27 (+ v_i_26 1)) (= (select a v_i_25) 0) (<= r v_i_29) (= (select a v_i_26) 0) (<= v_i_28 (+ v_i_27 1)) (= 0 (select a v_i_27)) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (= (select a v_i_29) 0) (= (select a v_i_28) 0))))} assume !(a[r] == 0); {389#false} is VALID [2018-12-18 17:52:31,090 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 17:52:31,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-18 17:52:33,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-18 17:52:33,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 17:52:33,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 17:52:33,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2018-12-18 17:52:33,476 INFO L273 TraceCheckUtils]: 7: Hoare triple {396#(= 0 (select a r))} assume !(a[r] == 0); {389#false} is VALID [2018-12-18 17:52:33,477 INFO L273 TraceCheckUtils]: 6: Hoare triple {431#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume !(i < n);assume 0 <= r && r < n; {396#(= 0 (select a r))} is VALID [2018-12-18 17:52:33,478 INFO L273 TraceCheckUtils]: 5: Hoare triple {431#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {431#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2018-12-18 17:52:33,479 INFO L273 TraceCheckUtils]: 4: Hoare triple {431#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {431#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2018-12-18 17:52:33,480 INFO L273 TraceCheckUtils]: 3: Hoare triple {431#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {431#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2018-12-18 17:52:33,482 INFO L273 TraceCheckUtils]: 2: Hoare triple {431#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {431#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2018-12-18 17:52:33,483 INFO L273 TraceCheckUtils]: 1: Hoare triple {400#(<= i 0)} assume i < n;a := a[i := 0];i := i + 1; {431#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2018-12-18 17:52:33,484 INFO L273 TraceCheckUtils]: 0: Hoare triple {388#true} i := 0;assume j == i; {400#(<= i 0)} is VALID [2018-12-18 17:52:33,484 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-18 17:52:33,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-18 17:52:33,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 3] total 15 [2018-12-18 17:52:33,506 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-18 17:52:33,506 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 8 [2018-12-18 17:52:33,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 17:52:33,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-12-18 17:52:33,880 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 17:52:33,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-18 17:52:33,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-18 17:52:33,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-12-18 17:52:33,881 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 16 states. [2018-12-18 17:52:34,947 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-12-18 17:52:34,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 17:52:34,984 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-18 17:52:34,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-18 17:52:34,985 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 8 [2018-12-18 17:52:34,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 17:52:34,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-18 17:52:34,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2018-12-18 17:52:34,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-18 17:52:34,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2018-12-18 17:52:34,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 12 transitions. [2018-12-18 17:52:35,051 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 17:52:35,052 INFO L225 Difference]: With dead ends: 12 [2018-12-18 17:52:35,052 INFO L226 Difference]: Without dead ends: 10 [2018-12-18 17:52:35,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-12-18 17:52:35,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-18 17:52:35,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-18 17:52:35,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 17:52:35,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 10 states. [2018-12-18 17:52:35,087 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2018-12-18 17:52:35,087 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2018-12-18 17:52:35,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 17:52:35,089 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-18 17:52:35,089 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-18 17:52:35,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 17:52:35,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 17:52:35,090 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2018-12-18 17:52:35,090 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2018-12-18 17:52:35,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 17:52:35,091 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-18 17:52:35,091 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-18 17:52:35,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 17:52:35,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 17:52:35,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 17:52:35,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 17:52:35,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-18 17:52:35,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-18 17:52:35,093 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-18 17:52:35,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 17:52:35,093 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-18 17:52:35,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-18 17:52:35,093 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-18 17:52:35,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-18 17:52:35,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 17:52:35,094 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-18 17:52:35,094 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-18 17:52:35,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 17:52:35,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2018-12-18 17:52:35,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 17:52:35,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 17:52:35,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-18 17:52:35,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 17:52:35,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 17:52:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 17:52:35,707 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 29 [2018-12-18 17:52:36,024 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 37 [2018-12-18 17:52:36,082 INFO L273 TraceCheckUtils]: 0: Hoare triple {509#true} i := 0;assume j == i; {511#(= i 0)} is VALID [2018-12-18 17:52:36,083 INFO L273 TraceCheckUtils]: 1: Hoare triple {511#(= i 0)} assume i < n;a := a[i := 0];i := i + 1; {512#(and (<= i 1) (<= 1 i) (= 0 (select (store a i 0) 0)))} is VALID [2018-12-18 17:52:36,084 INFO L273 TraceCheckUtils]: 2: Hoare triple {512#(and (<= i 1) (<= 1 i) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {513#(and (<= 2 i) (= 0 (select (store a i 0) 1)) (<= i 2) (= 0 (select (store a i 0) 0)))} is VALID [2018-12-18 17:52:36,085 INFO L273 TraceCheckUtils]: 3: Hoare triple {513#(and (<= 2 i) (= 0 (select (store a i 0) 1)) (<= i 2) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {514#(and (<= 3 i) (= 0 (select (store a i 0) 1)) (<= i 3) (= 0 (select (store a i 0) (+ i (- 1)))) (= 0 (select (store a i 0) 0)))} is VALID [2018-12-18 17:52:36,087 INFO L273 TraceCheckUtils]: 4: Hoare triple {514#(and (<= 3 i) (= 0 (select (store a i 0) 1)) (<= i 3) (= 0 (select (store a i 0) (+ i (- 1)))) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {515#(and (= 0 (select (store a i 0) (+ (+ i (- 1)) (- 1)))) (= 0 (select (store a i 0) 1)) (= 0 (select (store a i 0) (+ i (- 1)))) (<= 4 i) (<= i 4) (= 0 (select (store a i 0) 0)))} is VALID [2018-12-18 17:52:36,090 INFO L273 TraceCheckUtils]: 5: Hoare triple {515#(and (= 0 (select (store a i 0) (+ (+ i (- 1)) (- 1)))) (= 0 (select (store a i 0) 1)) (= 0 (select (store a i 0) (+ i (- 1)))) (<= 4 i) (<= i 4) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {516#(and (or (and (= 0 (select (store a i 0) (+ 3 (- 1)))) (= 0 (select (store a i 0) 1)) (or (and (= 0 (select (store a i 0) (+ 3 1))) (= 0 (select (store a i 0) (+ (+ 3 1) (- 1)))) (<= i 5)) (<= i 3))) (<= i 1)) (= 0 (select (store a i 0) 0)))} is VALID [2018-12-18 17:52:36,092 INFO L273 TraceCheckUtils]: 6: Hoare triple {516#(and (or (and (= 0 (select (store a i 0) (+ 3 (- 1)))) (= 0 (select (store a i 0) 1)) (or (and (= 0 (select (store a i 0) (+ 3 1))) (= 0 (select (store a i 0) (+ (+ 3 1) (- 1)))) (<= i 5)) (<= i 3))) (<= i 1)) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {517#(and (or (<= i 1) (and (or (and (<= i 6) (= 0 (select a (+ i (- 1)))) (= 0 (select a (+ 3 1))) (= 0 (select a (+ (+ 3 1) (- 1))))) (and (<= i 4) (= 0 (select a (+ (+ 3 1) (- 1)))))) (= 0 (select a 1)) (= 0 (select a (+ 3 (- 1))))) (and (<= i 3) (= 0 (select a 1)) (= 0 (select a (+ i (- 1)))))) (= 0 (select a 0)))} is VALID [2018-12-18 17:52:36,095 INFO L273 TraceCheckUtils]: 7: Hoare triple {517#(and (or (<= i 1) (and (or (and (<= i 6) (= 0 (select a (+ i (- 1)))) (= 0 (select a (+ 3 1))) (= 0 (select a (+ (+ 3 1) (- 1))))) (and (<= i 4) (= 0 (select a (+ (+ 3 1) (- 1)))))) (= 0 (select a 1)) (= 0 (select a (+ 3 (- 1))))) (and (<= i 3) (= 0 (select a 1)) (= 0 (select a (+ i (- 1)))))) (= 0 (select a 0)))} assume !(i < n);assume 0 <= r && r < n; {518#(= 0 (select a r))} is VALID [2018-12-18 17:52:36,095 INFO L273 TraceCheckUtils]: 8: Hoare triple {518#(= 0 (select a r))} assume !(a[r] == 0); {510#false} is VALID [2018-12-18 17:52:36,096 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 17:52:36,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 17:52:36,096 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-18 17:52:36,096 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-18 17:52:36,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-18 17:52:36,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 17:52:36,097 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-18 17:52:36,107 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-18 17:52:36,108 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-18 17:52:36,129 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-18 17:52:36,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-18 17:52:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 17:52:36,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-18 17:52:36,194 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 6 treesize of output 5 [2018-12-18 17:52:36,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 17:52:36,203 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. [2018-12-18 17:52:36,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-18 17:52:36,207 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 17:52:36,207 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_a_35, v_i_35]. (and (<= i (+ v_i_35 1)) (= (store v_a_35 v_i_35 0) a) (<= v_i_35 0)) [2018-12-18 17:52:36,207 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_i_35]. (and (<= i (+ v_i_35 1)) (= (select a v_i_35) 0) (<= v_i_35 0)) [2018-12-18 17:52:36,247 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-18 17:52:36,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 17:52:36,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-18 17:52:36,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-12-18 17:52:36,267 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 17:52:36,267 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_a_36, v_i_36, v_i_35]. (and (<= v_i_36 (+ v_i_35 1)) (= a (store v_a_36 v_i_36 0)) (= (select v_a_36 v_i_35) 0) (<= v_i_35 0) (<= i (+ v_i_36 1))) [2018-12-18 17:52:36,267 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_i_36, v_i_35]. (and (<= v_i_36 (+ v_i_35 1)) (= (select a v_i_35) 0) (<= v_i_35 0) (<= i (+ v_i_36 1)) (= (select a v_i_36) 0)) [2018-12-18 17:52:36,323 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-12-18 17:52:36,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 17:52:36,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-18 17:52:36,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-12-18 17:52:36,359 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 17:52:36,360 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_a_37, v_i_37, v_i_35, v_i_36]. (and (= (select v_a_37 v_i_35) 0) (<= v_i_36 (+ v_i_35 1)) (<= v_i_35 0) (= (select v_a_37 v_i_36) 0) (<= i (+ v_i_37 1)) (<= v_i_37 (+ v_i_36 1)) (= a (store v_a_37 v_i_37 0))) [2018-12-18 17:52:36,360 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_i_36, v_i_35, v_i_37]. (and (<= v_i_36 (+ v_i_35 1)) (= (select a v_i_35) 0) (= (select a v_i_37) 0) (<= v_i_35 0) (<= i (+ v_i_37 1)) (<= v_i_37 (+ v_i_36 1)) (= (select a v_i_36) 0)) [2018-12-18 17:52:36,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-18 17:52:36,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 17:52:36,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-18 17:52:36,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-12-18 17:52:36,633 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 17:52:36,633 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_a_38, v_i_38, v_i_36, v_i_35, v_i_37]. (and (<= i (+ v_i_38 1)) (<= v_i_36 (+ v_i_35 1)) (= (select v_a_38 v_i_36) 0) (<= v_i_38 (+ v_i_37 1)) (= (select v_a_38 v_i_35) 0) (= (select v_a_38 v_i_37) 0) (<= v_i_35 0) (<= v_i_37 (+ v_i_36 1)) (= a (store v_a_38 v_i_38 0))) [2018-12-18 17:52:36,634 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_i_38, v_i_36, v_i_35, v_i_37]. (and (<= i (+ v_i_38 1)) (<= v_i_36 (+ v_i_35 1)) (<= v_i_38 (+ v_i_37 1)) (= (select a v_i_35) 0) (= (select a v_i_37) 0) (<= v_i_35 0) (<= v_i_37 (+ v_i_36 1)) (= (select a v_i_38) 0) (= (select a v_i_36) 0)) [2018-12-18 17:52:36,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-12-18 17:52:36,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 17:52:36,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-18 17:52:36,883 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-12-18 17:52:37,688 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 17:52:37,689 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_a_39, v_i_39, v_i_35, v_i_38, v_i_36, v_i_37]. (and (= (select v_a_39 v_i_35) 0) (= (select v_a_39 v_i_38) 0) (<= v_i_36 (+ v_i_35 1)) (<= i (+ v_i_39 1)) (<= v_i_38 (+ v_i_37 1)) (= (select v_a_39 v_i_36) 0) (= (select v_a_39 v_i_37) 0) (= a (store v_a_39 v_i_39 0)) (<= v_i_39 (+ v_i_38 1)) (<= v_i_35 0) (<= v_i_37 (+ v_i_36 1))) [2018-12-18 17:52:37,689 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_i_36, v_i_35, v_i_39, v_i_38, v_i_37]. (and (<= v_i_36 (+ v_i_35 1)) (<= i (+ v_i_39 1)) (= 0 (select a v_i_39)) (<= v_i_38 (+ v_i_37 1)) (= (select a v_i_35) 0) (= (select a v_i_37) 0) (<= v_i_39 (+ v_i_38 1)) (<= v_i_35 0) (<= v_i_37 (+ v_i_36 1)) (= (select a v_i_38) 0) (= (select a v_i_36) 0)) [2018-12-18 17:52:38,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-12-18 17:52:38,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 17:52:38,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-12-18 17:52:38,162 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2018-12-18 17:52:40,535 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 17:52:40,536 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_a_40, v_i_40, v_i_39, v_i_38, v_i_36, v_i_37, v_i_35]. (and (= a (store v_a_40 v_i_40 0)) (<= v_i_39 (+ v_i_38 1)) (= 0 (select v_a_40 v_i_36)) (= 0 (select v_a_40 v_i_37)) (<= v_i_36 (+ v_i_35 1)) (<= v_i_38 (+ v_i_37 1)) (= 0 (select v_a_40 v_i_39)) (= (select v_a_40 v_i_35) 0) (<= i (+ v_i_40 1)) (<= v_i_35 0) (<= v_i_37 (+ v_i_36 1)) (<= v_i_40 (+ v_i_39 1)) (= (select v_a_40 v_i_38) 0)) [2018-12-18 17:52:40,536 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_i_39, v_i_40, v_i_38, v_i_36, v_i_35, v_i_37]. (and (= 0 (select a v_i_39)) (= (select a v_i_40) 0) (<= v_i_39 (+ v_i_38 1)) (<= v_i_36 (+ v_i_35 1)) (<= v_i_38 (+ v_i_37 1)) (= (select a v_i_35) 0) (= (select a v_i_37) 0) (<= i (+ v_i_40 1)) (<= v_i_35 0) (<= v_i_37 (+ v_i_36 1)) (= (select a v_i_38) 0) (<= v_i_40 (+ v_i_39 1)) (= (select a v_i_36) 0)) [2018-12-18 17:52:45,706 INFO L273 TraceCheckUtils]: 0: Hoare triple {509#true} i := 0;assume j == i; {522#(<= i 0)} is VALID [2018-12-18 17:52:45,707 INFO L273 TraceCheckUtils]: 1: Hoare triple {522#(<= i 0)} assume i < n;a := a[i := 0];i := i + 1; {526#(exists ((v_i_35 Int)) (and (<= i (+ v_i_35 1)) (= (select a v_i_35) 0) (<= v_i_35 0)))} is VALID [2018-12-18 17:52:45,710 INFO L273 TraceCheckUtils]: 2: Hoare triple {526#(exists ((v_i_35 Int)) (and (<= i (+ v_i_35 1)) (= (select a v_i_35) 0) (<= v_i_35 0)))} assume i < n;a := a[i := 0];i := i + 1; {530#(exists ((v_i_35 Int) (v_i_36 Int)) (and (<= v_i_36 (+ v_i_35 1)) (= (select a v_i_35) 0) (<= v_i_35 0) (= (select a v_i_36) 0) (<= i (+ v_i_36 1))))} is VALID [2018-12-18 17:52:45,714 INFO L273 TraceCheckUtils]: 3: Hoare triple {530#(exists ((v_i_35 Int) (v_i_36 Int)) (and (<= v_i_36 (+ v_i_35 1)) (= (select a v_i_35) 0) (<= v_i_35 0) (= (select a v_i_36) 0) (<= i (+ v_i_36 1))))} assume i < n;a := a[i := 0];i := i + 1; {534#(exists ((v_i_35 Int) (v_i_37 Int) (v_i_36 Int)) (and (<= v_i_36 (+ v_i_35 1)) (= (select a v_i_35) 0) (= (select a v_i_37) 0) (<= v_i_35 0) (<= i (+ v_i_37 1)) (<= v_i_37 (+ v_i_36 1)) (= (select a v_i_36) 0)))} is VALID [2018-12-18 17:52:45,730 INFO L273 TraceCheckUtils]: 4: Hoare triple {534#(exists ((v_i_35 Int) (v_i_37 Int) (v_i_36 Int)) (and (<= v_i_36 (+ v_i_35 1)) (= (select a v_i_35) 0) (= (select a v_i_37) 0) (<= v_i_35 0) (<= i (+ v_i_37 1)) (<= v_i_37 (+ v_i_36 1)) (= (select a v_i_36) 0)))} assume i < n;a := a[i := 0];i := i + 1; {538#(exists ((v_i_35 Int) (v_i_37 Int) (v_i_36 Int) (v_i_38 Int)) (and (<= i (+ v_i_38 1)) (<= v_i_36 (+ v_i_35 1)) (<= v_i_38 (+ v_i_37 1)) (= (select a v_i_35) 0) (= (select a v_i_37) 0) (<= v_i_35 0) (= (select a v_i_38) 0) (<= v_i_37 (+ v_i_36 1)) (= (select a v_i_36) 0)))} is VALID [2018-12-18 17:52:45,964 INFO L273 TraceCheckUtils]: 5: Hoare triple {538#(exists ((v_i_35 Int) (v_i_37 Int) (v_i_36 Int) (v_i_38 Int)) (and (<= i (+ v_i_38 1)) (<= v_i_36 (+ v_i_35 1)) (<= v_i_38 (+ v_i_37 1)) (= (select a v_i_35) 0) (= (select a v_i_37) 0) (<= v_i_35 0) (= (select a v_i_38) 0) (<= v_i_37 (+ v_i_36 1)) (= (select a v_i_36) 0)))} assume i < n;a := a[i := 0];i := i + 1; {542#(exists ((v_i_35 Int) (v_i_37 Int) (v_i_36 Int) (v_i_39 Int) (v_i_38 Int)) (and (<= v_i_36 (+ v_i_35 1)) (<= i (+ v_i_39 1)) (= 0 (select a v_i_39)) (<= v_i_38 (+ v_i_37 1)) (= (select a v_i_35) 0) (= (select a v_i_37) 0) (<= v_i_39 (+ v_i_38 1)) (<= v_i_35 0) (= (select a v_i_38) 0) (<= v_i_37 (+ v_i_36 1)) (= (select a v_i_36) 0)))} is VALID [2018-12-18 17:52:46,890 INFO L273 TraceCheckUtils]: 6: Hoare triple {542#(exists ((v_i_35 Int) (v_i_37 Int) (v_i_36 Int) (v_i_39 Int) (v_i_38 Int)) (and (<= v_i_36 (+ v_i_35 1)) (<= i (+ v_i_39 1)) (= 0 (select a v_i_39)) (<= v_i_38 (+ v_i_37 1)) (= (select a v_i_35) 0) (= (select a v_i_37) 0) (<= v_i_39 (+ v_i_38 1)) (<= v_i_35 0) (= (select a v_i_38) 0) (<= v_i_37 (+ v_i_36 1)) (= (select a v_i_36) 0)))} assume i < n;a := a[i := 0];i := i + 1; {546#(exists ((v_i_40 Int) (v_i_35 Int) (v_i_37 Int) (v_i_36 Int) (v_i_39 Int) (v_i_38 Int)) (and (= 0 (select a v_i_39)) (= (select a v_i_40) 0) (<= v_i_39 (+ v_i_38 1)) (<= v_i_36 (+ v_i_35 1)) (<= v_i_38 (+ v_i_37 1)) (= (select a v_i_35) 0) (= (select a v_i_37) 0) (<= i (+ v_i_40 1)) (<= v_i_35 0) (= (select a v_i_38) 0) (<= v_i_37 (+ v_i_36 1)) (<= v_i_40 (+ v_i_39 1)) (= (select a v_i_36) 0)))} is VALID [2018-12-18 17:52:47,582 INFO L273 TraceCheckUtils]: 7: Hoare triple {546#(exists ((v_i_40 Int) (v_i_35 Int) (v_i_37 Int) (v_i_36 Int) (v_i_39 Int) (v_i_38 Int)) (and (= 0 (select a v_i_39)) (= (select a v_i_40) 0) (<= v_i_39 (+ v_i_38 1)) (<= v_i_36 (+ v_i_35 1)) (<= v_i_38 (+ v_i_37 1)) (= (select a v_i_35) 0) (= (select a v_i_37) 0) (<= i (+ v_i_40 1)) (<= v_i_35 0) (= (select a v_i_38) 0) (<= v_i_37 (+ v_i_36 1)) (<= v_i_40 (+ v_i_39 1)) (= (select a v_i_36) 0)))} assume !(i < n);assume 0 <= r && r < n; {550#(and (<= 0 r) (exists ((v_i_40 Int) (v_i_35 Int) (v_i_37 Int) (v_i_36 Int) (v_i_39 Int) (v_i_38 Int)) (and (= 0 (select a v_i_39)) (= (select a v_i_40) 0) (<= v_i_39 (+ v_i_38 1)) (<= r v_i_40) (<= v_i_36 (+ v_i_35 1)) (<= v_i_38 (+ v_i_37 1)) (= (select a v_i_35) 0) (= (select a v_i_37) 0) (<= v_i_35 0) (= (select a v_i_38) 0) (<= v_i_37 (+ v_i_36 1)) (<= v_i_40 (+ v_i_39 1)) (= (select a v_i_36) 0))))} is VALID [2018-12-18 17:52:47,594 INFO L273 TraceCheckUtils]: 8: Hoare triple {550#(and (<= 0 r) (exists ((v_i_40 Int) (v_i_35 Int) (v_i_37 Int) (v_i_36 Int) (v_i_39 Int) (v_i_38 Int)) (and (= 0 (select a v_i_39)) (= (select a v_i_40) 0) (<= v_i_39 (+ v_i_38 1)) (<= r v_i_40) (<= v_i_36 (+ v_i_35 1)) (<= v_i_38 (+ v_i_37 1)) (= (select a v_i_35) 0) (= (select a v_i_37) 0) (<= v_i_35 0) (= (select a v_i_38) 0) (<= v_i_37 (+ v_i_36 1)) (<= v_i_40 (+ v_i_39 1)) (= (select a v_i_36) 0))))} assume !(a[r] == 0); {510#false} is VALID [2018-12-18 17:52:47,595 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 17:52:47,595 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-18 17:52:51,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-18 17:52:51,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 17:52:51,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 17:52:51,653 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2018-12-18 17:52:51,666 INFO L273 TraceCheckUtils]: 8: Hoare triple {518#(= 0 (select a r))} assume !(a[r] == 0); {510#false} is VALID [2018-12-18 17:52:51,667 INFO L273 TraceCheckUtils]: 7: Hoare triple {557#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume !(i < n);assume 0 <= r && r < n; {518#(= 0 (select a r))} is VALID [2018-12-18 17:52:51,668 INFO L273 TraceCheckUtils]: 6: Hoare triple {557#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {557#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2018-12-18 17:52:51,669 INFO L273 TraceCheckUtils]: 5: Hoare triple {557#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {557#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2018-12-18 17:52:51,671 INFO L273 TraceCheckUtils]: 4: Hoare triple {557#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {557#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2018-12-18 17:52:51,672 INFO L273 TraceCheckUtils]: 3: Hoare triple {557#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {557#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2018-12-18 17:52:51,674 INFO L273 TraceCheckUtils]: 2: Hoare triple {557#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {557#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2018-12-18 17:52:51,675 INFO L273 TraceCheckUtils]: 1: Hoare triple {522#(<= i 0)} assume i < n;a := a[i := 0];i := i + 1; {557#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2018-12-18 17:52:51,676 INFO L273 TraceCheckUtils]: 0: Hoare triple {509#true} i := 0;assume j == i; {522#(<= i 0)} is VALID [2018-12-18 17:52:51,677 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-18 17:52:51,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-18 17:52:51,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 3] total 17 [2018-12-18 17:52:51,696 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-18 17:52:51,697 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 9 [2018-12-18 17:52:51,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 17:52:51,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-12-18 17:52:54,634 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 17 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-12-18 17:52:54,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-18 17:52:54,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-18 17:52:54,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2018-12-18 17:52:54,635 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 18 states. [2018-12-18 17:52:55,315 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 29 [2018-12-18 17:53:03,703 WARN L181 SmtUtils]: Spent 822.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2018-12-18 17:53:03,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 17:53:03,754 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-18 17:53:03,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-18 17:53:03,755 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 9 [2018-12-18 17:53:03,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 17:53:03,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-18 17:53:03,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-12-18 17:53:03,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-18 17:53:03,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-12-18 17:53:03,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 13 transitions. [2018-12-18 17:53:04,402 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 17:53:04,403 INFO L225 Difference]: With dead ends: 13 [2018-12-18 17:53:04,403 INFO L226 Difference]: Without dead ends: 11 [2018-12-18 17:53:04,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=112, Invalid=307, Unknown=1, NotChecked=0, Total=420 [2018-12-18 17:53:04,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-18 17:53:04,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-18 17:53:04,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 17:53:04,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 11 states. [2018-12-18 17:53:04,473 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2018-12-18 17:53:04,473 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2018-12-18 17:53:04,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 17:53:04,474 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-18 17:53:04,474 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-18 17:53:04,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 17:53:04,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 17:53:04,475 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2018-12-18 17:53:04,475 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2018-12-18 17:53:04,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 17:53:04,476 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-18 17:53:04,476 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-18 17:53:04,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 17:53:04,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 17:53:04,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 17:53:04,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 17:53:04,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-18 17:53:04,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-18 17:53:04,478 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-18 17:53:04,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 17:53:04,478 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-18 17:53:04,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-18 17:53:04,479 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-18 17:53:04,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-18 17:53:04,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 17:53:04,479 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-18 17:53:04,480 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-18 17:53:04,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 17:53:04,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2018-12-18 17:53:04,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 17:53:04,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 17:53:04,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-18 17:53:04,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 17:53:04,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 17:53:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 17:53:05,103 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2018-12-18 17:53:05,327 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 30 [2018-12-18 17:53:05,734 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 49 [2018-12-18 17:53:06,109 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 52 [2018-12-18 17:53:06,153 INFO L273 TraceCheckUtils]: 0: Hoare triple {644#true} i := 0;assume j == i; {646#(= 0 i)} is VALID [2018-12-18 17:53:06,154 INFO L273 TraceCheckUtils]: 1: Hoare triple {646#(= 0 i)} assume i < n;a := a[i := 0];i := i + 1; {647#(and (<= i 1) (<= 1 i) (= 0 (select (store a i 0) 0)))} is VALID [2018-12-18 17:53:06,170 INFO L273 TraceCheckUtils]: 2: Hoare triple {647#(and (<= i 1) (<= 1 i) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {648#(and (<= i 2) (or (and (<= 2 i) (= 0 (select (store a i 0) 0))) (= i 0)) (or (<= i 1) (= 0 (select (store a i 0) 1))))} is VALID [2018-12-18 17:53:06,172 INFO L273 TraceCheckUtils]: 3: Hoare triple {648#(and (<= i 2) (or (and (<= 2 i) (= 0 (select (store a i 0) 0))) (= i 0)) (or (<= i 1) (= 0 (select (store a i 0) 1))))} assume i < n;a := a[i := 0];i := i + 1; {649#(and (<= 1 i) (= 0 (select (store a i 0) 1)) (<= i 3) (= 0 (select (store a i 0) (+ i (- 1)))) (= 0 (select (store a i 0) 0)))} is VALID [2018-12-18 17:53:06,174 INFO L273 TraceCheckUtils]: 4: Hoare triple {649#(and (<= 1 i) (= 0 (select (store a i 0) 1)) (<= i 3) (= 0 (select (store a i 0) (+ i (- 1)))) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {650#(and (<= 2 i) (= 0 (select (store a i 0) 1)) (= 0 (select (store a i 0) (+ (+ 2 1) (- 1)))) (= 0 (select (store a i 0) (+ i (- 1)))) (<= i 4) (= 0 (select (store a i 0) 0)))} is VALID [2018-12-18 17:53:06,176 INFO L273 TraceCheckUtils]: 5: Hoare triple {650#(and (<= 2 i) (= 0 (select (store a i 0) 1)) (= 0 (select (store a i 0) (+ (+ 2 1) (- 1)))) (= 0 (select (store a i 0) (+ i (- 1)))) (<= i 4) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {651#(and (= 0 (select (store a i 0) (+ (+ i (- 1)) (- 1)))) (<= 3 i) (= 0 (select (store a i 0) 1)) (= 0 (select (store a i 0) (+ i (- 1)))) (= 0 (select (store a i 0) (+ (+ 2 1) (- 1)))) (<= i 5) (= 0 (select (store a i 0) 0)))} is VALID [2018-12-18 17:53:06,179 INFO L273 TraceCheckUtils]: 6: Hoare triple {651#(and (= 0 (select (store a i 0) (+ (+ i (- 1)) (- 1)))) (<= 3 i) (= 0 (select (store a i 0) 1)) (= 0 (select (store a i 0) (+ i (- 1)))) (= 0 (select (store a i 0) (+ (+ 2 1) (- 1)))) (<= i 5) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {652#(and (or (<= i 1) (and (= 0 (select (store a i 0) (+ 2 2))) (= 0 (select (store a i 0) 1)) (<= i 6) (= 0 (select (store a i 0) (+ (+ 2 2) (- 1)))) (= 0 (select (store a i 0) (+ (+ 2 1) (- 1)))) (= 0 (select (store a i 0) (+ (+ 2 2) 1)))) (and (or (<= i 3) (and (= 0 (select (store a i 0) (+ 1 2))) (<= i 4))) (= 0 (select (store a i 0) (+ (+ 1 1) (- 1)))) (= 0 (select (store a i 0) (+ (+ 1 2) (- 1)))))) (= 0 (select (store a i 0) 0)))} is VALID [2018-12-18 17:53:06,182 INFO L273 TraceCheckUtils]: 7: Hoare triple {652#(and (or (<= i 1) (and (= 0 (select (store a i 0) (+ 2 2))) (= 0 (select (store a i 0) 1)) (<= i 6) (= 0 (select (store a i 0) (+ (+ 2 2) (- 1)))) (= 0 (select (store a i 0) (+ (+ 2 1) (- 1)))) (= 0 (select (store a i 0) (+ (+ 2 2) 1)))) (and (or (<= i 3) (and (= 0 (select (store a i 0) (+ 1 2))) (<= i 4))) (= 0 (select (store a i 0) (+ (+ 1 1) (- 1)))) (= 0 (select (store a i 0) (+ (+ 1 2) (- 1)))))) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {653#(and (= 0 (select a 0)) (or (<= i 1) (and (= 0 (select a (+ (+ 1 1) (- 1)))) (or (and (= 0 (select a (+ 1 1))) (= 0 (select a (+ (+ 1 1) 1))) (<= i 5)) (<= i 3)) (= 0 (select a (+ i (- 1))))) (and (<= i 7) (= 0 (select a (+ 2 2))) (= 0 (select a (+ (+ 2 2) (- 1)))) (= 0 (select a 1)) (= 0 (select a (+ i (- 1)))) (= 0 (select a (+ (+ 2 2) 1))) (= 0 (select a (+ (+ 2 1) (- 1)))))))} is VALID [2018-12-18 17:53:06,184 INFO L273 TraceCheckUtils]: 8: Hoare triple {653#(and (= 0 (select a 0)) (or (<= i 1) (and (= 0 (select a (+ (+ 1 1) (- 1)))) (or (and (= 0 (select a (+ 1 1))) (= 0 (select a (+ (+ 1 1) 1))) (<= i 5)) (<= i 3)) (= 0 (select a (+ i (- 1))))) (and (<= i 7) (= 0 (select a (+ 2 2))) (= 0 (select a (+ (+ 2 2) (- 1)))) (= 0 (select a 1)) (= 0 (select a (+ i (- 1)))) (= 0 (select a (+ (+ 2 2) 1))) (= 0 (select a (+ (+ 2 1) (- 1)))))))} assume !(i < n);assume 0 <= r && r < n; {654#(= 0 (select a r))} is VALID [2018-12-18 17:53:06,185 INFO L273 TraceCheckUtils]: 9: Hoare triple {654#(= 0 (select a r))} assume !(a[r] == 0); {645#false} is VALID [2018-12-18 17:53:06,186 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 17:53:06,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 17:53:06,187 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-18 17:53:06,187 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-18 17:53:06,187 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-18 17:53:06,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 17:53:06,187 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-18 17:53:06,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 17:53:06,196 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-18 17:53:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 17:53:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 17:53:06,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-18 17:53:06,243 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 6 treesize of output 5 [2018-12-18 17:53:06,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 17:53:06,256 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. [2018-12-18 17:53:06,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-18 17:53:06,259 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 17:53:06,259 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_a_47, v_i_47]. (and (= (store v_a_47 v_i_47 0) a) (<= i (+ v_i_47 1)) (<= v_i_47 0)) [2018-12-18 17:53:06,259 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_i_47]. (and (<= i (+ v_i_47 1)) (<= v_i_47 0) (= 0 (select a v_i_47))) [2018-12-18 17:53:06,302 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-18 17:53:06,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 17:53:06,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-18 17:53:06,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-12-18 17:53:06,390 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 17:53:06,390 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_a_48, v_i_48, v_i_47]. (and (<= v_i_48 (+ v_i_47 1)) (<= v_i_47 0) (= (store v_a_48 v_i_48 0) a) (<= i (+ v_i_48 1)) (= (select v_a_48 v_i_47) 0)) [2018-12-18 17:53:06,391 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_i_48, v_i_47]. (and (<= v_i_48 (+ v_i_47 1)) (<= v_i_47 0) (= 0 (select a v_i_47)) (= 0 (select a v_i_48)) (<= i (+ v_i_48 1))) [2018-12-18 17:53:06,456 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-12-18 17:53:06,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 17:53:06,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-18 17:53:06,477 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-12-18 17:53:06,505 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 17:53:06,505 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_a_49, v_i_49, v_i_47, v_i_48]. (and (= (store v_a_49 v_i_49 0) a) (<= i (+ v_i_49 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (<= v_i_49 (+ v_i_48 1)) (= 0 (select v_a_49 v_i_47)) (= (select v_a_49 v_i_48) 0)) [2018-12-18 17:53:06,505 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_i_49, v_i_47, v_i_48]. (and (= 0 (select a v_i_49)) (<= i (+ v_i_49 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (<= v_i_49 (+ v_i_48 1)) (= 0 (select a v_i_47)) (= 0 (select a v_i_48))) [2018-12-18 17:53:06,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-18 17:53:06,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 17:53:06,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-18 17:53:06,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-12-18 17:53:06,690 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 17:53:06,691 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_a_50, v_i_50, v_i_49, v_i_48, v_i_47]. (and (<= i (+ v_i_50 1)) (<= v_i_50 (+ v_i_49 1)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= (store v_a_50 v_i_50 0) a) (= 0 (select v_a_50 v_i_48)) (= 0 (select v_a_50 v_i_49)) (= 0 (select v_a_50 v_i_47))) [2018-12-18 17:53:06,691 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_i_50, v_i_49, v_i_48, v_i_47]. (and (<= i (+ v_i_50 1)) (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_49)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50))) [2018-12-18 17:53:06,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-12-18 17:53:06,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 17:53:06,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-18 17:53:06,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-12-18 17:53:08,693 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 17:53:08,694 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_a_51, v_i_51, v_i_50, v_i_49, v_i_48, v_i_47]. (and (<= v_i_50 (+ v_i_49 1)) (= 0 (select v_a_51 v_i_50)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select v_a_51 v_i_48)) (= 0 (select v_a_51 v_i_47)) (<= i (+ v_i_51 1)) (<= v_i_51 (+ v_i_50 1)) (= (select v_a_51 v_i_49) 0) (= a (store v_a_51 v_i_51 0))) [2018-12-18 17:53:08,694 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_i_50, v_i_49, v_i_51, v_i_48, v_i_47]. (and (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_51)) (= 0 (select a v_i_49)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (= 0 (select a v_i_48)) (<= i (+ v_i_51 1)) (= 0 (select a v_i_50)) (<= v_i_51 (+ v_i_50 1))) [2018-12-18 17:53:09,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-12-18 17:53:09,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 17:53:09,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-12-18 17:53:09,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2018-12-18 17:53:11,634 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 17:53:11,635 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_a_52, v_i_52, v_i_50, v_i_49, v_i_47, v_i_48, v_i_51]. (and (<= v_i_50 (+ v_i_49 1)) (= 0 (select v_a_52 v_i_47)) (= 0 (select v_a_52 v_i_48)) (= 0 (select v_a_52 v_i_50)) (<= v_i_52 (+ v_i_51 1)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= a (store v_a_52 v_i_52 0)) (= 0 (select v_a_52 v_i_49)) (<= v_i_51 (+ v_i_50 1)) (= 0 (select v_a_52 v_i_51)) (<= i (+ v_i_52 1))) [2018-12-18 17:53:11,635 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_i_50, v_i_49, v_i_52, v_i_48, v_i_51, v_i_47]. (and (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_52)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50)) (= 0 (select a v_i_51)) (= 0 (select a v_i_49)) (<= v_i_52 (+ v_i_51 1)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (<= v_i_51 (+ v_i_50 1)) (<= i (+ v_i_52 1))) [2018-12-18 17:53:13,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-12-18 17:53:13,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 17:53:14,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-12-18 17:53:14,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74 [2018-12-18 17:53:16,255 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 17:53:16,256 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_a_53, v_i_53, v_i_50, v_i_49, v_i_51, v_i_52, v_i_47, v_i_48]. (and (= 0 (select v_a_53 v_i_50)) (<= v_i_50 (+ v_i_49 1)) (= 0 (select v_a_53 v_i_51)) (= 0 (select v_a_53 v_i_49)) (<= v_i_52 (+ v_i_51 1)) (= 0 (select v_a_53 v_i_47)) (= 0 (select v_a_53 v_i_52)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (<= i (+ v_i_53 1)) (<= v_i_51 (+ v_i_50 1)) (<= v_i_53 (+ v_i_52 1)) (= 0 (select v_a_53 v_i_48)) (= a (store v_a_53 v_i_53 0))) [2018-12-18 17:53:16,256 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_i_53, v_i_50, v_i_49, v_i_52, v_i_48, v_i_51, v_i_47]. (and (= 0 (select a v_i_53)) (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_52)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50)) (= 0 (select a v_i_51)) (= 0 (select a v_i_49)) (<= v_i_52 (+ v_i_51 1)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (<= i (+ v_i_53 1)) (<= v_i_51 (+ v_i_50 1)) (<= v_i_53 (+ v_i_52 1))) [2018-12-18 17:53:34,105 INFO L273 TraceCheckUtils]: 0: Hoare triple {644#true} i := 0;assume j == i; {658#(<= i 0)} is VALID [2018-12-18 17:53:34,107 INFO L273 TraceCheckUtils]: 1: Hoare triple {658#(<= i 0)} assume i < n;a := a[i := 0];i := i + 1; {662#(exists ((v_i_47 Int)) (and (<= i (+ v_i_47 1)) (<= v_i_47 0) (= 0 (select a v_i_47))))} is VALID [2018-12-18 17:53:34,109 INFO L273 TraceCheckUtils]: 2: Hoare triple {662#(exists ((v_i_47 Int)) (and (<= i (+ v_i_47 1)) (<= v_i_47 0) (= 0 (select a v_i_47))))} assume i < n;a := a[i := 0];i := i + 1; {666#(exists ((v_i_48 Int) (v_i_47 Int)) (and (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (= 0 (select a v_i_48)) (<= i (+ v_i_48 1))))} is VALID [2018-12-18 17:53:34,112 INFO L273 TraceCheckUtils]: 3: Hoare triple {666#(exists ((v_i_48 Int) (v_i_47 Int)) (and (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (= 0 (select a v_i_48)) (<= i (+ v_i_48 1))))} assume i < n;a := a[i := 0];i := i + 1; {670#(exists ((v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (= 0 (select a v_i_49)) (<= i (+ v_i_49 1)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (= 0 (select a v_i_48))))} is VALID [2018-12-18 17:53:34,121 INFO L273 TraceCheckUtils]: 4: Hoare triple {670#(exists ((v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (= 0 (select a v_i_49)) (<= i (+ v_i_49 1)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (= 0 (select a v_i_48))))} assume i < n;a := a[i := 0];i := i + 1; {674#(exists ((v_i_50 Int) (v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (<= i (+ v_i_50 1)) (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_49)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50))))} is VALID [2018-12-18 17:53:34,179 INFO L273 TraceCheckUtils]: 5: Hoare triple {674#(exists ((v_i_50 Int) (v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (<= i (+ v_i_50 1)) (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_49)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50))))} assume i < n;a := a[i := 0];i := i + 1; {678#(exists ((v_i_51 Int) (v_i_50 Int) (v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_51)) (= 0 (select a v_i_49)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50)) (<= i (+ v_i_51 1)) (<= v_i_51 (+ v_i_50 1))))} is VALID [2018-12-18 17:53:36,184 INFO L273 TraceCheckUtils]: 6: Hoare triple {678#(exists ((v_i_51 Int) (v_i_50 Int) (v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_51)) (= 0 (select a v_i_49)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50)) (<= i (+ v_i_51 1)) (<= v_i_51 (+ v_i_50 1))))} assume i < n;a := a[i := 0];i := i + 1; {682#(exists ((v_i_51 Int) (v_i_50 Int) (v_i_52 Int) (v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_52)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50)) (= 0 (select a v_i_51)) (= 0 (select a v_i_49)) (<= v_i_52 (+ v_i_51 1)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (<= v_i_51 (+ v_i_50 1)) (<= i (+ v_i_52 1))))} is UNKNOWN [2018-12-18 17:53:38,289 INFO L273 TraceCheckUtils]: 7: Hoare triple {682#(exists ((v_i_51 Int) (v_i_50 Int) (v_i_52 Int) (v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_52)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50)) (= 0 (select a v_i_51)) (= 0 (select a v_i_49)) (<= v_i_52 (+ v_i_51 1)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (<= v_i_51 (+ v_i_50 1)) (<= i (+ v_i_52 1))))} assume i < n;a := a[i := 0];i := i + 1; {686#(exists ((v_i_51 Int) (v_i_50 Int) (v_i_53 Int) (v_i_52 Int) (v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (= 0 (select a v_i_53)) (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_52)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50)) (= 0 (select a v_i_51)) (= 0 (select a v_i_49)) (<= v_i_52 (+ v_i_51 1)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (<= i (+ v_i_53 1)) (<= v_i_53 (+ v_i_52 1)) (<= v_i_51 (+ v_i_50 1))))} is UNKNOWN [2018-12-18 17:53:40,592 INFO L273 TraceCheckUtils]: 8: Hoare triple {686#(exists ((v_i_51 Int) (v_i_50 Int) (v_i_53 Int) (v_i_52 Int) (v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (= 0 (select a v_i_53)) (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_52)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50)) (= 0 (select a v_i_51)) (= 0 (select a v_i_49)) (<= v_i_52 (+ v_i_51 1)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (<= i (+ v_i_53 1)) (<= v_i_53 (+ v_i_52 1)) (<= v_i_51 (+ v_i_50 1))))} assume !(i < n);assume 0 <= r && r < n; {690#(and (<= 0 r) (exists ((v_i_51 Int) (v_i_50 Int) (v_i_53 Int) (v_i_52 Int) (v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (= 0 (select a v_i_53)) (<= r v_i_53) (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_52)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50)) (= 0 (select a v_i_51)) (= 0 (select a v_i_49)) (<= v_i_52 (+ v_i_51 1)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (<= v_i_53 (+ v_i_52 1)) (<= v_i_51 (+ v_i_50 1)))))} is UNKNOWN [2018-12-18 17:53:40,613 INFO L273 TraceCheckUtils]: 9: Hoare triple {690#(and (<= 0 r) (exists ((v_i_51 Int) (v_i_50 Int) (v_i_53 Int) (v_i_52 Int) (v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (= 0 (select a v_i_53)) (<= r v_i_53) (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_52)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50)) (= 0 (select a v_i_51)) (= 0 (select a v_i_49)) (<= v_i_52 (+ v_i_51 1)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (<= v_i_53 (+ v_i_52 1)) (<= v_i_51 (+ v_i_50 1)))))} assume !(a[r] == 0); {645#false} is VALID [2018-12-18 17:53:40,615 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 17:53:40,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-18 17:53:43,183 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-18 17:53:43,384 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-18 17:53:43,386 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:899) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 40 more [2018-12-18 17:53:43,392 INFO L168 Benchmark]: Toolchain (without parser) took 87001.41 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 969.9 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -649.6 MB). Peak memory consumption was 320.4 MB. Max. memory is 7.1 GB. [2018-12-18 17:53:43,393 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-18 17:53:43,393 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.69 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-18 17:53:43,394 INFO L168 Benchmark]: Boogie Preprocessor took 29.92 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-18 17:53:43,394 INFO L168 Benchmark]: RCFGBuilder took 331.01 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-18 17:53:43,395 INFO L168 Benchmark]: TraceAbstraction took 86589.46 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 969.9 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -670.7 MB). Peak memory consumption was 299.2 MB. Max. memory is 7.1 GB. [2018-12-18 17:53:43,399 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.27 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 44.69 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 29.92 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 331.01 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 86589.46 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 969.9 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -670.7 MB). Peak memory consumption was 299.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...