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-a9d37a5-m [2019-02-28 13:05:01,705 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 13:05:01,707 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 13:05:01,723 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 13:05:01,724 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 13:05:01,726 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 13:05:01,727 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 13:05:01,729 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 13:05:01,731 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 13:05:01,734 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 13:05:01,735 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 13:05:01,736 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 13:05:01,736 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 13:05:01,738 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 13:05:01,739 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 13:05:01,748 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 13:05:01,748 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 13:05:01,753 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 13:05:01,759 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 13:05:01,760 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 13:05:01,761 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 13:05:01,763 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 13:05:01,768 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 13:05:01,769 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 13:05:01,769 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 13:05:01,770 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 13:05:01,771 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 13:05:01,771 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 13:05:01,775 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 13:05:01,776 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 13:05:01,776 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 13:05:01,777 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 13:05:01,777 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 13:05:01,778 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 13:05:01,779 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 13:05:01,780 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 13:05:01,781 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-28 13:05:01,793 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 13:05:01,794 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 13:05:01,794 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 13:05:01,795 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 13:05:01,795 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 13:05:01,795 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 13:05:01,795 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 13:05:01,795 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 13:05:01,795 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-28 13:05:01,796 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 13:05:01,796 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-28 13:05:01,796 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-28 13:05:01,796 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 13:05:01,796 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 13:05:01,797 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 13:05:01,797 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 13:05:01,797 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 13:05:01,798 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 13:05:01,798 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 13:05:01,798 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 13:05:01,798 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 13:05:01,798 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 13:05:01,799 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 13:05:01,799 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 13:05:01,799 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 13:05:01,799 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 13:05:01,799 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 13:05:01,800 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 13:05:01,800 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 13:05:01,800 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 13:05:01,800 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 13:05:01,800 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:05:01,801 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 13:05:01,801 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 13:05:01,801 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 13:05:01,801 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 13:05:01,801 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 13:05:01,801 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 13:05:01,802 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 13:05:01,802 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 13:05:01,843 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 13:05:01,859 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 13:05:01,864 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 13:05:01,866 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 13:05:01,866 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 13:05:01,867 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl [2019-02-28 13:05:01,867 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl' [2019-02-28 13:05:01,902 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 13:05:01,903 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 13:05:01,904 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 13:05:01,904 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 13:05:01,904 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 13:05:01,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:05:01" (1/1) ... [2019-02-28 13:05:01,932 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:05:01" (1/1) ... [2019-02-28 13:05:01,938 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-28 13:05:01,939 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-28 13:05:01,939 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-28 13:05:01,941 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 13:05:01,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 13:05:01,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 13:05:01,942 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 13:05:01,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:05:01" (1/1) ... [2019-02-28 13:05:01,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:05:01" (1/1) ... [2019-02-28 13:05:01,954 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:05:01" (1/1) ... [2019-02-28 13:05:01,954 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:05:01" (1/1) ... [2019-02-28 13:05:01,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:05:01" (1/1) ... [2019-02-28 13:05:01,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:05:01" (1/1) ... [2019-02-28 13:05:01,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:05:01" (1/1) ... [2019-02-28 13:05:01,963 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 13:05:01,963 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 13:05:01,964 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 13:05:01,964 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 13:05:01,965 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:05:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:05:02,030 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-02-28 13:05:02,032 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-02-28 13:05:02,032 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-02-28 13:05:02,304 INFO L278 CfgBuilder]: Using library mode [2019-02-28 13:05:02,305 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-02-28 13:05:02,306 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:05:02 BoogieIcfgContainer [2019-02-28 13:05:02,306 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 13:05:02,308 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 13:05:02,308 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 13:05:02,312 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 13:05:02,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:05:01" (1/2) ... [2019-02-28 13:05:02,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@565f6544 and model type ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 01:05:02, skipping insertion in model container [2019-02-28 13:05:02,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:05:02" (2/2) ... [2019-02-28 13:05:02,315 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit01.bpl [2019-02-28 13:05:02,325 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 13:05:02,335 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-28 13:05:02,371 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-28 13:05:02,453 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 13:05:02,454 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 13:05:02,454 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 13:05:02,454 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 13:05:02,454 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 13:05:02,454 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 13:05:02,455 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 13:05:02,455 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 13:05:02,482 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-28 13:05:02,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 13:05:02,491 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:05:02,492 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 13:05:02,494 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:05:02,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:05:02,500 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-02-28 13:05:02,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:05:02,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:05:02,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:05:02,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:05:02,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:05:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:02,685 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} i := 0;assume j == i; {11#(= i 0)} is VALID [2019-02-28 13:05:02,694 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(= i 0)} assume !(i < n);assume 0 <= r && r < n; {10#false} is VALID [2019-02-28 13:05:02,694 INFO L273 TraceCheckUtils]: 2: Hoare triple {10#false} assume !(a[r] == 0); {10#false} is VALID [2019-02-28 13:05:02,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:05:02,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:05:02,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 13:05:02,698 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:05:02,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 13:05:02,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:05:02,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-28 13:05:02,727 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:05:02,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 13:05:02,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 13:05:02,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:05:02,739 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-02-28 13:05:02,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:02,840 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-02-28 13:05:02,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 13:05:02,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 13:05:02,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:05:02,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:05:02,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-02-28 13:05:02,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:05:02,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-02-28 13:05:02,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 11 transitions. [2019-02-28 13:05:02,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:05:02,909 INFO L225 Difference]: With dead ends: 11 [2019-02-28 13:05:02,909 INFO L226 Difference]: Without dead ends: 5 [2019-02-28 13:05:02,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:05:02,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-02-28 13:05:02,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-02-28 13:05:02,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:05:02,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-02-28 13:05:02,984 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-02-28 13:05:02,984 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-02-28 13:05:02,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:02,985 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-02-28 13:05:02,986 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-28 13:05:02,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:02,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:05:02,987 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-02-28 13:05:02,987 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-02-28 13:05:02,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:02,988 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-02-28 13:05:02,989 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-28 13:05:02,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:02,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:05:02,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:05:02,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:05:02,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-28 13:05:02,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-02-28 13:05:02,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-02-28 13:05:02,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:05:02,993 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-02-28 13:05:02,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 13:05:02,994 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-28 13:05:02,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 13:05:02,994 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:05:02,995 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 13:05:02,995 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:05:02,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:05:02,995 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-02-28 13:05:02,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:05:02,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:05:02,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:05:02,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:05:02,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:05:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:03,493 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 7 [2019-02-28 13:05:03,502 INFO L273 TraceCheckUtils]: 0: Hoare triple {44#true} i := 0;assume j == i; {46#(= i 0)} is VALID [2019-02-28 13:05:03,510 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 [2019-02-28 13:05:03,511 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 [2019-02-28 13:05:03,520 INFO L273 TraceCheckUtils]: 3: Hoare triple {48#(and (= r 0) (= 0 (select a r)))} assume !(a[r] == 0); {45#false} is VALID [2019-02-28 13:05:03,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:05:03,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:05:03,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:05:03,522 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 13:05:03,524 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [7] [2019-02-28 13:05:03,560 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 13:05:03,561 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 13:05:03,796 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 13:05:03,797 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. [2019-02-28 13:05:03,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:05:03,804 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 13:05:03,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:05:03,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 13:05:03,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:05:03,817 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 13:05:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:03,842 WARN L254 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 13:05:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:03,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:05:03,974 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 13:05:03,986 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:05:04,015 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 13:05:04,015 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-02-28 13:05:04,019 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:05:04,019 WARN L398 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)) [2019-02-28 13:05:04,020 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_5]. (and (<= i (+ v_i_5 1)) (= (select a v_i_5) 0) (<= v_i_5 0)) [2019-02-28 13:05:04,379 INFO L273 TraceCheckUtils]: 0: Hoare triple {44#true} i := 0;assume j == i; {52#(<= i 0)} is VALID [2019-02-28 13:05:04,380 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 [2019-02-28 13:05:04,382 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 [2019-02-28 13:05:04,386 INFO L273 TraceCheckUtils]: 3: Hoare triple {48#(and (= r 0) (= 0 (select a r)))} assume !(a[r] == 0); {45#false} is VALID [2019-02-28 13:05:04,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:05:04,387 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:05:04,675 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-02-28 13:05:04,677 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:05:04,679 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:05:04,800 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:05:04,801 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-02-28 13:05:04,980 INFO L273 TraceCheckUtils]: 3: Hoare triple {63#(= (select a r) 0)} assume !(a[r] == 0); {45#false} is VALID [2019-02-28 13:05:04,985 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 [2019-02-28 13:05:04,986 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 [2019-02-28 13:05:04,987 INFO L273 TraceCheckUtils]: 0: Hoare triple {44#true} i := 0;assume j == i; {52#(<= i 0)} is VALID [2019-02-28 13:05:04,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:05:05,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 13:05:05,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-02-28 13:05:05,007 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 13:05:05,008 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2019-02-28 13:05:05,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:05:05,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2019-02-28 13:05:05,017 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:05:05,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-28 13:05:05,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-28 13:05:05,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-02-28 13:05:05,020 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 7 states. [2019-02-28 13:05:05,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:05,138 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-28 13:05:05,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 13:05:05,139 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2019-02-28 13:05:05,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:05:05,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-28 13:05:05,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2019-02-28 13:05:05,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-28 13:05:05,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2019-02-28 13:05:05,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 8 transitions. [2019-02-28 13:05:05,156 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:05:05,157 INFO L225 Difference]: With dead ends: 8 [2019-02-28 13:05:05,157 INFO L226 Difference]: Without dead ends: 6 [2019-02-28 13:05:05,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-02-28 13:05:05,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-02-28 13:05:05,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-02-28 13:05:05,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:05:05,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states. Second operand 6 states. [2019-02-28 13:05:05,165 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-02-28 13:05:05,165 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-02-28 13:05:05,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:05,166 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-02-28 13:05:05,166 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-28 13:05:05,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:05,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:05:05,167 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-02-28 13:05:05,167 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-02-28 13:05:05,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:05,168 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-02-28 13:05:05,168 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-28 13:05:05,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:05,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:05:05,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:05:05,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:05:05,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-28 13:05:05,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-02-28 13:05:05,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-02-28 13:05:05,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:05:05,170 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-02-28 13:05:05,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-28 13:05:05,170 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-28 13:05:05,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 13:05:05,171 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:05:05,171 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-28 13:05:05,171 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:05:05,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:05:05,171 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2019-02-28 13:05:05,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:05:05,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:05:05,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:05:05,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:05:05,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:05:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:05,390 INFO L273 TraceCheckUtils]: 0: Hoare triple {107#true} i := 0;assume j == i; {109#(= i 0)} is VALID [2019-02-28 13:05:05,391 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 [2019-02-28 13:05:05,392 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 [2019-02-28 13:05:05,393 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 [2019-02-28 13:05:05,393 INFO L273 TraceCheckUtils]: 4: Hoare triple {112#(= 0 (select a r))} assume !(a[r] == 0); {108#false} is VALID [2019-02-28 13:05:05,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:05:05,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:05:05,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:05:05,395 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 13:05:05,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 13:05:05,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:05:05,396 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 [2019-02-28 13:05:05,405 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 13:05:05,406 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 13:05:05,411 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-28 13:05:05,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 13:05:05,412 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 13:05:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:05,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:05:05,479 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 13:05:05,492 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:05:05,498 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 13:05:05,498 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-02-28 13:05:05,506 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:05:05,507 WARN L398 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))) [2019-02-28 13:05:05,507 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_7]. (and (= 0 (select a v_i_7)) (<= v_i_7 0) (<= i (+ v_i_7 1))) [2019-02-28 13:05:05,561 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 14 [2019-02-28 13:05:05,564 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:05:05,580 INFO L315 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. [2019-02-28 13:05:05,581 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-02-28 13:05:05,584 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:05:05,584 WARN L398 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))) [2019-02-28 13:05:05,584 WARN L399 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))) [2019-02-28 13:05:05,722 INFO L273 TraceCheckUtils]: 0: Hoare triple {107#true} i := 0;assume j == i; {116#(<= i 0)} is VALID [2019-02-28 13:05:05,724 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 [2019-02-28 13:05:05,726 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 [2019-02-28 13:05:05,729 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 [2019-02-28 13:05:05,730 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 [2019-02-28 13:05:05,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:05:05,731 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:05:05,924 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-02-28 13:05:05,928 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:05:05,933 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:05:05,947 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:05:05,947 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-02-28 13:05:05,957 INFO L273 TraceCheckUtils]: 4: Hoare triple {112#(= 0 (select a r))} assume !(a[r] == 0); {108#false} is VALID [2019-02-28 13:05:05,959 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 [2019-02-28 13:05:05,963 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 [2019-02-28 13:05:05,971 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 [2019-02-28 13:05:05,972 INFO L273 TraceCheckUtils]: 0: Hoare triple {107#true} i := 0;assume j == i; {116#(<= i 0)} is VALID [2019-02-28 13:05:05,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 13:05:05,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 13:05:05,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2019-02-28 13:05:05,994 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 13:05:05,995 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-28 13:05:05,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:05:05,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2019-02-28 13:05:06,024 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:05:06,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 13:05:06,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 13:05:06,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-02-28 13:05:06,026 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 10 states. [2019-02-28 13:05:06,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:06,265 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-02-28 13:05:06,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 13:05:06,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-28 13:05:06,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:05:06,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-28 13:05:06,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-02-28 13:05:06,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-28 13:05:06,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-02-28 13:05:06,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 9 transitions. [2019-02-28 13:05:06,312 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:05:06,312 INFO L225 Difference]: With dead ends: 9 [2019-02-28 13:05:06,313 INFO L226 Difference]: Without dead ends: 7 [2019-02-28 13:05:06,313 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 [2019-02-28 13:05:06,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-28 13:05:06,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-28 13:05:06,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:05:06,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2019-02-28 13:05:06,331 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-02-28 13:05:06,331 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-02-28 13:05:06,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:06,332 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-02-28 13:05:06,333 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-28 13:05:06,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:06,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:05:06,333 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-02-28 13:05:06,333 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-02-28 13:05:06,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:06,334 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-02-28 13:05:06,335 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-28 13:05:06,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:06,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:05:06,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:05:06,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:05:06,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-28 13:05:06,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-02-28 13:05:06,336 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-02-28 13:05:06,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:05:06,336 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-02-28 13:05:06,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 13:05:06,337 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-28 13:05:06,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 13:05:06,337 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:05:06,337 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-02-28 13:05:06,337 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:05:06,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:05:06,338 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2019-02-28 13:05:06,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:05:06,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:05:06,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 13:05:06,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:05:06,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:05:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:06,772 INFO L273 TraceCheckUtils]: 0: Hoare triple {186#true} i := 0;assume j == i; {188#(= i 0)} is VALID [2019-02-28 13:05:06,773 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 [2019-02-28 13:05:06,779 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 [2019-02-28 13:05:06,780 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 [2019-02-28 13:05:06,782 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 [2019-02-28 13:05:06,783 INFO L273 TraceCheckUtils]: 5: Hoare triple {192#(= 0 (select a r))} assume !(a[r] == 0); {187#false} is VALID [2019-02-28 13:05:06,784 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:05:06,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:05:06,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:05:06,784 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 13:05:06,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 13:05:06,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:05:06,784 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 [2019-02-28 13:05:06,795 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 13:05:06,795 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 13:05:06,800 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 13:05:06,800 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 13:05:06,801 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-28 13:05:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:06,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:05:06,858 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 13:05:06,862 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:05:06,874 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 13:05:06,875 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-02-28 13:05:06,877 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:05:06,877 WARN L398 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))) [2019-02-28 13:05:06,877 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_11]. (and (= 0 (select a v_i_11)) (<= v_i_11 0) (<= i (+ v_i_11 1))) [2019-02-28 13:05:06,936 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 14 [2019-02-28 13:05:06,938 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:05:06,978 INFO L315 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. [2019-02-28 13:05:06,979 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-02-28 13:05:06,988 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:05:06,988 WARN L398 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))) [2019-02-28 13:05:06,988 WARN L399 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))) [2019-02-28 13:05:07,134 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 17 treesize of output 22 [2019-02-28 13:05:07,138 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:05:07,159 INFO L315 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. [2019-02-28 13:05:07,160 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-02-28 13:05:07,172 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:05:07,172 WARN L398 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)) [2019-02-28 13:05:07,172 WARN L399 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))) [2019-02-28 13:05:07,272 INFO L273 TraceCheckUtils]: 0: Hoare triple {186#true} i := 0;assume j == i; {196#(<= i 0)} is VALID [2019-02-28 13:05:07,273 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 [2019-02-28 13:05:07,293 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 [2019-02-28 13:05:07,307 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 [2019-02-28 13:05:07,316 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 [2019-02-28 13:05:07,330 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 [2019-02-28 13:05:07,331 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:05:07,331 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:05:07,517 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-02-28 13:05:07,522 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:05:07,523 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:05:07,532 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:05:07,532 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-02-28 13:05:07,541 INFO L273 TraceCheckUtils]: 5: Hoare triple {192#(= 0 (select a r))} assume !(a[r] == 0); {187#false} is VALID [2019-02-28 13:05:07,543 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 [2019-02-28 13:05:07,544 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 [2019-02-28 13:05:07,545 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 [2019-02-28 13:05:07,546 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 [2019-02-28 13:05:07,566 INFO L273 TraceCheckUtils]: 0: Hoare triple {186#true} i := 0;assume j == i; {196#(<= i 0)} is VALID [2019-02-28 13:05:07,566 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-28 13:05:07,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 13:05:07,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 3] total 11 [2019-02-28 13:05:07,592 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 13:05:07,593 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-28 13:05:07,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:05:07,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2019-02-28 13:05:07,624 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:05:07,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 13:05:07,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 13:05:07,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-02-28 13:05:07,626 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 12 states. [2019-02-28 13:05:07,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:07,858 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-02-28 13:05:07,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 13:05:07,858 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-28 13:05:07,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:05:07,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-28 13:05:07,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-02-28 13:05:07,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-28 13:05:07,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-02-28 13:05:07,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 10 transitions. [2019-02-28 13:05:07,874 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:05:07,874 INFO L225 Difference]: With dead ends: 10 [2019-02-28 13:05:07,874 INFO L226 Difference]: Without dead ends: 8 [2019-02-28 13:05:07,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-02-28 13:05:07,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-28 13:05:07,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-02-28 13:05:07,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:05:07,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2019-02-28 13:05:07,888 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-02-28 13:05:07,889 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-02-28 13:05:07,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:07,889 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-28 13:05:07,889 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-28 13:05:07,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:07,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:05:07,890 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-02-28 13:05:07,890 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-02-28 13:05:07,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:07,891 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-28 13:05:07,891 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-28 13:05:07,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:07,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:05:07,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:05:07,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:05:07,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 13:05:07,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-02-28 13:05:07,892 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-02-28 13:05:07,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:05:07,893 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-02-28 13:05:07,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 13:05:07,893 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-28 13:05:07,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 13:05:07,893 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:05:07,894 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-02-28 13:05:07,894 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:05:07,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:05:07,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2019-02-28 13:05:07,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:05:07,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:05:07,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 13:05:07,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:05:07,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:05:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:08,613 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2019-02-28 13:05:08,648 INFO L273 TraceCheckUtils]: 0: Hoare triple {279#true} i := 0;assume j == i; {281#(= 0 i)} is VALID [2019-02-28 13:05:08,649 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 [2019-02-28 13:05:08,650 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 [2019-02-28 13:05:08,652 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 [2019-02-28 13:05:08,658 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 [2019-02-28 13:05:08,659 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 [2019-02-28 13:05:08,659 INFO L273 TraceCheckUtils]: 6: Hoare triple {286#(= 0 (select a r))} assume !(a[r] == 0); {280#false} is VALID [2019-02-28 13:05:08,660 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:05:08,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:05:08,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:05:08,660 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 13:05:08,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 13:05:08,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:05:08,660 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 [2019-02-28 13:05:08,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:05:08,671 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 13:05:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:08,677 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-28 13:05:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:08,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:05:08,737 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 13:05:08,741 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:05:08,754 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 13:05:08,754 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-02-28 13:05:08,757 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:05:08,758 WARN L398 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))) [2019-02-28 13:05:08,758 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_17]. (and (<= v_i_17 0) (= (select a v_i_17) 0) (<= i (+ v_i_17 1))) [2019-02-28 13:05:08,803 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 14 [2019-02-28 13:05:08,806 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:05:08,819 INFO L315 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. [2019-02-28 13:05:08,820 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-02-28 13:05:08,827 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:05:08,827 WARN L398 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)) [2019-02-28 13:05:08,827 WARN L399 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))) [2019-02-28 13:05:08,909 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 17 treesize of output 22 [2019-02-28 13:05:08,914 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:05:08,931 INFO L315 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. [2019-02-28 13:05:08,931 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-02-28 13:05:08,949 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:05:08,950 WARN L398 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)) [2019-02-28 13:05:08,950 WARN L399 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)) [2019-02-28 13:05:09,043 INFO L442 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 3 new quantified variables, introduced 9 case distinctions, treesize of input 22 treesize of output 30 [2019-02-28 13:05:09,047 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:05:09,073 INFO L315 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. [2019-02-28 13:05:09,073 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-02-28 13:05:09,169 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:05:09,170 WARN L398 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)) [2019-02-28 13:05:09,170 WARN L399 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))) [2019-02-28 13:05:09,308 INFO L273 TraceCheckUtils]: 0: Hoare triple {279#true} i := 0;assume j == i; {290#(<= i 0)} is VALID [2019-02-28 13:05:09,310 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 [2019-02-28 13:05:09,312 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 [2019-02-28 13:05:09,315 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 [2019-02-28 13:05:09,324 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 [2019-02-28 13:05:09,329 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 [2019-02-28 13:05:09,331 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 [2019-02-28 13:05:09,331 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:05:09,332 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:05:09,604 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-02-28 13:05:09,605 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:05:09,606 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:05:09,616 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:05:09,617 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-02-28 13:05:09,685 INFO L273 TraceCheckUtils]: 6: Hoare triple {286#(= 0 (select a r))} assume !(a[r] == 0); {280#false} is VALID [2019-02-28 13:05:09,688 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 [2019-02-28 13:05:09,690 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 [2019-02-28 13:05:09,691 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 [2019-02-28 13:05:09,692 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 [2019-02-28 13:05:09,693 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 [2019-02-28 13:05:09,693 INFO L273 TraceCheckUtils]: 0: Hoare triple {279#true} i := 0;assume j == i; {290#(<= i 0)} is VALID [2019-02-28 13:05:09,694 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-28 13:05:09,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 13:05:09,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 3] total 13 [2019-02-28 13:05:09,713 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 13:05:09,713 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-02-28 13:05:09,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:05:09,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2019-02-28 13:05:09,747 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:05:09,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-28 13:05:09,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-28 13:05:09,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-02-28 13:05:09,748 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 14 states. [2019-02-28 13:05:10,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:10,134 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-02-28 13:05:10,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 13:05:10,134 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-02-28 13:05:10,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:05:10,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-28 13:05:10,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-02-28 13:05:10,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-28 13:05:10,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-02-28 13:05:10,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 11 transitions. [2019-02-28 13:05:10,157 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:05:10,158 INFO L225 Difference]: With dead ends: 11 [2019-02-28 13:05:10,158 INFO L226 Difference]: Without dead ends: 9 [2019-02-28 13:05:10,158 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 [2019-02-28 13:05:10,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-28 13:05:10,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-28 13:05:10,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:05:10,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 9 states. [2019-02-28 13:05:10,178 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2019-02-28 13:05:10,178 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2019-02-28 13:05:10,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:10,179 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-02-28 13:05:10,179 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-02-28 13:05:10,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:10,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:05:10,180 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2019-02-28 13:05:10,180 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2019-02-28 13:05:10,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:10,181 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-02-28 13:05:10,181 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-02-28 13:05:10,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:10,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:05:10,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:05:10,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:05:10,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-28 13:05:10,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-02-28 13:05:10,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-02-28 13:05:10,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:05:10,183 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-02-28 13:05:10,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-28 13:05:10,183 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-02-28 13:05:10,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 13:05:10,184 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:05:10,184 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-02-28 13:05:10,184 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:05:10,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:05:10,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2019-02-28 13:05:10,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:05:10,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:05:10,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:05:10,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:05:10,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:05:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:10,944 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 30 [2019-02-28 13:05:11,067 INFO L273 TraceCheckUtils]: 0: Hoare triple {388#true} i := 0;assume j == i; {390#(= i 0)} is VALID [2019-02-28 13:05:11,068 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 [2019-02-28 13:05:11,069 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 [2019-02-28 13:05:11,073 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 [2019-02-28 13:05:11,074 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 [2019-02-28 13:05:11,076 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 [2019-02-28 13:05:11,077 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 [2019-02-28 13:05:11,077 INFO L273 TraceCheckUtils]: 7: Hoare triple {396#(= 0 (select a r))} assume !(a[r] == 0); {389#false} is VALID [2019-02-28 13:05:11,078 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:05:11,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:05:11,079 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:05:11,079 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 13:05:11,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 13:05:11,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:05:11,080 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 [2019-02-28 13:05:11,096 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 13:05:11,096 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 13:05:11,107 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-28 13:05:11,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 13:05:11,108 WARN L254 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-28 13:05:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:11,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:05:11,157 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 13:05:11,159 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:05:11,167 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 13:05:11,168 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-02-28 13:05:11,170 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:05:11,170 WARN L398 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)) [2019-02-28 13:05:11,170 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_25]. (and (<= i (+ v_i_25 1)) (= (select a v_i_25) 0) (<= v_i_25 0)) [2019-02-28 13:05:11,219 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 14 [2019-02-28 13:05:11,226 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:05:11,236 INFO L315 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. [2019-02-28 13:05:11,237 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-02-28 13:05:11,242 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:05:11,242 WARN L398 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))) [2019-02-28 13:05:11,242 WARN L399 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))) [2019-02-28 13:05:11,428 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 17 treesize of output 22 [2019-02-28 13:05:11,434 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:05:11,449 INFO L315 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. [2019-02-28 13:05:11,449 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-02-28 13:05:11,455 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:05:11,456 WARN L398 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))) [2019-02-28 13:05:11,456 WARN L399 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))) [2019-02-28 13:05:11,666 INFO L442 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 3 new quantified variables, introduced 9 case distinctions, treesize of input 22 treesize of output 30 [2019-02-28 13:05:11,674 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:05:11,713 INFO L315 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. [2019-02-28 13:05:11,713 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-02-28 13:05:11,813 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:05:11,813 WARN L398 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)) [2019-02-28 13:05:11,813 WARN L399 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)) [2019-02-28 13:05:12,086 INFO L442 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 4 new quantified variables, introduced 14 case distinctions, treesize of input 27 treesize of output 38 [2019-02-28 13:05:12,092 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:05:12,123 INFO L315 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. [2019-02-28 13:05:12,123 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-02-28 13:05:14,560 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:05:14,561 WARN L398 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))) [2019-02-28 13:05:14,561 WARN L399 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)) [2019-02-28 13:05:15,105 INFO L273 TraceCheckUtils]: 0: Hoare triple {388#true} i := 0;assume j == i; {400#(<= i 0)} is VALID [2019-02-28 13:05:15,106 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 [2019-02-28 13:05:15,108 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 [2019-02-28 13:05:15,112 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 [2019-02-28 13:05:15,120 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 [2019-02-28 13:05:15,206 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 [2019-02-28 13:05:15,243 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 [2019-02-28 13:05:15,246 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 [2019-02-28 13:05:15,247 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:05:15,247 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:05:17,189 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-02-28 13:05:17,194 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:05:17,199 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:05:17,206 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:05:17,206 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-02-28 13:05:17,217 INFO L273 TraceCheckUtils]: 7: Hoare triple {396#(= 0 (select a r))} assume !(a[r] == 0); {389#false} is VALID [2019-02-28 13:05:17,218 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 [2019-02-28 13:05:17,219 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 [2019-02-28 13:05:17,220 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 [2019-02-28 13:05:17,221 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 [2019-02-28 13:05:17,223 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 [2019-02-28 13:05:17,224 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 [2019-02-28 13:05:17,225 INFO L273 TraceCheckUtils]: 0: Hoare triple {388#true} i := 0;assume j == i; {400#(<= i 0)} is VALID [2019-02-28 13:05:17,225 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-28 13:05:17,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 13:05:17,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 3] total 15 [2019-02-28 13:05:17,246 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 13:05:17,246 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 8 [2019-02-28 13:05:17,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:05:17,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2019-02-28 13:05:17,450 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:05:17,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-28 13:05:17,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-28 13:05:17,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2019-02-28 13:05:17,451 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 16 states. [2019-02-28 13:05:18,507 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-02-28 13:05:18,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:18,541 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-02-28 13:05:18,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 13:05:18,541 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 8 [2019-02-28 13:05:18,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:05:18,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-28 13:05:18,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2019-02-28 13:05:18,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-28 13:05:18,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2019-02-28 13:05:18,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 12 transitions. [2019-02-28 13:05:18,607 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:05:18,607 INFO L225 Difference]: With dead ends: 12 [2019-02-28 13:05:18,608 INFO L226 Difference]: Without dead ends: 10 [2019-02-28 13:05:18,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-02-28 13:05:18,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-28 13:05:18,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-02-28 13:05:18,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:05:18,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 10 states. [2019-02-28 13:05:18,663 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2019-02-28 13:05:18,663 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2019-02-28 13:05:18,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:18,665 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-02-28 13:05:18,665 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-02-28 13:05:18,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:18,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:05:18,665 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2019-02-28 13:05:18,665 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2019-02-28 13:05:18,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:18,666 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-02-28 13:05:18,666 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-02-28 13:05:18,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:18,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:05:18,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:05:18,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:05:18,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-28 13:05:18,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-02-28 13:05:18,669 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-02-28 13:05:18,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:05:18,670 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-02-28 13:05:18,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-28 13:05:18,670 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-02-28 13:05:18,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 13:05:18,670 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:05:18,670 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-02-28 13:05:18,670 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:05:18,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:05:18,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2019-02-28 13:05:18,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:05:18,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:05:18,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 13:05:18,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:05:18,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:05:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:19,269 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 29 [2019-02-28 13:05:19,583 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 37 [2019-02-28 13:05:19,615 INFO L273 TraceCheckUtils]: 0: Hoare triple {509#true} i := 0;assume j == i; {511#(= i 0)} is VALID [2019-02-28 13:05:19,616 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 [2019-02-28 13:05:19,617 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 [2019-02-28 13:05:19,618 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 [2019-02-28 13:05:19,619 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 [2019-02-28 13:05:19,621 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 [2019-02-28 13:05:19,623 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 [2019-02-28 13:05:19,626 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 [2019-02-28 13:05:19,626 INFO L273 TraceCheckUtils]: 8: Hoare triple {518#(= 0 (select a r))} assume !(a[r] == 0); {510#false} is VALID [2019-02-28 13:05:19,627 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:05:19,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:05:19,627 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:05:19,627 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 13:05:19,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 13:05:19,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:05:19,628 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 [2019-02-28 13:05:19,639 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 13:05:19,639 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 13:05:19,657 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 13:05:19,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 13:05:19,658 WARN L254 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-28 13:05:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:19,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:05:19,708 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 13:05:19,710 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:05:19,717 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 13:05:19,717 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-02-28 13:05:19,721 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:05:19,721 WARN L398 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)) [2019-02-28 13:05:19,721 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_35]. (and (<= i (+ v_i_35 1)) (= (select a v_i_35) 0) (<= v_i_35 0)) [2019-02-28 13:05:19,767 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 14 [2019-02-28 13:05:19,769 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:05:19,782 INFO L315 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. [2019-02-28 13:05:19,782 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-02-28 13:05:19,787 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:05:19,787 WARN L398 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))) [2019-02-28 13:05:19,787 WARN L399 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)) [2019-02-28 13:05:19,851 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 17 treesize of output 22 [2019-02-28 13:05:19,854 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:05:19,881 INFO L315 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. [2019-02-28 13:05:19,881 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-02-28 13:05:19,888 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:05:19,889 WARN L398 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))) [2019-02-28 13:05:19,889 WARN L399 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)) [2019-02-28 13:05:20,034 INFO L442 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 3 new quantified variables, introduced 9 case distinctions, treesize of input 22 treesize of output 30 [2019-02-28 13:05:20,037 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:05:20,065 INFO L315 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. [2019-02-28 13:05:20,065 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-02-28 13:05:20,091 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:05:20,091 WARN L398 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))) [2019-02-28 13:05:20,091 WARN L399 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)) [2019-02-28 13:05:20,245 INFO L442 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 4 new quantified variables, introduced 14 case distinctions, treesize of input 27 treesize of output 38 [2019-02-28 13:05:20,250 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:05:20,284 INFO L315 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. [2019-02-28 13:05:20,285 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-02-28 13:05:21,930 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:05:21,931 WARN L398 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))) [2019-02-28 13:05:21,931 WARN L399 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)) [2019-02-28 13:05:22,426 INFO L442 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 5 new quantified variables, introduced 20 case distinctions, treesize of input 32 treesize of output 46 [2019-02-28 13:05:22,431 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:05:22,465 INFO L315 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. [2019-02-28 13:05:22,466 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2019-02-28 13:05:58,711 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:05:58,712 WARN L398 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)) [2019-02-28 13:05:58,712 WARN L399 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)) [2019-02-28 13:06:03,759 INFO L273 TraceCheckUtils]: 0: Hoare triple {509#true} i := 0;assume j == i; {522#(<= i 0)} is VALID [2019-02-28 13:06:03,761 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 [2019-02-28 13:06:03,764 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 [2019-02-28 13:06:03,767 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 [2019-02-28 13:06:03,780 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 [2019-02-28 13:06:04,000 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 [2019-02-28 13:06:05,910 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 [2019-02-28 13:06:06,576 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 [2019-02-28 13:06:06,585 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 [2019-02-28 13:06:06,586 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:06:06,587 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:06:14,151 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-02-28 13:06:14,152 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:06:14,155 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:06:14,164 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:06:14,165 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-02-28 13:06:14,168 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:06:14,168 WARN L398 uantifierElimination]: Input elimination task: ∀ [a, r]. (or (< i r) (= (select (store a i 0) r) 0) (< r 0)) [2019-02-28 13:06:14,168 WARN L399 uantifierElimination]: ElimStorePlain result: ∀ []. (or (< i 0) (< i 1)) [2019-02-28 13:06:14,179 INFO L273 TraceCheckUtils]: 8: Hoare triple {518#(= 0 (select a r))} assume !(a[r] == 0); {510#false} is VALID [2019-02-28 13:06:14,180 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 [2019-02-28 13:06:14,181 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 [2019-02-28 13:06:14,182 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 [2019-02-28 13:06:14,183 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 [2019-02-28 13:06:14,185 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 [2019-02-28 13:06:14,186 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 [2019-02-28 13:06:14,187 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 [2019-02-28 13:06:14,188 INFO L273 TraceCheckUtils]: 0: Hoare triple {509#true} i := 0;assume j == i; {522#(<= i 0)} is VALID [2019-02-28 13:06:14,189 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-28 13:06:14,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 13:06:14,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 3] total 17 [2019-02-28 13:06:14,209 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 13:06:14,209 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 9 [2019-02-28 13:06:14,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:06:14,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2019-02-28 13:06:17,276 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:06:17,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-28 13:06:17,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-28 13:06:17,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=246, Unknown=2, NotChecked=0, Total=342 [2019-02-28 13:06:17,277 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 18 states. [2019-02-28 13:06:17,900 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 29 [2019-02-28 13:06:27,637 WARN L181 SmtUtils]: Spent 796.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-02-28 13:06:27,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:06:27,685 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-02-28 13:06:27,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 13:06:27,686 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 9 [2019-02-28 13:06:27,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:06:27,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-28 13:06:27,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-02-28 13:06:27,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-28 13:06:27,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-02-28 13:06:27,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 13 transitions. [2019-02-28 13:06:28,294 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:06:28,295 INFO L225 Difference]: With dead ends: 13 [2019-02-28 13:06:28,295 INFO L226 Difference]: Without dead ends: 11 [2019-02-28 13:06:28,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=112, Invalid=306, Unknown=2, NotChecked=0, Total=420 [2019-02-28 13:06:28,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-28 13:06:28,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-28 13:06:28,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:06:28,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 11 states. [2019-02-28 13:06:28,337 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2019-02-28 13:06:28,337 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2019-02-28 13:06:28,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:06:28,338 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-02-28 13:06:28,338 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-02-28 13:06:28,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:06:28,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:06:28,339 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2019-02-28 13:06:28,340 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2019-02-28 13:06:28,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:06:28,341 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-02-28 13:06:28,341 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-02-28 13:06:28,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:06:28,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:06:28,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:06:28,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:06:28,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-28 13:06:28,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-02-28 13:06:28,342 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-02-28 13:06:28,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:06:28,342 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-02-28 13:06:28,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-28 13:06:28,343 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-02-28 13:06:28,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-28 13:06:28,343 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:06:28,343 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-02-28 13:06:28,343 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:06:28,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:06:28,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2019-02-28 13:06:28,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:06:28,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:06:28,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 13:06:28,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:06:28,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:06:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:06:29,310 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 30 [2019-02-28 13:06:29,589 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 49 [2019-02-28 13:06:29,993 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 52 [2019-02-28 13:06:30,034 INFO L273 TraceCheckUtils]: 0: Hoare triple {644#true} i := 0;assume j == i; {646#(= 0 i)} is VALID [2019-02-28 13:06:30,036 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 [2019-02-28 13:06:30,048 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 [2019-02-28 13:06:30,050 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 [2019-02-28 13:06:30,051 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 [2019-02-28 13:06:30,052 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 [2019-02-28 13:06:30,055 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 [2019-02-28 13:06:30,058 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 [2019-02-28 13:06:30,062 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 [2019-02-28 13:06:30,063 INFO L273 TraceCheckUtils]: 9: Hoare triple {654#(= 0 (select a r))} assume !(a[r] == 0); {645#false} is VALID [2019-02-28 13:06:30,064 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:06:30,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:06:30,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:06:30,065 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 13:06:30,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 13:06:30,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:06:30,065 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 [2019-02-28 13:06:30,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:06:30,073 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 13:06:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:06:30,082 WARN L254 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-28 13:06:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:06:30,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:06:30,109 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 13:06:30,111 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:06:30,119 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 13:06:30,119 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-02-28 13:06:30,122 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:06:30,122 WARN L398 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)) [2019-02-28 13:06:30,122 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_47]. (and (<= i (+ v_i_47 1)) (<= v_i_47 0) (= 0 (select a v_i_47))) [2019-02-28 13:06:30,237 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 14 [2019-02-28 13:06:30,239 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:06:30,252 INFO L315 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. [2019-02-28 13:06:30,252 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-02-28 13:06:30,257 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:06:30,257 WARN L398 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)) [2019-02-28 13:06:30,258 WARN L399 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))) [2019-02-28 13:06:30,363 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 17 treesize of output 22 [2019-02-28 13:06:30,366 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:06:30,385 INFO L315 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. [2019-02-28 13:06:30,386 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-02-28 13:06:30,401 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:06:30,401 WARN L398 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)) [2019-02-28 13:06:30,402 WARN L399 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))) [2019-02-28 13:06:30,505 INFO L442 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 3 new quantified variables, introduced 9 case distinctions, treesize of input 22 treesize of output 30 [2019-02-28 13:06:30,508 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:06:30,533 INFO L315 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. [2019-02-28 13:06:30,534 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-02-28 13:06:30,612 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:06:30,612 WARN L398 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))) [2019-02-28 13:06:30,612 WARN L399 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))) [2019-02-28 13:06:30,759 INFO L442 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 4 new quantified variables, introduced 14 case distinctions, treesize of input 27 treesize of output 38 [2019-02-28 13:06:30,763 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:06:30,799 INFO L315 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. [2019-02-28 13:06:30,800 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-02-28 13:06:32,031 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:06:32,031 WARN L398 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))) [2019-02-28 13:06:32,031 WARN L399 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))) [2019-02-28 13:06:32,645 INFO L442 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 5 new quantified variables, introduced 20 case distinctions, treesize of input 32 treesize of output 46 [2019-02-28 13:06:32,652 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:06:32,736 INFO L315 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. [2019-02-28 13:06:32,736 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2019-02-28 13:06:38,574 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:06:38,574 WARN L398 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))) [2019-02-28 13:06:38,574 WARN L399 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))) [2019-02-28 13:06:40,824 INFO L442 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 6 new quantified variables, introduced 27 case distinctions, treesize of input 37 treesize of output 54 [2019-02-28 13:06:40,831 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:06:40,871 INFO L315 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. [2019-02-28 13:06:40,872 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74