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-fa1c628-m [2019-01-31 14:31:14,743 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 14:31:14,745 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 14:31:14,763 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 14:31:14,763 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 14:31:14,764 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 14:31:14,766 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 14:31:14,769 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 14:31:14,771 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 14:31:14,772 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 14:31:14,780 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 14:31:14,781 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 14:31:14,785 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 14:31:14,786 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 14:31:14,790 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 14:31:14,791 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 14:31:14,793 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 14:31:14,796 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 14:31:14,801 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 14:31:14,803 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 14:31:14,804 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 14:31:14,807 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 14:31:14,811 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 14:31:14,811 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 14:31:14,812 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 14:31:14,813 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 14:31:14,813 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 14:31:14,817 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 14:31:14,817 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 14:31:14,820 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 14:31:14,820 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 14:31:14,821 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 14:31:14,822 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 14:31:14,822 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 14:31:14,824 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 14:31:14,824 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 14:31:14,825 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-31 14:31:14,845 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 14:31:14,846 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 14:31:14,847 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 14:31:14,847 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 14:31:14,847 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 14:31:14,847 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 14:31:14,848 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 14:31:14,850 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 14:31:14,850 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-31 14:31:14,851 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 14:31:14,851 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-31 14:31:14,851 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-31 14:31:14,851 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 14:31:14,852 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 14:31:14,852 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 14:31:14,853 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 14:31:14,853 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 14:31:14,853 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 14:31:14,853 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 14:31:14,853 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 14:31:14,854 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 14:31:14,854 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 14:31:14,854 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 14:31:14,854 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 14:31:14,854 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 14:31:14,855 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 14:31:14,856 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 14:31:14,856 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 14:31:14,857 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 14:31:14,857 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 14:31:14,857 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 14:31:14,857 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 14:31:14,858 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 14:31:14,858 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 14:31:14,858 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 14:31:14,858 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 14:31:14,858 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 14:31:14,859 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 14:31:14,859 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 14:31:14,859 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 14:31:14,889 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 14:31:14,906 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 14:31:14,913 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 14:31:14,914 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 14:31:14,915 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 14:31:14,916 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl [2019-01-31 14:31:14,916 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl' [2019-01-31 14:31:14,961 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 14:31:14,963 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 14:31:14,963 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 14:31:14,963 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 14:31:14,964 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 14:31:14,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:14" (1/1) ... [2019-01-31 14:31:14,992 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:14" (1/1) ... [2019-01-31 14:31:15,000 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-31 14:31:15,000 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-31 14:31:15,001 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-31 14:31:15,003 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 14:31:15,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 14:31:15,004 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 14:31:15,004 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 14:31:15,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:14" (1/1) ... [2019-01-31 14:31:15,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:14" (1/1) ... [2019-01-31 14:31:15,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:14" (1/1) ... [2019-01-31 14:31:15,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:14" (1/1) ... [2019-01-31 14:31:15,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:14" (1/1) ... [2019-01-31 14:31:15,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:14" (1/1) ... [2019-01-31 14:31:15,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:14" (1/1) ... [2019-01-31 14:31:15,025 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 14:31:15,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 14:31:15,026 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 14:31:15,026 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 14:31:15,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 14:31:15,094 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-01-31 14:31:15,094 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-31 14:31:15,094 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-31 14:31:15,386 INFO L278 CfgBuilder]: Using library mode [2019-01-31 14:31:15,387 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-31 14:31:15,388 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:31:15 BoogieIcfgContainer [2019-01-31 14:31:15,388 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 14:31:15,389 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 14:31:15,390 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 14:31:15,393 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 14:31:15,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:14" (1/2) ... [2019-01-31 14:31:15,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118c9bbf and model type ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 02:31:15, skipping insertion in model container [2019-01-31 14:31:15,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:31:15" (2/2) ... [2019-01-31 14:31:15,397 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit01.bpl [2019-01-31 14:31:15,407 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 14:31:15,416 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-31 14:31:15,449 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-31 14:31:15,520 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 14:31:15,520 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 14:31:15,520 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 14:31:15,521 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 14:31:15,521 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 14:31:15,521 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 14:31:15,521 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 14:31:15,521 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 14:31:15,553 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-31 14:31:15,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 14:31:15,567 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:15,568 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 14:31:15,571 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:15,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:15,578 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-01-31 14:31:15,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:15,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:15,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:15,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:15,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:15,790 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} i := 0;assume j == i; {11#(= i 0)} is VALID [2019-01-31 14:31:15,794 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(= i 0)} assume !(i < n);assume 0 <= r && r < n; {10#false} is VALID [2019-01-31 14:31:15,795 INFO L273 TraceCheckUtils]: 2: Hoare triple {10#false} assume !(a[r] == 0); {10#false} is VALID [2019-01-31 14:31:15,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:15,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:31:15,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 14:31:15,799 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:31:15,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 14:31:15,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:15,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-31 14:31:15,831 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:15,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 14:31:15,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 14:31:15,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 14:31:15,843 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-31 14:31:15,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:15,941 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-31 14:31:15,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 14:31:15,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 14:31:15,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:15,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:31:15,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-01-31 14:31:15,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:31:15,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-01-31 14:31:15,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 11 transitions. [2019-01-31 14:31:16,009 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:16,019 INFO L225 Difference]: With dead ends: 11 [2019-01-31 14:31:16,020 INFO L226 Difference]: Without dead ends: 5 [2019-01-31 14:31:16,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 14:31:16,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-31 14:31:16,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-31 14:31:16,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:16,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-01-31 14:31:16,084 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-31 14:31:16,085 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-31 14:31:16,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:16,087 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-31 14:31:16,087 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-31 14:31:16,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:16,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:16,088 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-31 14:31:16,088 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-31 14:31:16,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:16,089 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-31 14:31:16,090 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-31 14:31:16,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:16,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:16,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:16,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:16,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-31 14:31:16,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-31 14:31:16,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-31 14:31:16,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:16,094 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-31 14:31:16,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 14:31:16,095 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-31 14:31:16,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 14:31:16,095 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:16,095 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 14:31:16,096 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:16,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:16,096 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-01-31 14:31:16,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:16,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:16,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:16,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:16,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:16,641 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 7 [2019-01-31 14:31:16,652 INFO L273 TraceCheckUtils]: 0: Hoare triple {44#true} i := 0;assume j == i; {46#(= i 0)} is VALID [2019-01-31 14:31:16,659 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-01-31 14:31:16,660 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-01-31 14:31:16,678 INFO L273 TraceCheckUtils]: 3: Hoare triple {48#(and (= r 0) (= 0 (select a r)))} assume !(a[r] == 0); {45#false} is VALID [2019-01-31 14:31:16,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:16,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:16,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:31:16,681 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 14:31:16,684 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [7] [2019-01-31 14:31:16,717 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 14:31:16,717 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 14:31:17,040 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 14:31:17,042 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-01-31 14:31:17,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:17,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 14:31:17,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:17,051 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 14:31:17,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:17,062 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 14:31:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:17,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:31:17,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 14:31:17,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:17,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 14:31:17,234 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-31 14:31:17,240 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:31:17,240 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-01-31 14:31:17,241 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-01-31 14:31:17,497 INFO L273 TraceCheckUtils]: 0: Hoare triple {44#true} i := 0;assume j == i; {52#(<= i 0)} is VALID [2019-01-31 14:31:17,500 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-01-31 14:31:17,503 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-01-31 14:31:17,504 INFO L273 TraceCheckUtils]: 3: Hoare triple {48#(and (= r 0) (= 0 (select a r)))} assume !(a[r] == 0); {45#false} is VALID [2019-01-31 14:31:17,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:17,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 14:31:18,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-01-31 14:31:18,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:18,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:31:18,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-31 14:31:18,271 INFO L273 TraceCheckUtils]: 3: Hoare triple {63#(= (select a r) 0)} assume !(a[r] == 0); {45#false} is VALID [2019-01-31 14:31:18,273 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-01-31 14:31:18,276 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-01-31 14:31:18,277 INFO L273 TraceCheckUtils]: 0: Hoare triple {44#true} i := 0;assume j == i; {52#(<= i 0)} is VALID [2019-01-31 14:31:18,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:18,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 14:31:18,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-01-31 14:31:18,298 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 14:31:18,299 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2019-01-31 14:31:18,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:18,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2019-01-31 14:31:18,314 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:18,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-31 14:31:18,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-31 14:31:18,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-01-31 14:31:18,316 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 7 states. [2019-01-31 14:31:18,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:18,437 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-31 14:31:18,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 14:31:18,438 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2019-01-31 14:31:18,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:18,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-31 14:31:18,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2019-01-31 14:31:18,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-31 14:31:18,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2019-01-31 14:31:18,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 8 transitions. [2019-01-31 14:31:18,463 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:18,464 INFO L225 Difference]: With dead ends: 8 [2019-01-31 14:31:18,464 INFO L226 Difference]: Without dead ends: 6 [2019-01-31 14:31:18,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-31 14:31:18,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-31 14:31:18,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-31 14:31:18,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:18,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states. Second operand 6 states. [2019-01-31 14:31:18,470 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-01-31 14:31:18,470 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-01-31 14:31:18,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:18,472 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-01-31 14:31:18,472 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-31 14:31:18,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:18,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:18,473 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-01-31 14:31:18,473 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-01-31 14:31:18,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:18,474 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-01-31 14:31:18,474 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-31 14:31:18,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:18,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:18,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:18,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:18,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 14:31:18,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-31 14:31:18,476 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-01-31 14:31:18,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:18,476 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-31 14:31:18,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-31 14:31:18,476 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-31 14:31:18,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 14:31:18,477 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:18,477 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-31 14:31:18,477 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:18,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:18,478 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2019-01-31 14:31:18,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:18,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:18,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:18,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:18,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:18,790 INFO L273 TraceCheckUtils]: 0: Hoare triple {107#true} i := 0;assume j == i; {109#(= i 0)} is VALID [2019-01-31 14:31:18,791 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-01-31 14:31:18,793 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-01-31 14:31:18,797 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-01-31 14:31:18,798 INFO L273 TraceCheckUtils]: 4: Hoare triple {112#(= 0 (select a r))} assume !(a[r] == 0); {108#false} is VALID [2019-01-31 14:31:18,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:18,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:18,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:31:18,799 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 14:31:18,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 14:31:18,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:18,799 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-01-31 14:31:18,810 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 14:31:18,810 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 14:31:18,820 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-31 14:31:18,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 14:31:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:18,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:31:18,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 14:31:18,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:18,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 14:31:18,870 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-31 14:31:18,873 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:31:18,873 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-01-31 14:31:18,873 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-01-31 14:31:18,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-31 14:31:18,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:18,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 14:31:18,987 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-01-31 14:31:18,990 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:31:18,990 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-01-31 14:31:18,991 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-01-31 14:31:19,124 INFO L273 TraceCheckUtils]: 0: Hoare triple {107#true} i := 0;assume j == i; {116#(<= i 0)} is VALID [2019-01-31 14:31:19,126 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-01-31 14:31:19,135 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-01-31 14:31:19,137 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-01-31 14:31:19,138 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-01-31 14:31:19,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:19,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 14:31:19,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-01-31 14:31:19,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:19,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:31:19,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-31 14:31:19,356 INFO L273 TraceCheckUtils]: 4: Hoare triple {112#(= 0 (select a r))} assume !(a[r] == 0); {108#false} is VALID [2019-01-31 14:31:19,358 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-01-31 14:31:19,359 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-01-31 14:31:19,360 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-01-31 14:31:19,361 INFO L273 TraceCheckUtils]: 0: Hoare triple {107#true} i := 0;assume j == i; {116#(<= i 0)} is VALID [2019-01-31 14:31:19,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 14:31:19,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 14:31:19,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2019-01-31 14:31:19,381 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 14:31:19,382 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 14:31:19,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:19,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2019-01-31 14:31:19,403 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:19,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 14:31:19,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 14:31:19,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-01-31 14:31:19,404 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 10 states. [2019-01-31 14:31:19,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:19,625 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-01-31 14:31:19,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 14:31:19,626 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 14:31:19,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:19,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-31 14:31:19,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-01-31 14:31:19,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-31 14:31:19,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-01-31 14:31:19,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 9 transitions. [2019-01-31 14:31:19,675 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:19,677 INFO L225 Difference]: With dead ends: 9 [2019-01-31 14:31:19,677 INFO L226 Difference]: Without dead ends: 7 [2019-01-31 14:31:19,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-01-31 14:31:19,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-31 14:31:19,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-31 14:31:19,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:19,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2019-01-31 14:31:19,689 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-01-31 14:31:19,689 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-01-31 14:31:19,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:19,691 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-01-31 14:31:19,691 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-31 14:31:19,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:19,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:19,691 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-01-31 14:31:19,692 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-01-31 14:31:19,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:19,693 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-01-31 14:31:19,693 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-31 14:31:19,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:19,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:19,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:19,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:19,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-31 14:31:19,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-01-31 14:31:19,695 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-01-31 14:31:19,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:19,695 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-31 14:31:19,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 14:31:19,695 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-31 14:31:19,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 14:31:19,696 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:19,696 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-31 14:31:19,696 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:19,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:19,697 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2019-01-31 14:31:19,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:19,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:19,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 14:31:19,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:19,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:20,040 INFO L273 TraceCheckUtils]: 0: Hoare triple {186#true} i := 0;assume j == i; {188#(= i 0)} is VALID [2019-01-31 14:31:20,044 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-01-31 14:31:20,045 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-01-31 14:31:20,046 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-01-31 14:31:20,047 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-01-31 14:31:20,049 INFO L273 TraceCheckUtils]: 5: Hoare triple {192#(= 0 (select a r))} assume !(a[r] == 0); {187#false} is VALID [2019-01-31 14:31:20,050 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:20,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:20,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:31:20,051 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 14:31:20,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 14:31:20,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:20,051 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-01-31 14:31:20,065 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 14:31:20,065 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 14:31:20,075 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 14:31:20,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 14:31:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:20,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:31:20,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 14:31:20,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:20,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 14:31:20,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-31 14:31:20,141 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:31:20,141 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-01-31 14:31:20,141 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-01-31 14:31:20,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-31 14:31:20,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:20,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 14:31:20,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-01-31 14:31:20,312 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:31:20,312 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-01-31 14:31:20,313 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-01-31 14:31:20,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-01-31 14:31:20,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:20,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 14:31:20,408 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-01-31 14:31:20,419 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:31:20,420 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-01-31 14:31:20,420 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-01-31 14:31:20,590 INFO L273 TraceCheckUtils]: 0: Hoare triple {186#true} i := 0;assume j == i; {196#(<= i 0)} is VALID [2019-01-31 14:31:20,595 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-01-31 14:31:20,597 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-01-31 14:31:20,598 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-01-31 14:31:20,600 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-01-31 14:31:20,601 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-01-31 14:31:20,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:20,602 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 14:31:20,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-01-31 14:31:20,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:20,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:31:20,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-31 14:31:20,820 INFO L273 TraceCheckUtils]: 5: Hoare triple {192#(= 0 (select a r))} assume !(a[r] == 0); {187#false} is VALID [2019-01-31 14:31:20,821 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-01-31 14:31:20,822 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-01-31 14:31:20,823 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-01-31 14:31:20,827 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-01-31 14:31:20,827 INFO L273 TraceCheckUtils]: 0: Hoare triple {186#true} i := 0;assume j == i; {196#(<= i 0)} is VALID [2019-01-31 14:31:20,828 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-31 14:31:20,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 14:31:20,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 3] total 11 [2019-01-31 14:31:20,849 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 14:31:20,849 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 14:31:20,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:20,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2019-01-31 14:31:20,871 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:20,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 14:31:20,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 14:31:20,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-01-31 14:31:20,872 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 12 states. [2019-01-31 14:31:21,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:21,161 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-01-31 14:31:21,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 14:31:21,161 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 14:31:21,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:21,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-31 14:31:21,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-31 14:31:21,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-31 14:31:21,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-31 14:31:21,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 10 transitions. [2019-01-31 14:31:21,183 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:21,184 INFO L225 Difference]: With dead ends: 10 [2019-01-31 14:31:21,184 INFO L226 Difference]: Without dead ends: 8 [2019-01-31 14:31:21,185 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-01-31 14:31:21,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-31 14:31:21,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-31 14:31:21,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:21,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2019-01-31 14:31:21,197 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-01-31 14:31:21,198 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-01-31 14:31:21,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:21,199 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-31 14:31:21,199 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-31 14:31:21,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:21,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:21,200 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-01-31 14:31:21,200 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-01-31 14:31:21,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:21,201 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-31 14:31:21,202 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-31 14:31:21,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:21,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:21,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:21,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:21,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-31 14:31:21,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-31 14:31:21,203 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-01-31 14:31:21,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:21,204 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-31 14:31:21,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 14:31:21,204 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-31 14:31:21,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 14:31:21,204 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:21,204 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-01-31 14:31:21,205 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:21,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:21,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2019-01-31 14:31:21,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:21,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:21,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 14:31:21,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:21,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:21,888 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2019-01-31 14:31:21,923 INFO L273 TraceCheckUtils]: 0: Hoare triple {279#true} i := 0;assume j == i; {281#(= 0 i)} is VALID [2019-01-31 14:31:21,924 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-01-31 14:31:21,926 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-01-31 14:31:21,927 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-01-31 14:31:21,933 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-01-31 14:31:21,934 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-01-31 14:31:21,935 INFO L273 TraceCheckUtils]: 6: Hoare triple {286#(= 0 (select a r))} assume !(a[r] == 0); {280#false} is VALID [2019-01-31 14:31:21,935 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:21,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:21,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:31:21,936 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 14:31:21,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 14:31:21,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:21,936 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-01-31 14:31:21,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:21,946 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 14:31:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:21,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:21,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:31:21,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 14:31:21,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:22,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 14:31:22,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-31 14:31:22,014 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:31:22,014 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-01-31 14:31:22,014 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-01-31 14:31:22,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-31 14:31:22,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:22,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 14:31:22,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-01-31 14:31:22,082 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:31:22,082 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-01-31 14:31:22,083 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-01-31 14:31:22,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-01-31 14:31:22,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:22,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 14:31:22,172 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-01-31 14:31:22,186 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:31:22,186 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-01-31 14:31:22,187 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-01-31 14:31:22,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-01-31 14:31:22,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:22,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 14:31:22,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-01-31 14:31:22,341 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:31:22,342 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-01-31 14:31:22,342 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-01-31 14:31:22,489 INFO L273 TraceCheckUtils]: 0: Hoare triple {279#true} i := 0;assume j == i; {290#(<= i 0)} is VALID [2019-01-31 14:31:22,490 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-01-31 14:31:22,492 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-01-31 14:31:22,496 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-01-31 14:31:22,504 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-01-31 14:31:22,509 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-01-31 14:31:22,511 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-01-31 14:31:22,512 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:22,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 14:31:22,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-01-31 14:31:22,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:22,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:31:22,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-31 14:31:22,815 INFO L273 TraceCheckUtils]: 6: Hoare triple {286#(= 0 (select a r))} assume !(a[r] == 0); {280#false} is VALID [2019-01-31 14:31:22,818 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-01-31 14:31:22,819 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-01-31 14:31:22,821 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-01-31 14:31:22,828 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-01-31 14:31:22,830 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-01-31 14:31:22,830 INFO L273 TraceCheckUtils]: 0: Hoare triple {279#true} i := 0;assume j == i; {290#(<= i 0)} is VALID [2019-01-31 14:31:22,831 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-31 14:31:22,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 14:31:22,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 3] total 13 [2019-01-31 14:31:22,857 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 14:31:22,858 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-31 14:31:22,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:22,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2019-01-31 14:31:22,891 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:22,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-31 14:31:22,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-31 14:31:22,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-01-31 14:31:22,892 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 14 states. [2019-01-31 14:31:23,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:23,338 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-31 14:31:23,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 14:31:23,338 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-31 14:31:23,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:23,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-31 14:31:23,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-01-31 14:31:23,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-31 14:31:23,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-01-31 14:31:23,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 11 transitions. [2019-01-31 14:31:23,361 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:23,362 INFO L225 Difference]: With dead ends: 11 [2019-01-31 14:31:23,362 INFO L226 Difference]: Without dead ends: 9 [2019-01-31 14:31:23,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-01-31 14:31:23,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-31 14:31:23,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-31 14:31:23,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:23,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 9 states. [2019-01-31 14:31:23,384 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2019-01-31 14:31:23,384 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2019-01-31 14:31:23,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:23,385 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-01-31 14:31:23,385 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-01-31 14:31:23,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:23,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:23,386 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2019-01-31 14:31:23,386 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2019-01-31 14:31:23,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:23,386 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-01-31 14:31:23,387 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-01-31 14:31:23,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:23,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:23,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:23,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:23,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-31 14:31:23,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-01-31 14:31:23,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-01-31 14:31:23,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:23,388 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-01-31 14:31:23,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-31 14:31:23,389 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-01-31 14:31:23,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 14:31:23,389 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:23,389 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-01-31 14:31:23,389 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:23,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:23,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2019-01-31 14:31:23,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:23,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:23,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:23,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:23,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:24,266 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 30 [2019-01-31 14:31:24,470 INFO L273 TraceCheckUtils]: 0: Hoare triple {388#true} i := 0;assume j == i; {390#(= i 0)} is VALID [2019-01-31 14:31:24,472 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-01-31 14:31:24,473 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-01-31 14:31:24,475 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-01-31 14:31:24,477 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-01-31 14:31:24,480 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-01-31 14:31:24,482 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-01-31 14:31:24,483 INFO L273 TraceCheckUtils]: 7: Hoare triple {396#(= 0 (select a r))} assume !(a[r] == 0); {389#false} is VALID [2019-01-31 14:31:24,484 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:24,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:24,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:31:24,485 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 14:31:24,486 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 14:31:24,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:24,486 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-01-31 14:31:24,504 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 14:31:24,504 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 14:31:24,558 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-31 14:31:24,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 14:31:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:24,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:31:24,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 14:31:24,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:24,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 14:31:24,700 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-31 14:31:24,709 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:31:24,710 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-01-31 14:31:24,710 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-01-31 14:31:24,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-31 14:31:24,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:24,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 14:31:24,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-01-31 14:31:24,884 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:31:24,884 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-01-31 14:31:24,884 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-01-31 14:31:25,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-01-31 14:31:25,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:25,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 14:31:25,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-01-31 14:31:25,057 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:31:25,058 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-01-31 14:31:25,058 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-01-31 14:31:25,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-01-31 14:31:25,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:25,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 14:31:25,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-01-31 14:31:25,374 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:31:25,374 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-01-31 14:31:25,374 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-01-31 14:31:25,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-31 14:31:25,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:25,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 14:31:25,537 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-01-31 14:31:27,533 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:31:27,534 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-01-31 14:31:27,534 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-01-31 14:31:27,964 INFO L273 TraceCheckUtils]: 0: Hoare triple {388#true} i := 0;assume j == i; {400#(<= i 0)} is VALID [2019-01-31 14:31:27,974 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-01-31 14:31:27,976 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-01-31 14:31:27,980 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-01-31 14:31:27,996 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-01-31 14:31:28,303 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-01-31 14:31:28,341 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-01-31 14:31:28,343 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-01-31 14:31:28,345 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:28,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 14:31:32,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-01-31 14:31:32,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:32,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:31:32,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-31 14:31:32,040 INFO L273 TraceCheckUtils]: 7: Hoare triple {396#(= 0 (select a r))} assume !(a[r] == 0); {389#false} is VALID [2019-01-31 14:31:32,041 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-01-31 14:31:32,042 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-01-31 14:31:32,043 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-01-31 14:31:32,045 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-01-31 14:31:32,046 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-01-31 14:31:32,048 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-01-31 14:31:32,048 INFO L273 TraceCheckUtils]: 0: Hoare triple {388#true} i := 0;assume j == i; {400#(<= i 0)} is VALID [2019-01-31 14:31:32,049 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-31 14:31:32,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 14:31:32,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 3] total 15 [2019-01-31 14:31:32,069 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 14:31:32,069 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 8 [2019-01-31 14:31:32,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:32,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2019-01-31 14:31:32,390 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:32,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-31 14:31:32,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-31 14:31:32,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=196, Unknown=1, NotChecked=0, Total=272 [2019-01-31 14:31:32,391 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 16 states. [2019-01-31 14:31:33,399 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-01-31 14:31:33,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:33,435 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-31 14:31:33,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 14:31:33,436 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 8 [2019-01-31 14:31:33,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:33,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-31 14:31:33,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2019-01-31 14:31:33,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-31 14:31:33,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2019-01-31 14:31:33,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 12 transitions. [2019-01-31 14:31:33,501 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:33,502 INFO L225 Difference]: With dead ends: 12 [2019-01-31 14:31:33,502 INFO L226 Difference]: Without dead ends: 10 [2019-01-31 14:31:33,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=92, Invalid=249, Unknown=1, NotChecked=0, Total=342 [2019-01-31 14:31:33,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-31 14:31:33,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-31 14:31:33,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:33,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 10 states. [2019-01-31 14:31:33,561 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2019-01-31 14:31:33,561 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2019-01-31 14:31:33,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:33,562 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-01-31 14:31:33,562 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-31 14:31:33,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:33,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:33,563 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2019-01-31 14:31:33,563 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2019-01-31 14:31:33,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:33,564 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-01-31 14:31:33,564 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-31 14:31:33,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:33,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:33,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:33,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:33,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-31 14:31:33,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-01-31 14:31:33,566 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-01-31 14:31:33,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:33,566 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-01-31 14:31:33,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-31 14:31:33,566 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-31 14:31:33,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 14:31:33,567 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:33,567 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-01-31 14:31:33,567 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:33,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:33,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2019-01-31 14:31:33,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:33,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:33,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 14:31:33,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:33,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:33,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:34,200 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 29 [2019-01-31 14:31:34,501 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 37 [2019-01-31 14:31:34,546 INFO L273 TraceCheckUtils]: 0: Hoare triple {509#true} i := 0;assume j == i; {511#(= i 0)} is VALID [2019-01-31 14:31:34,547 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-01-31 14:31:34,549 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-01-31 14:31:34,550 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-01-31 14:31:34,551 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-01-31 14:31:34,553 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-01-31 14:31:34,555 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-01-31 14:31:34,558 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-01-31 14:31:34,559 INFO L273 TraceCheckUtils]: 8: Hoare triple {518#(= 0 (select a r))} assume !(a[r] == 0); {510#false} is VALID [2019-01-31 14:31:34,560 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:34,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:34,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:31:34,560 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 14:31:34,560 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 14:31:34,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:34,560 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-01-31 14:31:34,570 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 14:31:34,571 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 14:31:34,593 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 14:31:34,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 14:31:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:34,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:31:34,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 14:31:34,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:34,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 14:31:34,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-31 14:31:34,661 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:31:34,661 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-01-31 14:31:34,661 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-01-31 14:31:34,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-31 14:31:34,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:34,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 14:31:34,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-01-31 14:31:34,717 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:31:34,718 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-01-31 14:31:34,718 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-01-31 14:31:34,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-01-31 14:31:34,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:34,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 14:31:34,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-01-31 14:31:34,805 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:31:34,806 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-01-31 14:31:34,806 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-01-31 14:31:34,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-01-31 14:31:34,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:34,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 14:31:34,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-01-31 14:31:35,024 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:31:35,024 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-01-31 14:31:35,024 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-01-31 14:31:35,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-31 14:31:35,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:35,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 14:31:35,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-01-31 14:31:35,743 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:31:35,744 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-01-31 14:31:35,744 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-01-31 14:31:36,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-01-31 14:31:36,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:36,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-31 14:31:36,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2019-01-31 14:31:46,595 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:31:46,595 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-01-31 14:31:46,595 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-01-31 14:31:51,477 INFO L273 TraceCheckUtils]: 0: Hoare triple {509#true} i := 0;assume j == i; {522#(<= i 0)} is VALID [2019-01-31 14:31:51,479 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-01-31 14:31:51,481 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-01-31 14:31:51,486 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-01-31 14:31:51,501 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-01-31 14:31:51,699 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-01-31 14:31:53,697 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-01-31 14:31:54,356 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-01-31 14:31:54,367 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-01-31 14:31:54,368 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:54,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 14:32:01,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-01-31 14:32:01,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:32:01,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:32:01,278 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-31 14:32:01,292 INFO L273 TraceCheckUtils]: 8: Hoare triple {518#(= 0 (select a r))} assume !(a[r] == 0); {510#false} is VALID [2019-01-31 14:32:01,293 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-01-31 14:32:01,294 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-01-31 14:32:01,296 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-01-31 14:32:01,297 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-01-31 14:32:01,298 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-01-31 14:32:01,300 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-01-31 14:32:01,301 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-01-31 14:32:01,302 INFO L273 TraceCheckUtils]: 0: Hoare triple {509#true} i := 0;assume j == i; {522#(<= i 0)} is VALID [2019-01-31 14:32:01,302 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-31 14:32:01,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 14:32:01,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 3] total 17 [2019-01-31 14:32:01,322 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 14:32:01,322 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 9 [2019-01-31 14:32:01,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:32:01,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2019-01-31 14:32:05,314 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:32:05,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-31 14:32:05,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-31 14:32:05,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-01-31 14:32:05,315 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 18 states. [2019-01-31 14:32:06,009 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 29 [2019-01-31 14:32:15,851 WARN L181 SmtUtils]: Spent 830.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-01-31 14:32:15,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:32:15,895 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-01-31 14:32:15,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 14:32:15,895 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 9 [2019-01-31 14:32:15,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:32:15,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-31 14:32:15,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-31 14:32:15,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-31 14:32:15,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-31 14:32:15,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 13 transitions. [2019-01-31 14:32:16,497 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:32:16,498 INFO L225 Difference]: With dead ends: 13 [2019-01-31 14:32:16,499 INFO L226 Difference]: Without dead ends: 11 [2019-01-31 14:32:16,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-01-31 14:32:16,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-31 14:32:16,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-31 14:32:16,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:32:16,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 11 states. [2019-01-31 14:32:16,542 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2019-01-31 14:32:16,542 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2019-01-31 14:32:16,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:32:16,544 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-31 14:32:16,544 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-31 14:32:16,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:32:16,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:32:16,545 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2019-01-31 14:32:16,545 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2019-01-31 14:32:16,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:32:16,546 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-31 14:32:16,546 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-31 14:32:16,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:32:16,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:32:16,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:32:16,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:32:16,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-31 14:32:16,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-31 14:32:16,547 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-01-31 14:32:16,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:32:16,547 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-31 14:32:16,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-31 14:32:16,547 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-31 14:32:16,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-31 14:32:16,548 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:32:16,548 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-01-31 14:32:16,548 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:32:16,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:32:16,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2019-01-31 14:32:16,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:32:16,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:32:16,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 14:32:16,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:32:16,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:32:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:32:17,255 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 30 [2019-01-31 14:32:17,605 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 49 [2019-01-31 14:32:18,094 WARN L181 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 52 [2019-01-31 14:32:18,134 INFO L273 TraceCheckUtils]: 0: Hoare triple {644#true} i := 0;assume j == i; {646#(= 0 i)} is VALID [2019-01-31 14:32:18,135 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-01-31 14:32:18,151 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-01-31 14:32:18,152 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-01-31 14:32:18,154 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-01-31 14:32:18,156 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-01-31 14:32:18,157 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-01-31 14:32:18,160 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-01-31 14:32:18,165 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-01-31 14:32:18,166 INFO L273 TraceCheckUtils]: 9: Hoare triple {654#(= 0 (select a r))} assume !(a[r] == 0); {645#false} is VALID [2019-01-31 14:32:18,167 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:32:18,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:32:18,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:32:18,167 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 14:32:18,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 14:32:18,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:32:18,167 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-01-31 14:32:18,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:32:18,177 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 14:32:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:32:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:32:18,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:32:18,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 14:32:18,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:32:18,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 14:32:18,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-31 14:32:18,248 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:32:18,248 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-01-31 14:32:18,248 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-01-31 14:32:18,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-31 14:32:18,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:32:18,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 14:32:18,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-01-31 14:32:18,399 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:32:18,399 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-01-31 14:32:18,399 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-01-31 14:32:18,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-01-31 14:32:18,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:32:18,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 14:32:18,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-01-31 14:32:18,495 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:32:18,495 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-01-31 14:32:18,495 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-01-31 14:32:18,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-01-31 14:32:18,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:32:18,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 14:32:18,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-01-31 14:32:18,715 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:32:18,715 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-01-31 14:32:18,715 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-01-31 14:32:18,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-31 14:32:18,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:32:18,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 14:32:18,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-01-31 14:32:19,797 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:32:19,798 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-01-31 14:32:19,798 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-01-31 14:32:20,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-01-31 14:32:20,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:32:20,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-31 14:32:20,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2019-01-31 14:32:30,685 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:32:30,685 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-01-31 14:32:30,685 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-01-31 14:32:33,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-01-31 14:32:33,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:32:33,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-31 14:32:33,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74 [2019-01-31 14:32:45,258 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:32:45,258 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_a_53, v_i_53, v_i_50, v_i_49, v_i_51, v_i_52, v_i_47, v_i_48]. (and (= 0 (select v_a_53 v_i_50)) (<= v_i_50 (+ v_i_49 1)) (= 0 (select v_a_53 v_i_51)) (= 0 (select v_a_53 v_i_49)) (<= v_i_52 (+ v_i_51 1)) (= 0 (select v_a_53 v_i_47)) (= 0 (select v_a_53 v_i_52)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (<= i (+ v_i_53 1)) (<= v_i_51 (+ v_i_50 1)) (<= v_i_53 (+ v_i_52 1)) (= 0 (select v_a_53 v_i_48)) (= a (store v_a_53 v_i_53 0))) [2019-01-31 14:32:45,258 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_53, v_i_50, v_i_49, v_i_52, v_i_48, v_i_51, v_i_47]. (and (= 0 (select a v_i_53)) (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_52)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50)) (= 0 (select a v_i_51)) (= 0 (select a v_i_49)) (<= v_i_52 (+ v_i_51 1)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (<= i (+ v_i_53 1)) (<= v_i_51 (+ v_i_50 1)) (<= v_i_53 (+ v_i_52 1))) [2019-01-31 14:33:40,278 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-31 14:33:40,287 INFO L273 TraceCheckUtils]: 0: Hoare triple {644#true} i := 0;assume j == i; {658#(<= i 0)} is VALID [2019-01-31 14:33:40,289 INFO L273 TraceCheckUtils]: 1: Hoare triple {658#(<= i 0)} assume i < n;a := a[i := 0];i := i + 1; {662#(exists ((v_i_47 Int)) (and (<= i (+ v_i_47 1)) (<= v_i_47 0) (= 0 (select a v_i_47))))} is VALID [2019-01-31 14:33:40,293 INFO L273 TraceCheckUtils]: 2: Hoare triple {662#(exists ((v_i_47 Int)) (and (<= i (+ v_i_47 1)) (<= v_i_47 0) (= 0 (select a v_i_47))))} assume i < n;a := a[i := 0];i := i + 1; {666#(exists ((v_i_48 Int) (v_i_47 Int)) (and (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (= 0 (select a v_i_48)) (<= i (+ v_i_48 1))))} is VALID [2019-01-31 14:33:40,298 INFO L273 TraceCheckUtils]: 3: Hoare triple {666#(exists ((v_i_48 Int) (v_i_47 Int)) (and (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (= 0 (select a v_i_48)) (<= i (+ v_i_48 1))))} assume i < n;a := a[i := 0];i := i + 1; {670#(exists ((v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (= 0 (select a v_i_49)) (<= i (+ v_i_49 1)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (= 0 (select a v_i_48))))} is VALID [2019-01-31 14:33:40,312 INFO L273 TraceCheckUtils]: 4: Hoare triple {670#(exists ((v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (= 0 (select a v_i_49)) (<= i (+ v_i_49 1)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (= 0 (select a v_i_48))))} assume i < n;a := a[i := 0];i := i + 1; {674#(exists ((v_i_50 Int) (v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (<= i (+ v_i_50 1)) (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_49)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50))))} is VALID [2019-01-31 14:33:40,410 INFO L273 TraceCheckUtils]: 5: Hoare triple {674#(exists ((v_i_50 Int) (v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (<= i (+ v_i_50 1)) (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_49)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50))))} assume i < n;a := a[i := 0];i := i + 1; {678#(exists ((v_i_51 Int) (v_i_50 Int) (v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_51)) (= 0 (select a v_i_49)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50)) (<= i (+ v_i_51 1)) (<= v_i_51 (+ v_i_50 1))))} is VALID [2019-01-31 14:33:43,177 INFO L273 TraceCheckUtils]: 6: Hoare triple {678#(exists ((v_i_51 Int) (v_i_50 Int) (v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_51)) (= 0 (select a v_i_49)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50)) (<= i (+ v_i_51 1)) (<= v_i_51 (+ v_i_50 1))))} assume i < n;a := a[i := 0];i := i + 1; {682#(exists ((v_i_51 Int) (v_i_50 Int) (v_i_52 Int) (v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_52)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50)) (= 0 (select a v_i_51)) (= 0 (select a v_i_49)) (<= v_i_52 (+ v_i_51 1)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (<= v_i_51 (+ v_i_50 1)) (<= i (+ v_i_52 1))))} is VALID [2019-01-31 14:33:53,422 INFO L273 TraceCheckUtils]: 7: Hoare triple {682#(exists ((v_i_51 Int) (v_i_50 Int) (v_i_52 Int) (v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_52)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50)) (= 0 (select a v_i_51)) (= 0 (select a v_i_49)) (<= v_i_52 (+ v_i_51 1)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (<= v_i_51 (+ v_i_50 1)) (<= i (+ v_i_52 1))))} assume i < n;a := a[i := 0];i := i + 1; {686#(exists ((v_i_51 Int) (v_i_50 Int) (v_i_53 Int) (v_i_52 Int) (v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (= 0 (select a v_i_53)) (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_52)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50)) (= 0 (select a v_i_51)) (= 0 (select a v_i_49)) (<= v_i_52 (+ v_i_51 1)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (<= i (+ v_i_53 1)) (<= v_i_53 (+ v_i_52 1)) (<= v_i_51 (+ v_i_50 1))))} is UNKNOWN [2019-01-31 14:34:05,929 INFO L273 TraceCheckUtils]: 8: Hoare triple {686#(exists ((v_i_51 Int) (v_i_50 Int) (v_i_53 Int) (v_i_52 Int) (v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (= 0 (select a v_i_53)) (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_52)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50)) (= 0 (select a v_i_51)) (= 0 (select a v_i_49)) (<= v_i_52 (+ v_i_51 1)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (<= i (+ v_i_53 1)) (<= v_i_53 (+ v_i_52 1)) (<= v_i_51 (+ v_i_50 1))))} assume !(i < n);assume 0 <= r && r < n; {690#(and (<= 0 r) (exists ((v_i_51 Int) (v_i_50 Int) (v_i_53 Int) (v_i_52 Int) (v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (= 0 (select a v_i_53)) (<= r v_i_53) (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_52)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50)) (= 0 (select a v_i_51)) (= 0 (select a v_i_49)) (<= v_i_52 (+ v_i_51 1)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (<= v_i_53 (+ v_i_52 1)) (<= v_i_51 (+ v_i_50 1)))))} is UNKNOWN [2019-01-31 14:34:06,069 INFO L273 TraceCheckUtils]: 9: Hoare triple {690#(and (<= 0 r) (exists ((v_i_51 Int) (v_i_50 Int) (v_i_53 Int) (v_i_52 Int) (v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (= 0 (select a v_i_53)) (<= r v_i_53) (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_52)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50)) (= 0 (select a v_i_51)) (= 0 (select a v_i_49)) (<= v_i_52 (+ v_i_51 1)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (<= v_i_53 (+ v_i_52 1)) (<= v_i_51 (+ v_i_50 1)))))} assume !(a[r] == 0); {645#false} is VALID [2019-01-31 14:34:06,070 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:34:06,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 14:34:19,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-01-31 14:34:19,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:34:19,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:34:19,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-31 14:34:19,906 INFO L273 TraceCheckUtils]: 9: Hoare triple {654#(= 0 (select a r))} assume !(a[r] == 0); {645#false} is VALID [2019-01-31 14:34:19,907 INFO L273 TraceCheckUtils]: 8: Hoare triple {697#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume !(i < n);assume 0 <= r && r < n; {654#(= 0 (select a r))} is VALID [2019-01-31 14:34:19,908 INFO L273 TraceCheckUtils]: 7: Hoare triple {697#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {697#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2019-01-31 14:34:19,909 INFO L273 TraceCheckUtils]: 6: Hoare triple {697#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {697#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2019-01-31 14:34:19,910 INFO L273 TraceCheckUtils]: 5: Hoare triple {697#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {697#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2019-01-31 14:34:19,911 INFO L273 TraceCheckUtils]: 4: Hoare triple {697#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {697#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2019-01-31 14:34:19,912 INFO L273 TraceCheckUtils]: 3: Hoare triple {697#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {697#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2019-01-31 14:34:19,914 INFO L273 TraceCheckUtils]: 2: Hoare triple {697#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {697#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2019-01-31 14:34:19,915 INFO L273 TraceCheckUtils]: 1: Hoare triple {658#(<= i 0)} assume i < n;a := a[i := 0];i := i + 1; {697#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2019-01-31 14:34:19,924 INFO L273 TraceCheckUtils]: 0: Hoare triple {644#true} i := 0;assume j == i; {658#(<= i 0)} is VALID [2019-01-31 14:34:19,925 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-31 14:34:19,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 14:34:19,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 3] total 19 [2019-01-31 14:34:19,943 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 14:34:19,943 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 10 [2019-01-31 14:34:19,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:34:19,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2019-01-31 14:34:48,656 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 18 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2019-01-31 14:34:48,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-31 14:34:48,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-31 14:34:48,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=309, Unknown=2, NotChecked=0, Total=420 [2019-01-31 14:34:48,657 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 20 states. [2019-01-31 14:34:59,149 WARN L181 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 111 DAG size of output: 48 [2019-01-31 14:35:56,260 WARN L181 SmtUtils]: Spent 21.26 s on a formula simplification. DAG size of input: 86 DAG size of output: 45