java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-15 11:25:27,809 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-15 11:25:27,811 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-15 11:25:27,824 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-15 11:25:27,824 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-15 11:25:27,825 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-15 11:25:27,827 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-15 11:25:27,828 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-15 11:25:27,830 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-15 11:25:27,831 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-15 11:25:27,832 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-15 11:25:27,832 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-15 11:25:27,833 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-15 11:25:27,834 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-15 11:25:27,835 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-15 11:25:27,836 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-15 11:25:27,837 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-15 11:25:27,838 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-15 11:25:27,841 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-15 11:25:27,842 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-15 11:25:27,843 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-15 11:25:27,845 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-15 11:25:27,847 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-15 11:25:27,848 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-15 11:25:27,848 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-15 11:25:27,849 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-15 11:25:27,850 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-15 11:25:27,851 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-15 11:25:27,851 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-15 11:25:27,853 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-15 11:25:27,853 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-15 11:25:27,853 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-15 11:25:27,854 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-15 11:25:27,854 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-15 11:25:27,855 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-15 11:25:27,856 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-15 11:25:27,856 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-15 11:25:27,869 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-15 11:25:27,870 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-15 11:25:27,871 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-15 11:25:27,871 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-15 11:25:27,871 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-15 11:25:27,871 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-15 11:25:27,871 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-15 11:25:27,872 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-15 11:25:27,872 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-15 11:25:27,872 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-15 11:25:27,872 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-15 11:25:27,872 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-15 11:25:27,873 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-15 11:25:27,873 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-15 11:25:27,873 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-15 11:25:27,874 INFO L133 SettingsManager]: * Use SBE=true [2019-02-15 11:25:27,874 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-15 11:25:27,874 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-15 11:25:27,874 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-15 11:25:27,874 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-15 11:25:27,875 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-15 11:25:27,875 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-15 11:25:27,875 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-15 11:25:27,875 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-15 11:25:27,875 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-15 11:25:27,875 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-15 11:25:27,876 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-15 11:25:27,876 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-15 11:25:27,876 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-15 11:25:27,876 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-15 11:25:27,876 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 11:25:27,877 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-15 11:25:27,877 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-15 11:25:27,877 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-15 11:25:27,877 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-15 11:25:27,878 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-15 11:25:27,878 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-15 11:25:27,878 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-15 11:25:27,878 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-15 11:25:27,914 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-15 11:25:27,931 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-15 11:25:27,935 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-15 11:25:27,937 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-15 11:25:27,938 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-15 11:25:27,938 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-unlimited.bpl [2019-02-15 11:25:27,939 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-unlimited.bpl' [2019-02-15 11:25:27,996 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-15 11:25:27,998 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-15 11:25:27,998 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-15 11:25:27,999 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-15 11:25:27,999 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-15 11:25:28,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:25:27" (1/1) ... [2019-02-15 11:25:28,031 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:25:27" (1/1) ... [2019-02-15 11:25:28,056 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-15 11:25:28,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-15 11:25:28,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-15 11:25:28,058 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-15 11:25:28,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:25:27" (1/1) ... [2019-02-15 11:25:28,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:25:27" (1/1) ... [2019-02-15 11:25:28,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:25:27" (1/1) ... [2019-02-15 11:25:28,071 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:25:27" (1/1) ... [2019-02-15 11:25:28,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:25:27" (1/1) ... [2019-02-15 11:25:28,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:25:27" (1/1) ... [2019-02-15 11:25:28,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:25:27" (1/1) ... [2019-02-15 11:25:28,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-15 11:25:28,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-15 11:25:28,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-15 11:25:28,094 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-15 11:25:28,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:25:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 11:25:28,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-15 11:25:28,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-15 11:25:28,706 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-15 11:25:28,706 INFO L286 CfgBuilder]: Removed 15 assue(true) statements. [2019-02-15 11:25:28,711 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:25:28 BoogieIcfgContainer [2019-02-15 11:25:28,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-15 11:25:28,712 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-15 11:25:28,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-15 11:25:28,717 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-15 11:25:28,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:25:27" (1/2) ... [2019-02-15 11:25:28,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30275dbf and model type speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:25:28, skipping insertion in model container [2019-02-15 11:25:28,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:25:28" (2/2) ... [2019-02-15 11:25:28,722 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-6-unlimited.bpl [2019-02-15 11:25:28,732 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-15 11:25:28,741 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-02-15 11:25:28,757 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-02-15 11:25:28,789 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-15 11:25:28,790 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-15 11:25:28,790 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-15 11:25:28,790 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-15 11:25:28,790 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-15 11:25:28,790 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-15 11:25:28,791 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-15 11:25:28,791 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-15 11:25:28,805 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-02-15 11:25:28,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-15 11:25:28,811 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:28,812 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-15 11:25:28,815 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:28,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:28,821 INFO L82 PathProgramCache]: Analyzing trace with hash 988, now seen corresponding path program 1 times [2019-02-15 11:25:28,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:28,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:28,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:28,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:28,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:29,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:29,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:25:29,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-15 11:25:29,020 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:25:29,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 11:25:29,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 11:25:29,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:25:29,041 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2019-02-15 11:25:29,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:29,251 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2019-02-15 11:25:29,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:25:29,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-15 11:25:29,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:29,267 INFO L225 Difference]: With dead ends: 29 [2019-02-15 11:25:29,267 INFO L226 Difference]: Without dead ends: 24 [2019-02-15 11:25:29,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:25:29,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-15 11:25:29,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 14. [2019-02-15 11:25:29,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-15 11:25:29,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2019-02-15 11:25:29,308 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 2 [2019-02-15 11:25:29,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:29,309 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2019-02-15 11:25:29,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 11:25:29,310 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2019-02-15 11:25:29,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 11:25:29,310 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:29,311 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 11:25:29,311 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:29,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:29,312 INFO L82 PathProgramCache]: Analyzing trace with hash 30376, now seen corresponding path program 1 times [2019-02-15 11:25:29,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:29,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:29,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:29,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:29,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:29,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:29,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:29,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:29,582 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 11:25:29,587 INFO L207 CegarAbsIntRunner]: [0], [18], [27] [2019-02-15 11:25:29,657 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:29,658 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:30,604 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:30,606 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:25:30,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:30,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:30,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:30,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:30,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:30,629 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:30,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:30,895 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-02-15 11:25:30,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 48 treesize of output 54 [2019-02-15 11:25:31,192 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-02-15 11:25:31,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:25:31,456 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-02-15 11:25:31,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,572 INFO L303 Elim1Store]: Index analysis took 113 ms [2019-02-15 11:25:31,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:25:31,883 WARN L181 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-02-15 11:25:31,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:25:31,904 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:31,958 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:31,997 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:32,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:32,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:25:32,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:25:32,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:25:32,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:25:32,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:25:32,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-15 11:25:32,234 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:32,338 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:32,370 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:32,389 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:32,404 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:32,490 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:32,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:32,734 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-02-15 11:25:32,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 11:25:32,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:32,918 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-02-15 11:25:32,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-02-15 11:25:33,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:33,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:33,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:33,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:33,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 11:25:33,058 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:33,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 11:25:33,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 11:25:33,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:25:33,060 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 6 states. [2019-02-15 11:25:33,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:33,467 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2019-02-15 11:25:33,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 11:25:33,468 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-15 11:25:33,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:33,469 INFO L225 Difference]: With dead ends: 47 [2019-02-15 11:25:33,470 INFO L226 Difference]: Without dead ends: 45 [2019-02-15 11:25:33,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 11:25:33,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-15 11:25:33,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 18. [2019-02-15 11:25:33,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-15 11:25:33,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 37 transitions. [2019-02-15 11:25:33,481 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 37 transitions. Word has length 3 [2019-02-15 11:25:33,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:33,481 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 37 transitions. [2019-02-15 11:25:33,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 11:25:33,481 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 37 transitions. [2019-02-15 11:25:33,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 11:25:33,482 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:33,483 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 11:25:33,483 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:33,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:33,483 INFO L82 PathProgramCache]: Analyzing trace with hash 30004, now seen corresponding path program 1 times [2019-02-15 11:25:33,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:33,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:33,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:33,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:33,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:33,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:33,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:33,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:33,583 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:33,583 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 11:25:33,583 INFO L207 CegarAbsIntRunner]: [0], [6], [27] [2019-02-15 11:25:33,586 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:33,586 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:34,043 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:34,044 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:25:34,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:34,044 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:34,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:34,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:34,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:34,065 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:34,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:34,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:34,195 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-02-15 11:25:34,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:25:34,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:25:34,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:34,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:34,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:25:34,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:34,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:34,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:34,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:25:34,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:34,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:34,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:34,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:34,473 INFO L303 Elim1Store]: Index analysis took 103 ms [2019-02-15 11:25:34,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:25:34,601 INFO L303 Elim1Store]: Index analysis took 120 ms [2019-02-15 11:25:34,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-15 11:25:34,605 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:34,681 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:34,717 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:34,736 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:34,786 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:34,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:34,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:34,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 48 treesize of output 54 [2019-02-15 11:25:34,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:34,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:34,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:25:35,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:25:35,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:25:35,088 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:35,132 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:35,152 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:35,169 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:35,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:35,206 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:72, output treesize:71 [2019-02-15 11:25:35,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:25:35,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:35,372 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-02-15 11:25:35,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-02-15 11:25:35,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:35,393 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:35,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:35,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 11:25:35,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-15 11:25:35,418 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:25:35,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:25:35,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:25:35,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-15 11:25:35,419 INFO L87 Difference]: Start difference. First operand 18 states and 37 transitions. Second operand 4 states. [2019-02-15 11:25:35,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:35,479 INFO L93 Difference]: Finished difference Result 23 states and 60 transitions. [2019-02-15 11:25:35,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 11:25:35,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-15 11:25:35,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:35,481 INFO L225 Difference]: With dead ends: 23 [2019-02-15 11:25:35,481 INFO L226 Difference]: Without dead ends: 22 [2019-02-15 11:25:35,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-15 11:25:35,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-02-15 11:25:35,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-02-15 11:25:35,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-15 11:25:35,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2019-02-15 11:25:35,489 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 59 transitions. Word has length 3 [2019-02-15 11:25:35,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:35,489 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 59 transitions. [2019-02-15 11:25:35,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:25:35,490 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 59 transitions. [2019-02-15 11:25:35,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 11:25:35,490 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:35,490 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 11:25:35,491 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:35,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:35,491 INFO L82 PathProgramCache]: Analyzing trace with hash 30562, now seen corresponding path program 1 times [2019-02-15 11:25:35,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:35,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:35,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:35,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:35,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:35,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:35,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:35,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:35,590 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 11:25:35,590 INFO L207 CegarAbsIntRunner]: [0], [24], [27] [2019-02-15 11:25:35,592 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:35,592 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:38,370 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:38,371 INFO L272 AbstractInterpreter]: Visited 3 different actions 11 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:25:38,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:38,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:38,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:38,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:38,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:38,391 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:38,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:38,546 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-02-15 11:25:38,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 68 treesize of output 71 [2019-02-15 11:25:38,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:25:38,721 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-02-15 11:25:38,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:25:38,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:25:38,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-15 11:25:38,884 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:38,910 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:38,938 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:38,968 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:39,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:39,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:25:39,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:25:39,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:25:39,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:25:39,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:25:39,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:25:39,125 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:39,175 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:39,236 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:39,250 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:39,266 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:39,279 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:39,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:39,343 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:92, output treesize:91 [2019-02-15 11:25:39,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:39,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 11:25:39,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:39,424 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-02-15 11:25:39,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-15 11:25:39,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:39,443 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:39,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:39,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:39,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 11:25:39,474 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:39,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 11:25:39,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 11:25:39,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:25:39,475 INFO L87 Difference]: Start difference. First operand 21 states and 59 transitions. Second operand 6 states. [2019-02-15 11:25:39,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:39,681 INFO L93 Difference]: Finished difference Result 39 states and 79 transitions. [2019-02-15 11:25:39,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 11:25:39,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-15 11:25:39,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:39,684 INFO L225 Difference]: With dead ends: 39 [2019-02-15 11:25:39,684 INFO L226 Difference]: Without dead ends: 36 [2019-02-15 11:25:39,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:25:39,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-15 11:25:39,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 23. [2019-02-15 11:25:39,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-15 11:25:39,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 67 transitions. [2019-02-15 11:25:39,692 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 67 transitions. Word has length 3 [2019-02-15 11:25:39,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:39,692 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 67 transitions. [2019-02-15 11:25:39,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 11:25:39,692 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 67 transitions. [2019-02-15 11:25:39,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 11:25:39,693 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:39,693 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 11:25:39,693 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:39,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:39,693 INFO L82 PathProgramCache]: Analyzing trace with hash 30128, now seen corresponding path program 1 times [2019-02-15 11:25:39,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:39,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:39,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:39,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:39,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:39,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:39,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:39,746 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:39,747 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 11:25:39,747 INFO L207 CegarAbsIntRunner]: [0], [10], [27] [2019-02-15 11:25:39,750 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:39,750 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:40,062 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:40,062 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:25:40,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:40,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:40,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:40,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:40,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:40,079 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:40,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:40,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:25:40,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:25:40,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:25:40,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:25:40,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:25:40,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-15 11:25:40,287 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:40,315 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:40,339 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:40,357 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:40,372 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:40,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:40,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 48 treesize of output 54 [2019-02-15 11:25:40,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:25:40,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:25:40,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:25:40,543 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:40,559 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:40,575 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:40,592 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:40,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:40,626 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-02-15 11:25:40,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:25:40,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:40,696 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-02-15 11:25:40,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-02-15 11:25:40,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:40,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:40,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:40,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:40,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 11:25:40,749 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:40,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 11:25:40,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 11:25:40,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:25:40,749 INFO L87 Difference]: Start difference. First operand 23 states and 67 transitions. Second operand 6 states. [2019-02-15 11:25:40,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:40,922 INFO L93 Difference]: Finished difference Result 49 states and 101 transitions. [2019-02-15 11:25:40,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 11:25:40,922 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-15 11:25:40,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:40,923 INFO L225 Difference]: With dead ends: 49 [2019-02-15 11:25:40,924 INFO L226 Difference]: Without dead ends: 47 [2019-02-15 11:25:40,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 11:25:40,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-15 11:25:40,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 25. [2019-02-15 11:25:40,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-15 11:25:40,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 80 transitions. [2019-02-15 11:25:40,932 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 80 transitions. Word has length 3 [2019-02-15 11:25:40,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:40,932 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 80 transitions. [2019-02-15 11:25:40,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 11:25:40,932 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 80 transitions. [2019-02-15 11:25:40,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:25:40,933 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:40,933 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:25:40,933 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:40,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:40,934 INFO L82 PathProgramCache]: Analyzing trace with hash 941528, now seen corresponding path program 1 times [2019-02-15 11:25:40,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:40,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:40,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:40,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:40,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:41,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:41,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:41,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:41,014 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:25:41,014 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [27] [2019-02-15 11:25:41,016 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:41,016 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:41,381 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:41,381 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:25:41,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:41,382 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:41,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:41,382 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:41,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:41,391 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:41,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:41,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:25:41,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:25:41,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:41,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:41,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:25:41,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:41,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:41,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:41,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:25:41,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:41,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:41,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:41,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:41,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:25:41,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-15 11:25:41,503 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:41,567 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:41,589 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:41,608 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:41,623 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:41,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:41,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:41,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 48 treesize of output 54 [2019-02-15 11:25:41,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:41,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:41,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:25:41,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:41,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:41,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:41,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:41,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:25:41,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:41,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:41,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:41,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:41,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:41,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:41,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:25:41,805 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:41,820 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:41,835 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:41,849 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:41,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:41,884 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-15 11:25:41,926 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:41,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 11:25:41,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:41,958 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-02-15 11:25:41,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 11:25:41,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:41,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:41,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:41,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:41,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:41,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-02-15 11:25:42,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:42,034 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-02-15 11:25:42,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-02-15 11:25:42,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:42,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:42,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:42,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:42,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:25:42,097 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:42,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:25:42,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:25:42,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:25:42,098 INFO L87 Difference]: Start difference. First operand 25 states and 80 transitions. Second operand 8 states. [2019-02-15 11:25:42,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:42,581 INFO L93 Difference]: Finished difference Result 61 states and 138 transitions. [2019-02-15 11:25:42,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:25:42,582 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 11:25:42,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:42,583 INFO L225 Difference]: With dead ends: 61 [2019-02-15 11:25:42,583 INFO L226 Difference]: Without dead ends: 57 [2019-02-15 11:25:42,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:25:42,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-15 11:25:42,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 29. [2019-02-15 11:25:42,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-15 11:25:42,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 98 transitions. [2019-02-15 11:25:42,592 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 98 transitions. Word has length 4 [2019-02-15 11:25:42,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:42,593 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 98 transitions. [2019-02-15 11:25:42,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:25:42,593 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 98 transitions. [2019-02-15 11:25:42,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:25:42,594 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:42,594 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:25:42,594 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:42,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:42,595 INFO L82 PathProgramCache]: Analyzing trace with hash 941590, now seen corresponding path program 1 times [2019-02-15 11:25:42,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:42,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:42,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:42,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:42,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:42,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:42,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:42,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:42,738 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:25:42,738 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [27] [2019-02-15 11:25:42,739 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:42,739 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:43,101 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:43,101 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:25:43,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:43,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:43,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:43,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:43,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:43,111 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:43,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:43,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 68 treesize of output 71 [2019-02-15 11:25:43,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:25:43,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:25:43,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:25:43,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-15 11:25:43,407 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:43,435 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:43,462 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:43,489 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:43,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:43,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:25:43,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:25:43,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:25:43,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:25:43,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:25:43,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:25:43,592 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:43,629 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:43,649 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:43,665 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:43,679 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:43,690 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:43,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:43,752 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-15 11:25:43,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 11:25:43,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:43,923 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-02-15 11:25:43,924 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 11:25:43,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,986 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:43,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-02-15 11:25:43,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:44,045 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-02-15 11:25:44,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-02-15 11:25:44,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:44,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:44,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:44,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:44,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:25:44,128 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:44,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:25:44,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:25:44,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:25:44,130 INFO L87 Difference]: Start difference. First operand 29 states and 98 transitions. Second operand 8 states. [2019-02-15 11:25:44,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:44,629 INFO L93 Difference]: Finished difference Result 59 states and 140 transitions. [2019-02-15 11:25:44,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:25:44,630 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 11:25:44,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:44,631 INFO L225 Difference]: With dead ends: 59 [2019-02-15 11:25:44,631 INFO L226 Difference]: Without dead ends: 55 [2019-02-15 11:25:44,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:25:44,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-15 11:25:44,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-02-15 11:25:44,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-15 11:25:44,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 110 transitions. [2019-02-15 11:25:44,640 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 110 transitions. Word has length 4 [2019-02-15 11:25:44,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:44,640 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 110 transitions. [2019-02-15 11:25:44,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:25:44,641 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 110 transitions. [2019-02-15 11:25:44,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:25:44,641 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:44,641 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:25:44,642 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:44,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:44,642 INFO L82 PathProgramCache]: Analyzing trace with hash 941156, now seen corresponding path program 1 times [2019-02-15 11:25:44,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:44,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:44,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:44,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:44,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:44,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:44,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:44,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:44,734 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:25:44,734 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [27] [2019-02-15 11:25:44,736 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:44,736 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:45,038 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:45,038 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:25:45,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:45,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:45,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:45,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:45,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:45,055 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:45,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:45,251 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-02-15 11:25:45,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:25:45,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:25:45,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:25:45,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:25:45,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:25:45,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-15 11:25:45,351 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:45,381 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:45,403 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:45,422 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:45,436 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:45,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:45,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 48 treesize of output 54 [2019-02-15 11:25:45,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:25:45,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:25:45,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:25:45,617 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:45,633 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:45,650 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:45,666 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:45,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:45,701 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-15 11:25:45,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 11:25:45,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:45,792 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-02-15 11:25:45,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 11:25:45,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,821 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:45,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-02-15 11:25:45,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:45,855 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-02-15 11:25:45,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:42 [2019-02-15 11:25:45,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:45,876 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:45,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:45,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:45,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:25:45,930 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:45,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:25:45,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:25:45,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:25:45,931 INFO L87 Difference]: Start difference. First operand 30 states and 110 transitions. Second operand 8 states. [2019-02-15 11:25:46,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:46,343 INFO L93 Difference]: Finished difference Result 57 states and 144 transitions. [2019-02-15 11:25:46,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:25:46,343 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 11:25:46,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:46,345 INFO L225 Difference]: With dead ends: 57 [2019-02-15 11:25:46,345 INFO L226 Difference]: Without dead ends: 55 [2019-02-15 11:25:46,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:25:46,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-15 11:25:46,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-02-15 11:25:46,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-15 11:25:46,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2019-02-15 11:25:46,354 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 109 transitions. Word has length 4 [2019-02-15 11:25:46,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:46,355 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 109 transitions. [2019-02-15 11:25:46,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:25:46,355 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 109 transitions. [2019-02-15 11:25:46,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:25:46,355 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:46,355 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:25:46,356 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:46,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:46,356 INFO L82 PathProgramCache]: Analyzing trace with hash 941280, now seen corresponding path program 1 times [2019-02-15 11:25:46,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:46,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:46,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:46,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:46,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:46,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:46,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:46,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:46,463 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:25:46,463 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [27] [2019-02-15 11:25:46,464 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:46,464 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:46,744 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:46,745 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:25:46,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:46,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:46,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:46,746 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:46,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:46,755 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:46,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:46,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:46,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 48 treesize of output 54 [2019-02-15 11:25:46,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:46,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:46,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:25:46,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:46,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:46,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:46,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:46,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:25:46,926 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:46,927 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:46,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:46,929 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:46,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:46,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:46,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:25:46,933 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:46,948 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:46,964 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:46,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:47,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:25:47,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:25:47,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:25:47,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:25:47,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:25:47,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-15 11:25:47,036 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:47,438 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:47,464 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:47,479 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:47,492 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:47,503 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:47,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:47,535 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-15 11:25:47,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 11:25:47,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:47,606 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-02-15 11:25:47,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 11:25:47,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 11:25:47,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:47,673 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-02-15 11:25:47,673 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-02-15 11:25:47,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:47,691 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:47,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:47,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:47,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:25:47,734 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:47,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:25:47,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:25:47,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:25:47,736 INFO L87 Difference]: Start difference. First operand 30 states and 109 transitions. Second operand 8 states. [2019-02-15 11:25:47,922 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-02-15 11:25:48,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:48,322 INFO L93 Difference]: Finished difference Result 57 states and 158 transitions. [2019-02-15 11:25:48,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:25:48,322 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 11:25:48,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:48,323 INFO L225 Difference]: With dead ends: 57 [2019-02-15 11:25:48,324 INFO L226 Difference]: Without dead ends: 53 [2019-02-15 11:25:48,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:25:48,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-15 11:25:48,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 31. [2019-02-15 11:25:48,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-15 11:25:48,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 126 transitions. [2019-02-15 11:25:48,334 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 126 transitions. Word has length 4 [2019-02-15 11:25:48,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:48,334 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 126 transitions. [2019-02-15 11:25:48,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:25:48,335 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 126 transitions. [2019-02-15 11:25:48,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:25:48,335 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:48,335 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:25:48,336 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:48,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:48,336 INFO L82 PathProgramCache]: Analyzing trace with hash 929872, now seen corresponding path program 1 times [2019-02-15 11:25:48,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:48,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:48,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:48,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:48,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:48,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:48,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:48,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:48,433 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:25:48,434 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [27] [2019-02-15 11:25:48,435 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:48,435 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:48,697 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:48,697 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:25:48,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:48,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:48,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:48,697 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:48,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:48,707 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:48,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:48,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:48,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 48 treesize of output 54 [2019-02-15 11:25:48,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:48,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:48,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:25:48,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:48,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:48,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:48,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:48,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:25:48,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:48,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:48,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:48,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:48,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:48,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:48,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:25:48,912 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:48,938 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:48,961 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:48,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:49,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:25:49,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:25:49,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:25:49,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:25:49,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:25:49,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-15 11:25:49,055 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:49,096 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:49,126 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:49,150 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:49,162 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:49,174 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:49,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:49,208 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-02-15 11:25:49,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:25:49,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:49,292 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-02-15 11:25:49,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 11:25:49,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-15 11:25:49,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:49,348 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-02-15 11:25:49,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-02-15 11:25:49,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:49,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:49,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:49,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:49,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 11:25:49,398 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:49,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:25:49,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:25:49,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:25:49,399 INFO L87 Difference]: Start difference. First operand 31 states and 126 transitions. Second operand 8 states. [2019-02-15 11:25:49,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:49,760 INFO L93 Difference]: Finished difference Result 73 states and 228 transitions. [2019-02-15 11:25:49,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:25:49,760 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 11:25:49,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:49,761 INFO L225 Difference]: With dead ends: 73 [2019-02-15 11:25:49,761 INFO L226 Difference]: Without dead ends: 71 [2019-02-15 11:25:49,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:25:49,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-15 11:25:49,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 40. [2019-02-15 11:25:49,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-15 11:25:49,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 173 transitions. [2019-02-15 11:25:49,774 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 173 transitions. Word has length 4 [2019-02-15 11:25:49,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:49,774 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 173 transitions. [2019-02-15 11:25:49,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:25:49,775 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 173 transitions. [2019-02-15 11:25:49,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:25:49,775 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:49,775 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:25:49,779 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:49,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:49,779 INFO L82 PathProgramCache]: Analyzing trace with hash 930184, now seen corresponding path program 1 times [2019-02-15 11:25:49,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:49,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:49,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:49,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:49,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:49,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:49,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:49,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:49,889 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:25:49,889 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [29] [2019-02-15 11:25:49,890 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:49,890 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:50,052 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:50,052 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:25:50,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:50,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:50,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:50,053 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:50,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:50,061 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:50,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:50,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:25:50,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:25:50,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:25:50,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:25:50,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:25:50,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-15 11:25:50,189 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:50,243 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:50,265 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:50,283 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:50,297 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:50,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:50,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 48 treesize of output 54 [2019-02-15 11:25:50,618 WARN L181 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-02-15 11:25:50,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:25:50,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:25:50,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:25:50,712 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:50,726 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:50,741 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:50,756 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:50,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:50,789 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-02-15 11:25:50,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:25:50,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:50,904 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-02-15 11:25:50,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-02-15 11:25:50,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:50,920 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:50,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:50,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:50,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 11:25:50,951 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:50,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 11:25:50,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 11:25:50,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:25:50,952 INFO L87 Difference]: Start difference. First operand 40 states and 173 transitions. Second operand 6 states. [2019-02-15 11:25:51,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:51,139 INFO L93 Difference]: Finished difference Result 56 states and 192 transitions. [2019-02-15 11:25:51,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 11:25:51,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-15 11:25:51,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:51,141 INFO L225 Difference]: With dead ends: 56 [2019-02-15 11:25:51,141 INFO L226 Difference]: Without dead ends: 55 [2019-02-15 11:25:51,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 11:25:51,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-15 11:25:51,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2019-02-15 11:25:51,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-02-15 11:25:51,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 180 transitions. [2019-02-15 11:25:51,151 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 180 transitions. Word has length 4 [2019-02-15 11:25:51,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:51,151 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 180 transitions. [2019-02-15 11:25:51,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 11:25:51,151 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 180 transitions. [2019-02-15 11:25:51,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:25:51,152 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:51,152 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:25:51,152 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:51,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:51,152 INFO L82 PathProgramCache]: Analyzing trace with hash 945434, now seen corresponding path program 1 times [2019-02-15 11:25:51,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:51,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:51,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:51,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:51,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:51,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:51,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:51,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:51,267 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:25:51,267 INFO L207 CegarAbsIntRunner]: [0], [22], [24], [27] [2019-02-15 11:25:51,269 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:51,269 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:51,580 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:51,581 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:25:51,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:51,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:51,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:51,581 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:51,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:51,590 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:51,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:51,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:51,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 68 treesize of output 71 [2019-02-15 11:25:51,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:25:51,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:25:51,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:25:51,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-15 11:25:51,889 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:51,937 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:51,966 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:51,997 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:52,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:52,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:25:52,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:25:52,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:25:52,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:25:52,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:25:52,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:25:52,118 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:52,151 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:52,172 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:52,188 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:52,201 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:52,212 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:52,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:52,256 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-15 11:25:52,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 11:25:52,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:52,335 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-02-15 11:25:52,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 11:25:52,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-02-15 11:25:52,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:52,483 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-02-15 11:25:52,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-02-15 11:25:52,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:52,513 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:52,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:52,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:52,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 11:25:52,550 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:52,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:25:52,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:25:52,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:25:52,551 INFO L87 Difference]: Start difference. First operand 42 states and 180 transitions. Second operand 8 states. [2019-02-15 11:25:53,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:53,010 INFO L93 Difference]: Finished difference Result 96 states and 313 transitions. [2019-02-15 11:25:53,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:25:53,011 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 11:25:53,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:53,012 INFO L225 Difference]: With dead ends: 96 [2019-02-15 11:25:53,012 INFO L226 Difference]: Without dead ends: 93 [2019-02-15 11:25:53,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-15 11:25:53,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-15 11:25:53,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 55. [2019-02-15 11:25:53,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-15 11:25:53,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 250 transitions. [2019-02-15 11:25:53,029 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 250 transitions. Word has length 4 [2019-02-15 11:25:53,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:53,030 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 250 transitions. [2019-02-15 11:25:53,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:25:53,030 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 250 transitions. [2019-02-15 11:25:53,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:25:53,031 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:53,031 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:25:53,031 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:53,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:53,031 INFO L82 PathProgramCache]: Analyzing trace with hash 945000, now seen corresponding path program 1 times [2019-02-15 11:25:53,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:53,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:53,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:53,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:53,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:53,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:53,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:53,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:53,126 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:25:53,127 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [27] [2019-02-15 11:25:53,128 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:53,128 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:53,427 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:53,428 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:25:53,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:53,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:53,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:53,428 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:53,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:53,436 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:53,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:53,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:25:53,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:25:53,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:25:53,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:25:53,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:25:53,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-15 11:25:53,520 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:53,611 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:53,633 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:53,651 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:53,665 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:53,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:53,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 48 treesize of output 54 [2019-02-15 11:25:53,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:25:53,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:25:53,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:25:53,855 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:53,871 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:53,887 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:53,903 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:53,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:53,936 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-15 11:25:53,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:25:53,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:54,035 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-02-15 11:25:54,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 11:25:54,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:54,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:54,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:54,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:54,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:54,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:54,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:54,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 11:25:54,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:54,131 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-02-15 11:25:54,131 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-02-15 11:25:54,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:54,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:54,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:54,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:54,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:25:54,215 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:54,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:25:54,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:25:54,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:25:54,216 INFO L87 Difference]: Start difference. First operand 55 states and 250 transitions. Second operand 8 states. [2019-02-15 11:25:54,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:54,718 INFO L93 Difference]: Finished difference Result 84 states and 299 transitions. [2019-02-15 11:25:54,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:25:54,719 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 11:25:54,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:54,720 INFO L225 Difference]: With dead ends: 84 [2019-02-15 11:25:54,720 INFO L226 Difference]: Without dead ends: 82 [2019-02-15 11:25:54,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:25:54,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-02-15 11:25:54,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2019-02-15 11:25:54,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-02-15 11:25:54,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 270 transitions. [2019-02-15 11:25:54,735 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 270 transitions. Word has length 4 [2019-02-15 11:25:54,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:54,735 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 270 transitions. [2019-02-15 11:25:54,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:25:54,735 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 270 transitions. [2019-02-15 11:25:54,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:25:54,736 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:54,736 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:25:54,736 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:54,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:54,737 INFO L82 PathProgramCache]: Analyzing trace with hash 946922, now seen corresponding path program 1 times [2019-02-15 11:25:54,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:54,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:54,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:54,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:54,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:54,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:54,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:54,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:54,816 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:25:54,816 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [27] [2019-02-15 11:25:54,817 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:54,817 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:55,417 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:55,418 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:25:55,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:55,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:55,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:55,418 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:55,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:55,427 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:55,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:55,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:25:55,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:25:55,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:25:55,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:25:55,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:25:55,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:25:55,518 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:55,555 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:55,577 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:55,596 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:55,611 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:55,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:55,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 68 treesize of output 71 [2019-02-15 11:25:55,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:25:55,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,747 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:25:55,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:25:55,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-15 11:25:55,895 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:55,917 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:55,942 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:55,967 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:55,994 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:56,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:56,040 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-15 11:25:56,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:56,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 11:25:56,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:56,132 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-02-15 11:25:56,132 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 11:25:56,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:56,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:56,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:56,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:56,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:56,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:56,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:56,191 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:56,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 112 [2019-02-15 11:25:56,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:56,236 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-02-15 11:25:56,237 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-02-15 11:25:56,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:56,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:56,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:56,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:56,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:25:56,358 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:56,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:25:56,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:25:56,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:25:56,359 INFO L87 Difference]: Start difference. First operand 58 states and 270 transitions. Second operand 8 states. [2019-02-15 11:25:57,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:57,099 INFO L93 Difference]: Finished difference Result 91 states and 313 transitions. [2019-02-15 11:25:57,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:25:57,099 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 11:25:57,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:57,100 INFO L225 Difference]: With dead ends: 91 [2019-02-15 11:25:57,101 INFO L226 Difference]: Without dead ends: 89 [2019-02-15 11:25:57,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:25:57,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-15 11:25:57,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 59. [2019-02-15 11:25:57,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-15 11:25:57,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 277 transitions. [2019-02-15 11:25:57,113 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 277 transitions. Word has length 4 [2019-02-15 11:25:57,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:57,113 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 277 transitions. [2019-02-15 11:25:57,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:25:57,113 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 277 transitions. [2019-02-15 11:25:57,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:25:57,114 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:57,114 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:25:57,115 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:57,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:57,115 INFO L82 PathProgramCache]: Analyzing trace with hash 934028, now seen corresponding path program 1 times [2019-02-15 11:25:57,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:57,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:57,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:57,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:57,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:57,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:57,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:57,185 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:57,185 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:25:57,185 INFO L207 CegarAbsIntRunner]: [0], [10], [28], [29] [2019-02-15 11:25:57,186 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:57,186 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:57,359 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:57,359 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:25:57,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:57,360 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:57,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:57,360 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:57,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:57,371 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:57,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:57,381 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:25:57,387 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:25:57,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:25:57,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:25:57,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:25:57,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-15 11:25:57,459 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:57,483 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:57,503 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:57,520 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:57,533 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:57,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:57,568 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:25:57,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:25:57,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:25:57,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:25:57,664 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:57,677 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:57,690 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:57,704 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:57,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:57,734 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:64, output treesize:67 [2019-02-15 11:25:57,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:25:57,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:25:57,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:25:57,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:92 [2019-02-15 11:25:57,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:57,906 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:57,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:57,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 11:25:57,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-15 11:25:57,943 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:25:57,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:25:57,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:25:57,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-15 11:25:57,944 INFO L87 Difference]: Start difference. First operand 59 states and 277 transitions. Second operand 4 states. [2019-02-15 11:25:58,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:58,048 INFO L93 Difference]: Finished difference Result 90 states and 454 transitions. [2019-02-15 11:25:58,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 11:25:58,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-15 11:25:58,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:58,050 INFO L225 Difference]: With dead ends: 90 [2019-02-15 11:25:58,050 INFO L226 Difference]: Without dead ends: 89 [2019-02-15 11:25:58,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-15 11:25:58,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-15 11:25:58,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2019-02-15 11:25:58,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-02-15 11:25:58,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 449 transitions. [2019-02-15 11:25:58,067 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 449 transitions. Word has length 4 [2019-02-15 11:25:58,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:58,067 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 449 transitions. [2019-02-15 11:25:58,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:25:58,068 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 449 transitions. [2019-02-15 11:25:58,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:25:58,069 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:58,069 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:25:58,069 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:58,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:58,069 INFO L82 PathProgramCache]: Analyzing trace with hash 933592, now seen corresponding path program 1 times [2019-02-15 11:25:58,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:58,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:58,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:58,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:58,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:58,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:58,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:58,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:58,167 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:25:58,167 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [27] [2019-02-15 11:25:58,167 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:58,168 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:58,415 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:58,415 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:25:58,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:58,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:58,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:58,416 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:58,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:58,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:58,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:58,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 48 treesize of output 54 [2019-02-15 11:25:58,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:25:58,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:25:58,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:25:58,618 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:58,637 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:58,655 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:58,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:58,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:25:58,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:25:58,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:25:58,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:25:58,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:25:58,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-15 11:25:58,728 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:58,752 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:58,772 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:58,787 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:58,799 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:58,809 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:58,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:58,841 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-15 11:25:58,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:25:58,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:58,909 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-02-15 11:25:58,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 11:25:58,929 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 11:25:58,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:58,964 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-02-15 11:25:58,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-02-15 11:25:58,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:58,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:59,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:59,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:59,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:25:59,027 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:59,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:25:59,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:25:59,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:25:59,028 INFO L87 Difference]: Start difference. First operand 83 states and 449 transitions. Second operand 8 states. [2019-02-15 11:25:59,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:59,507 INFO L93 Difference]: Finished difference Result 121 states and 532 transitions. [2019-02-15 11:25:59,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:25:59,507 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 11:25:59,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:59,510 INFO L225 Difference]: With dead ends: 121 [2019-02-15 11:25:59,510 INFO L226 Difference]: Without dead ends: 119 [2019-02-15 11:25:59,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:25:59,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-15 11:25:59,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 91. [2019-02-15 11:25:59,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-15 11:25:59,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 493 transitions. [2019-02-15 11:25:59,528 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 493 transitions. Word has length 4 [2019-02-15 11:25:59,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:59,529 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 493 transitions. [2019-02-15 11:25:59,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:25:59,529 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 493 transitions. [2019-02-15 11:25:59,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:25:59,530 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:59,530 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:25:59,530 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:59,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:59,531 INFO L82 PathProgramCache]: Analyzing trace with hash 937872, now seen corresponding path program 1 times [2019-02-15 11:25:59,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:59,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:59,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:59,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:59,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:59,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:59,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:59,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:59,671 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:25:59,671 INFO L207 CegarAbsIntRunner]: [0], [14], [28], [29] [2019-02-15 11:25:59,672 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:59,672 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:59,828 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:59,828 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:25:59,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:59,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:59,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:59,828 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:59,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:59,837 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:59,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:59,848 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:25:59,855 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:25:59,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:59,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:59,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:25:59,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:59,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:59,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:59,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:25:59,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:59,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:59,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:59,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:59,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:25:59,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-15 11:25:59,919 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:59,947 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:59,968 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:59,983 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:59,996 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:00,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:00,032 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:26:00,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:26:00,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:26:00,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:26:00,134 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:00,151 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:00,166 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:00,183 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:00,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:00,217 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-02-15 11:26:00,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-15 11:26:00,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:00,290 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-02-15 11:26:00,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-02-15 11:26:00,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:00,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:00,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:00,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:00,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 11:26:00,347 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:00,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 11:26:00,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 11:26:00,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:26:00,348 INFO L87 Difference]: Start difference. First operand 91 states and 493 transitions. Second operand 6 states. [2019-02-15 11:26:00,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:00,577 INFO L93 Difference]: Finished difference Result 110 states and 511 transitions. [2019-02-15 11:26:00,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 11:26:00,578 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-15 11:26:00,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:00,579 INFO L225 Difference]: With dead ends: 110 [2019-02-15 11:26:00,579 INFO L226 Difference]: Without dead ends: 109 [2019-02-15 11:26:00,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 11:26:00,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-15 11:26:00,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2019-02-15 11:26:00,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-15 11:26:00,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 493 transitions. [2019-02-15 11:26:00,593 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 493 transitions. Word has length 4 [2019-02-15 11:26:00,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:00,593 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 493 transitions. [2019-02-15 11:26:00,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 11:26:00,594 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 493 transitions. [2019-02-15 11:26:00,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:26:00,594 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:00,595 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-15 11:26:00,595 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:00,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:00,595 INFO L82 PathProgramCache]: Analyzing trace with hash 29182900, now seen corresponding path program 2 times [2019-02-15 11:26:00,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:00,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:00,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:00,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:00,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:00,688 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:00,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:00,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:00,689 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:26:00,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:26:00,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:00,689 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:00,699 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:26:00,699 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:26:00,707 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:26:00,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:26:00,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:00,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:26:00,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:26:00,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:26:00,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:26:00,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:26:00,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:26:00,781 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:00,824 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:01,002 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:01,021 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:01,034 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:01,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:01,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 68 treesize of output 71 [2019-02-15 11:26:01,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:26:01,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:26:01,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:26:01,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-15 11:26:01,292 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:01,317 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:01,342 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:01,367 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:01,392 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:01,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:01,439 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:92, output treesize:91 [2019-02-15 11:26:01,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 11:26:01,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:01,512 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-02-15 11:26:01,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 11:26:01,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 103 [2019-02-15 11:26:01,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:01,590 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-02-15 11:26:01,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:71 [2019-02-15 11:26:01,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:01,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-02-15 11:26:01,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:01,672 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-02-15 11:26:01,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-02-15 11:26:01,893 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-02-15 11:26:01,894 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:01,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:02,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:02,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:02,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:26:02,419 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:02,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:26:02,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:26:02,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:26:02,421 INFO L87 Difference]: Start difference. First operand 91 states and 493 transitions. Second operand 10 states. [2019-02-15 11:26:03,379 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-02-15 11:26:03,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:03,994 INFO L93 Difference]: Finished difference Result 133 states and 606 transitions. [2019-02-15 11:26:03,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:26:03,995 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:26:03,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:03,997 INFO L225 Difference]: With dead ends: 133 [2019-02-15 11:26:03,997 INFO L226 Difference]: Without dead ends: 128 [2019-02-15 11:26:03,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:26:03,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-02-15 11:26:04,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 95. [2019-02-15 11:26:04,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-02-15 11:26:04,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 538 transitions. [2019-02-15 11:26:04,017 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 538 transitions. Word has length 5 [2019-02-15 11:26:04,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:04,017 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 538 transitions. [2019-02-15 11:26:04,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:26:04,017 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 538 transitions. [2019-02-15 11:26:04,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:26:04,018 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:04,018 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:26:04,018 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:04,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:04,018 INFO L82 PathProgramCache]: Analyzing trace with hash 29172052, now seen corresponding path program 1 times [2019-02-15 11:26:04,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:04,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:04,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:26:04,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:04,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:04,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:04,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:04,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:04,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:04,131 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:26:04,131 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [28], [29] [2019-02-15 11:26:04,133 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:04,133 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:04,390 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:04,391 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:26:04,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:04,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:04,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:04,391 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:04,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:04,400 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:04,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:04,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:26:04,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:26:04,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:26:04,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:26:04,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:26:04,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-15 11:26:04,509 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:04,557 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:04,588 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:04,611 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:04,625 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:04,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:04,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 48 treesize of output 54 [2019-02-15 11:26:04,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:26:04,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:26:04,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:26:04,795 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:04,812 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:04,828 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:04,843 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:04,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:04,874 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-15 11:26:04,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 11:26:04,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:04,941 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-02-15 11:26:04,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 11:26:04,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 11:26:04,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:05,003 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-02-15 11:26:05,004 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-02-15 11:26:05,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:05,064 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:05,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:05,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:05,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:26:05,106 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:05,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:26:05,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:26:05,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:26:05,107 INFO L87 Difference]: Start difference. First operand 95 states and 538 transitions. Second operand 8 states. [2019-02-15 11:26:05,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:05,455 INFO L93 Difference]: Finished difference Result 125 states and 622 transitions. [2019-02-15 11:26:05,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:26:05,455 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:26:05,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:05,457 INFO L225 Difference]: With dead ends: 125 [2019-02-15 11:26:05,458 INFO L226 Difference]: Without dead ends: 124 [2019-02-15 11:26:05,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:26:05,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-02-15 11:26:05,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 102. [2019-02-15 11:26:05,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-02-15 11:26:05,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 589 transitions. [2019-02-15 11:26:05,477 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 589 transitions. Word has length 5 [2019-02-15 11:26:05,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:05,477 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 589 transitions. [2019-02-15 11:26:05,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:26:05,477 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 589 transitions. [2019-02-15 11:26:05,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:26:05,478 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:05,478 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:26:05,478 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:05,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:05,479 INFO L82 PathProgramCache]: Analyzing trace with hash 29187302, now seen corresponding path program 1 times [2019-02-15 11:26:05,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:05,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:05,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:05,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:05,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:05,653 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2019-02-15 11:26:05,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:05,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:05,709 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:05,709 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:26:05,710 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [24], [27] [2019-02-15 11:26:05,712 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:05,712 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:06,125 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:06,126 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:26:06,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:06,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:06,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:06,127 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:06,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:06,142 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:06,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:06,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 68 treesize of output 71 [2019-02-15 11:26:06,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:26:06,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:26:06,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:26:06,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-15 11:26:06,413 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:06,439 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:06,480 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:06,511 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:06,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:06,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:26:06,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:26:06,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:26:06,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:26:06,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:26:06,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:26:06,604 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:06,639 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:06,658 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:06,674 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:06,688 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:06,700 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:06,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:06,746 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-15 11:26:06,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 11:26:06,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:06,824 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-02-15 11:26:06,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 11:26:06,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 105 [2019-02-15 11:26:06,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:06,910 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-02-15 11:26:06,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-15 11:26:06,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,949 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:06,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-02-15 11:26:06,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:07,000 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-02-15 11:26:07,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-02-15 11:26:07,051 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:07,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:07,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:07,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:07,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:26:07,111 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:07,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:26:07,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:26:07,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:26:07,113 INFO L87 Difference]: Start difference. First operand 102 states and 589 transitions. Second operand 10 states. [2019-02-15 11:26:08,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:08,411 INFO L93 Difference]: Finished difference Result 149 states and 665 transitions. [2019-02-15 11:26:08,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:26:08,411 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:26:08,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:08,413 INFO L225 Difference]: With dead ends: 149 [2019-02-15 11:26:08,413 INFO L226 Difference]: Without dead ends: 145 [2019-02-15 11:26:08,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:26:08,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-02-15 11:26:08,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 105. [2019-02-15 11:26:08,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-15 11:26:08,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 605 transitions. [2019-02-15 11:26:08,434 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 605 transitions. Word has length 5 [2019-02-15 11:26:08,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:08,435 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 605 transitions. [2019-02-15 11:26:08,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:26:08,435 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 605 transitions. [2019-02-15 11:26:08,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:26:08,436 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:08,436 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:26:08,436 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:08,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:08,436 INFO L82 PathProgramCache]: Analyzing trace with hash 29186868, now seen corresponding path program 1 times [2019-02-15 11:26:08,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:08,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:08,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:08,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:08,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:08,574 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:08,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:08,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:08,575 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:26:08,575 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [27] [2019-02-15 11:26:08,576 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:08,576 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:08,954 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:08,954 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:26:08,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:08,955 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:08,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:08,955 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:08,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:08,971 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:08,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:09,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:26:09,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:26:09,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:26:09,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:26:09,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:26:09,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-15 11:26:09,063 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,090 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,113 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,131 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,145 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 48 treesize of output 54 [2019-02-15 11:26:09,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:26:09,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:26:09,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:26:09,304 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,347 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,372 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,399 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:09,442 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-15 11:26:09,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 11:26:09,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,561 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-02-15 11:26:09,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-15 11:26:09,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-02-15 11:26:09,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,659 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-02-15 11:26:09,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-02-15 11:26:09,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,689 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:09,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-02-15 11:26:09,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,725 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-02-15 11:26:09,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-02-15 11:26:09,743 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:09,743 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:09,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:09,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:09,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:26:09,798 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:09,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:26:09,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:26:09,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:26:09,798 INFO L87 Difference]: Start difference. First operand 105 states and 605 transitions. Second operand 10 states. [2019-02-15 11:26:10,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:10,323 INFO L93 Difference]: Finished difference Result 138 states and 662 transitions. [2019-02-15 11:26:10,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:26:10,323 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:26:10,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:10,326 INFO L225 Difference]: With dead ends: 138 [2019-02-15 11:26:10,326 INFO L226 Difference]: Without dead ends: 136 [2019-02-15 11:26:10,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:26:10,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-02-15 11:26:10,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 104. [2019-02-15 11:26:10,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-02-15 11:26:10,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 598 transitions. [2019-02-15 11:26:10,346 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 598 transitions. Word has length 5 [2019-02-15 11:26:10,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:10,346 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 598 transitions. [2019-02-15 11:26:10,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:26:10,346 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 598 transitions. [2019-02-15 11:26:10,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:26:10,347 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:10,347 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:26:10,347 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:10,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:10,348 INFO L82 PathProgramCache]: Analyzing trace with hash 29188666, now seen corresponding path program 1 times [2019-02-15 11:26:10,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:10,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:10,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:10,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:10,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:10,697 WARN L181 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2019-02-15 11:26:10,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:10,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:10,980 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:10,981 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:26:10,981 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [27] [2019-02-15 11:26:10,982 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:10,982 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:11,328 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:11,328 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:26:11,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:11,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:11,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:11,328 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:11,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:11,338 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:11,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:11,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 68 treesize of output 71 [2019-02-15 11:26:11,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:26:11,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:26:11,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:26:11,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-15 11:26:11,605 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,631 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,657 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,684 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:26:11,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:26:11,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:26:11,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:26:11,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:26:11,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:26:11,764 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,802 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,823 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,839 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,854 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,867 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:11,923 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-15 11:26:11,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 11:26:11,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,991 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-02-15 11:26:11,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 11:26:12,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:12,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:12,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:12,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:12,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:12,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:12,025 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:12,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-02-15 11:26:12,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:12,071 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-02-15 11:26:12,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-02-15 11:26:12,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:12,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:12,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:12,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:12,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:12,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:12,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:12,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:12,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:12,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:12,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:12,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 115 [2019-02-15 11:26:12,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:12,164 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-02-15 11:26:12,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-02-15 11:26:12,184 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:12,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:12,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:12,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:12,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:26:12,228 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:12,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:26:12,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:26:12,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:26:12,228 INFO L87 Difference]: Start difference. First operand 104 states and 598 transitions. Second operand 10 states. [2019-02-15 11:26:12,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:12,805 INFO L93 Difference]: Finished difference Result 152 states and 738 transitions. [2019-02-15 11:26:12,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:26:12,807 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:26:12,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:12,809 INFO L225 Difference]: With dead ends: 152 [2019-02-15 11:26:12,809 INFO L226 Difference]: Without dead ends: 151 [2019-02-15 11:26:12,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:26:12,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-02-15 11:26:12,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 106. [2019-02-15 11:26:12,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-02-15 11:26:12,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 612 transitions. [2019-02-15 11:26:12,824 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 612 transitions. Word has length 5 [2019-02-15 11:26:12,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:12,824 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 612 transitions. [2019-02-15 11:26:12,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:26:12,825 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 612 transitions. [2019-02-15 11:26:12,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:26:12,825 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:12,825 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:26:12,826 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:12,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:12,826 INFO L82 PathProgramCache]: Analyzing trace with hash 29188790, now seen corresponding path program 1 times [2019-02-15 11:26:12,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:12,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:12,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:12,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:12,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:12,954 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:12,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:12,955 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:12,955 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:26:12,955 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [27] [2019-02-15 11:26:12,957 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:12,957 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:13,254 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:13,254 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:26:13,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:13,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:13,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:13,255 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:13,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:13,263 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:13,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:13,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 68 treesize of output 71 [2019-02-15 11:26:13,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:26:13,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:26:13,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:26:13,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-15 11:26:13,557 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:13,610 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:13,637 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:13,666 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:13,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:13,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:26:13,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:26:13,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:26:13,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:26:13,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:26:13,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:26:13,753 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:13,791 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:13,809 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:13,825 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:13,838 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:13,849 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:13,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:13,897 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-15 11:26:13,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 11:26:13,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:13,987 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-02-15 11:26:13,988 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 11:26:14,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,020 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:14,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-02-15 11:26:14,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:14,065 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-02-15 11:26:14,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:59 [2019-02-15 11:26:14,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,092 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,100 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:14,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 108 [2019-02-15 11:26:14,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:14,251 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-02-15 11:26:14,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:57 [2019-02-15 11:26:15,670 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:15,671 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:15,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:15,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:15,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:26:15,728 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:15,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:26:15,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:26:15,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:26:15,728 INFO L87 Difference]: Start difference. First operand 106 states and 612 transitions. Second operand 10 states. [2019-02-15 11:26:16,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:16,464 INFO L93 Difference]: Finished difference Result 141 states and 665 transitions. [2019-02-15 11:26:16,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:26:16,464 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:26:16,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:16,467 INFO L225 Difference]: With dead ends: 141 [2019-02-15 11:26:16,467 INFO L226 Difference]: Without dead ends: 140 [2019-02-15 11:26:16,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:26:16,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-02-15 11:26:16,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 107. [2019-02-15 11:26:16,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-02-15 11:26:16,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 619 transitions. [2019-02-15 11:26:16,486 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 619 transitions. Word has length 5 [2019-02-15 11:26:16,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:16,486 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 619 transitions. [2019-02-15 11:26:16,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:26:16,487 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 619 transitions. [2019-02-15 11:26:16,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:26:16,487 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:16,488 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:26:16,488 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:16,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:16,488 INFO L82 PathProgramCache]: Analyzing trace with hash 29175212, now seen corresponding path program 1 times [2019-02-15 11:26:16,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:16,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:16,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:16,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:16,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:16,807 WARN L181 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 16 [2019-02-15 11:26:16,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:16,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:16,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:16,824 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:26:16,824 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [27] [2019-02-15 11:26:16,827 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:16,827 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:17,169 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:17,169 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:26:17,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:17,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:17,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:17,170 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:17,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:17,183 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:17,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:17,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:26:17,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:26:17,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:26:17,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:26:17,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:26:17,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-15 11:26:17,274 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,308 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,328 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,346 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,360 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 48 treesize of output 54 [2019-02-15 11:26:17,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:26:17,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:26:17,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:26:17,521 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,537 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,553 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,568 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:17,600 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-15 11:26:17,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 11:26:17,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,663 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-02-15 11:26:17,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 11:26:17,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,688 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:17,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-02-15 11:26:17,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,727 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-02-15 11:26:17,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:42 [2019-02-15 11:26:17,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 90 [2019-02-15 11:26:17,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,791 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-02-15 11:26:17,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-02-15 11:26:17,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:17,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:17,831 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:17,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:17,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:26:17,850 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:17,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:26:17,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:26:17,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:26:17,850 INFO L87 Difference]: Start difference. First operand 107 states and 619 transitions. Second operand 10 states. [2019-02-15 11:26:18,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:18,350 INFO L93 Difference]: Finished difference Result 163 states and 816 transitions. [2019-02-15 11:26:18,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:26:18,351 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:26:18,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:18,353 INFO L225 Difference]: With dead ends: 163 [2019-02-15 11:26:18,353 INFO L226 Difference]: Without dead ends: 162 [2019-02-15 11:26:18,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:26:18,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-02-15 11:26:18,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 116. [2019-02-15 11:26:18,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-02-15 11:26:18,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 682 transitions. [2019-02-15 11:26:18,378 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 682 transitions. Word has length 5 [2019-02-15 11:26:18,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:18,379 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 682 transitions. [2019-02-15 11:26:18,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:26:18,379 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 682 transitions. [2019-02-15 11:26:18,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:26:18,379 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:18,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:26:18,380 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:18,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:18,380 INFO L82 PathProgramCache]: Analyzing trace with hash 29179614, now seen corresponding path program 1 times [2019-02-15 11:26:18,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:18,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:18,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:18,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:18,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:18,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:18,471 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:18,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:18,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:18,472 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:26:18,472 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [27] [2019-02-15 11:26:18,473 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:18,473 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:18,768 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:18,769 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:26:18,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:18,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:18,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:18,769 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:18,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:18,777 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:18,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:18,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:18,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 68 treesize of output 71 [2019-02-15 11:26:18,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:18,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:18,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:26:18,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:18,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:18,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:18,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:18,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:26:18,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:18,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:18,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:18,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:18,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:18,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:18,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:26:19,104 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-02-15 11:26:19,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,115 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-15 11:26:19,116 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:19,143 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:19,169 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:19,195 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:19,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:19,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:26:19,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:26:19,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:26:19,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:26:19,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:26:19,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:26:19,273 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:19,309 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:19,328 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:19,344 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:19,357 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:19,369 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:19,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:19,414 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-15 11:26:19,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 11:26:19,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:19,502 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-02-15 11:26:19,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 11:26:19,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-02-15 11:26:19,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:19,603 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-02-15 11:26:19,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-15 11:26:19,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,671 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:19,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-02-15 11:26:19,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:19,750 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-02-15 11:26:19,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-02-15 11:26:19,777 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:19,777 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:19,843 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:19,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:19,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:26:19,862 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:19,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:26:19,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:26:19,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:26:19,863 INFO L87 Difference]: Start difference. First operand 116 states and 682 transitions. Second operand 10 states. [2019-02-15 11:26:20,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:20,574 INFO L93 Difference]: Finished difference Result 163 states and 796 transitions. [2019-02-15 11:26:20,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:26:20,575 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:26:20,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:20,577 INFO L225 Difference]: With dead ends: 163 [2019-02-15 11:26:20,577 INFO L226 Difference]: Without dead ends: 160 [2019-02-15 11:26:20,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:26:20,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-02-15 11:26:20,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 122. [2019-02-15 11:26:20,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-02-15 11:26:20,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 724 transitions. [2019-02-15 11:26:20,599 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 724 transitions. Word has length 5 [2019-02-15 11:26:20,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:20,600 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 724 transitions. [2019-02-15 11:26:20,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:26:20,600 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 724 transitions. [2019-02-15 11:26:20,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:26:20,600 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:20,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:26:20,601 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:20,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:20,601 INFO L82 PathProgramCache]: Analyzing trace with hash 29179180, now seen corresponding path program 1 times [2019-02-15 11:26:20,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:20,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:20,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:20,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:20,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:20,707 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:20,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:20,708 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:20,708 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:26:20,708 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [27] [2019-02-15 11:26:20,711 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:20,711 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:20,996 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:20,997 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:26:20,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:20,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:20,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:20,997 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:21,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:21,007 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:21,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:21,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 48 treesize of output 54 [2019-02-15 11:26:21,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:26:21,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:26:21,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:26:21,176 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:21,193 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:21,209 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:21,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:21,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:26:21,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:26:21,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:26:21,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:26:21,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:26:21,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-15 11:26:21,268 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:21,294 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:21,314 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:21,330 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:21,343 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:21,354 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:21,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:21,386 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-15 11:26:21,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 11:26:21,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:21,464 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-02-15 11:26:21,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-15 11:26:21,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 11:26:21,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:21,532 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-02-15 11:26:21,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-02-15 11:26:21,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,604 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:21,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-02-15 11:26:21,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:21,640 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-02-15 11:26:21,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-02-15 11:26:21,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:21,659 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:21,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:21,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:21,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:26:21,720 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:21,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:26:21,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:26:21,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:26:21,721 INFO L87 Difference]: Start difference. First operand 122 states and 724 transitions. Second operand 10 states. [2019-02-15 11:26:22,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:22,261 INFO L93 Difference]: Finished difference Result 165 states and 829 transitions. [2019-02-15 11:26:22,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:26:22,261 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:26:22,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:22,264 INFO L225 Difference]: With dead ends: 165 [2019-02-15 11:26:22,264 INFO L226 Difference]: Without dead ends: 163 [2019-02-15 11:26:22,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:26:22,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-02-15 11:26:22,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 125. [2019-02-15 11:26:22,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-02-15 11:26:22,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 745 transitions. [2019-02-15 11:26:22,282 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 745 transitions. Word has length 5 [2019-02-15 11:26:22,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:22,282 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 745 transitions. [2019-02-15 11:26:22,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:26:22,282 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 745 transitions. [2019-02-15 11:26:22,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:26:22,283 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:22,283 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:26:22,283 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:22,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:22,283 INFO L82 PathProgramCache]: Analyzing trace with hash 28829936, now seen corresponding path program 1 times [2019-02-15 11:26:22,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:22,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:22,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:22,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:22,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:22,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:26:22,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:22,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:22,537 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:26:22,539 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [28], [29] [2019-02-15 11:26:22,540 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:22,540 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:22,899 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:22,899 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:26:22,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:22,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:22,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:22,899 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:22,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:22,908 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:22,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:22,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:26:22,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:26:22,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:26:22,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:26:23,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:23,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:23,036 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:23,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:23,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:26:23,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-15 11:26:23,053 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:23,083 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:23,105 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:23,122 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:23,136 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:23,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:23,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:23,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 48 treesize of output 54 [2019-02-15 11:26:23,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:23,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:23,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:26:23,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:23,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:23,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:23,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:23,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:26:23,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:23,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:23,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:23,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:23,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:23,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:23,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:26:23,297 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:23,313 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:23,329 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:23,345 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:23,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:23,378 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-15 11:26:23,837 WARN L181 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-02-15 11:26:23,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:23,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:26:23,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:23,871 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-02-15 11:26:23,872 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 11:26:23,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:23,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:23,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:23,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:23,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:23,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:23,898 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:23,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 11:26:23,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:23,929 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-02-15 11:26:23,929 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-02-15 11:26:23,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:23,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:23,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:23,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:23,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-15 11:26:23,985 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:23,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-15 11:26:23,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-15 11:26:23,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:26:23,986 INFO L87 Difference]: Start difference. First operand 125 states and 745 transitions. Second operand 7 states. [2019-02-15 11:26:24,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:24,266 INFO L93 Difference]: Finished difference Result 158 states and 796 transitions. [2019-02-15 11:26:24,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:26:24,268 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-02-15 11:26:24,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:24,270 INFO L225 Difference]: With dead ends: 158 [2019-02-15 11:26:24,270 INFO L226 Difference]: Without dead ends: 156 [2019-02-15 11:26:24,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-02-15 11:26:24,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-02-15 11:26:24,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 128. [2019-02-15 11:26:24,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-02-15 11:26:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 760 transitions. [2019-02-15 11:26:24,298 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 760 transitions. Word has length 5 [2019-02-15 11:26:24,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:24,298 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 760 transitions. [2019-02-15 11:26:24,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-15 11:26:24,298 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 760 transitions. [2019-02-15 11:26:24,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:26:24,299 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:24,299 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:26:24,299 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:24,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:24,300 INFO L82 PathProgramCache]: Analyzing trace with hash 28831546, now seen corresponding path program 2 times [2019-02-15 11:26:24,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:24,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:24,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:24,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:24,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:24,717 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2019-02-15 11:26:24,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:24,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:24,768 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:24,769 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:26:24,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:26:24,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:24,769 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:24,778 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:26:24,778 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:26:24,785 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:26:24,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:26:24,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:24,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 68 treesize of output 71 [2019-02-15 11:26:24,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:26:24,907 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:26:24,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:26:25,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-15 11:26:25,094 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:25,120 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:25,145 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:25,170 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:25,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:25,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:26:25,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:26:25,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:26:25,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:26:25,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:26:25,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:26:25,246 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:25,281 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:25,301 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:25,317 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:25,331 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:25,342 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:25,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:25,388 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-15 11:26:25,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 11:26:25,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:25,461 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-02-15 11:26:25,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 11:26:25,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-02-15 11:26:25,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:25,546 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-02-15 11:26:25,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-02-15 11:26:25,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,579 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,581 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:25,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-02-15 11:26:25,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:25,631 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-02-15 11:26:25,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-02-15 11:26:25,653 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:25,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:25,675 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:25,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:25,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-02-15 11:26:25,694 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:25,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:26:25,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:26:25,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-02-15 11:26:25,694 INFO L87 Difference]: Start difference. First operand 128 states and 760 transitions. Second operand 10 states. [2019-02-15 11:26:26,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:26,398 INFO L93 Difference]: Finished difference Result 241 states and 1191 transitions. [2019-02-15 11:26:26,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:26:26,399 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:26:26,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:26,401 INFO L225 Difference]: With dead ends: 241 [2019-02-15 11:26:26,401 INFO L226 Difference]: Without dead ends: 235 [2019-02-15 11:26:26,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:26:26,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-02-15 11:26:26,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 164. [2019-02-15 11:26:26,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-02-15 11:26:26,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 1007 transitions. [2019-02-15 11:26:26,440 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 1007 transitions. Word has length 5 [2019-02-15 11:26:26,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:26,440 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 1007 transitions. [2019-02-15 11:26:26,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:26:26,441 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 1007 transitions. [2019-02-15 11:26:26,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:26:26,441 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:26,442 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:26:26,442 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:26,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:26,442 INFO L82 PathProgramCache]: Analyzing trace with hash 28831858, now seen corresponding path program 1 times [2019-02-15 11:26:26,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:26,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:26,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:26:26,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:26,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:26,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:26:26,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:26,798 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:26,798 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:26:26,798 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [28], [29] [2019-02-15 11:26:26,799 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:26,799 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:27,071 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:27,071 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:26:27,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:27,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:27,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:27,072 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:27,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:27,080 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:27,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:27,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:26:27,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:26:27,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:27,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:27,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:26:27,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:27,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:27,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:27,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:26:27,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:27,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:27,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:27,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:27,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:26:27,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-15 11:26:27,184 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:27,212 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:27,235 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:27,272 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:27,286 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:27,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:27,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:27,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 48 treesize of output 54 [2019-02-15 11:26:27,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:27,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:27,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:26:27,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:27,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:27,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:27,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:27,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:26:27,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:27,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:27,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:27,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:27,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:27,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:27,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:26:27,451 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:27,467 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:27,481 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:27,496 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:27,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:27,529 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-15 11:26:27,767 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-02-15 11:26:27,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:27,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-02-15 11:26:27,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:26:27,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:26:27,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:106 [2019-02-15 11:26:28,165 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-02-15 11:26:28,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:28,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:28,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:28,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:28,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:28,174 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:28,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 72 [2019-02-15 11:26:28,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:28,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:28,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:28,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:28,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:28,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:28,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:28,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:28,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:28,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 65 treesize of output 107 [2019-02-15 11:26:28,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2019-02-15 11:26:28,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-02-15 11:26:28,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:126, output treesize:280 [2019-02-15 11:26:28,845 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 90 [2019-02-15 11:26:28,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:28,850 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:28,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:28,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:28,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:26:28,958 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:28,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:26:28,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:26:28,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:26:28,959 INFO L87 Difference]: Start difference. First operand 164 states and 1007 transitions. Second operand 8 states. [2019-02-15 11:26:29,446 WARN L181 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-02-15 11:26:29,969 WARN L181 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-02-15 11:26:30,245 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 72 [2019-02-15 11:26:30,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:30,528 INFO L93 Difference]: Finished difference Result 208 states and 1150 transitions. [2019-02-15 11:26:30,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:26:30,529 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:26:30,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:30,532 INFO L225 Difference]: With dead ends: 208 [2019-02-15 11:26:30,532 INFO L226 Difference]: Without dead ends: 207 [2019-02-15 11:26:30,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:26:30,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-02-15 11:26:30,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 181. [2019-02-15 11:26:30,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-02-15 11:26:30,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 1128 transitions. [2019-02-15 11:26:30,562 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 1128 transitions. Word has length 5 [2019-02-15 11:26:30,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:30,562 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 1128 transitions. [2019-02-15 11:26:30,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:26:30,563 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 1128 transitions. [2019-02-15 11:26:30,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:26:30,563 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:30,564 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:26:30,564 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:30,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:30,564 INFO L82 PathProgramCache]: Analyzing trace with hash 28818278, now seen corresponding path program 1 times [2019-02-15 11:26:30,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:30,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:30,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:30,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:30,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:30,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:30,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:30,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:30,755 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:26:30,756 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [27] [2019-02-15 11:26:30,757 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:30,757 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:31,250 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:31,250 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:26:31,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:31,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:31,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:31,251 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:31,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:31,268 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:31,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:31,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:31,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 48 treesize of output 54 [2019-02-15 11:26:31,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:31,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:31,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:26:31,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:31,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:31,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:31,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:31,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:26:31,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:31,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:31,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:31,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:31,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:31,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:31,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:26:31,488 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:31,504 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:31,519 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:31,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:31,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:26:31,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:26:31,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:26:31,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:26:31,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:26:31,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-15 11:26:31,578 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:31,603 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:31,623 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:31,638 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:31,650 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:31,662 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:31,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:31,694 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-15 11:26:31,941 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-02-15 11:26:31,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:31,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-02-15 11:26:31,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:26:32,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-02-15 11:26:32,068 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:109 [2019-02-15 11:26:32,341 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-02-15 11:26:32,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 103 [2019-02-15 11:26:32,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:26:32,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 89 [2019-02-15 11:26:32,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:32,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-02-15 11:26:32,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:129, output treesize:125 [2019-02-15 11:26:32,853 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-02-15 11:26:32,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,893 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:32,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 118 [2019-02-15 11:26:32,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-15 11:26:33,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:33,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:33,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:33,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:33,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:33,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:33,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:33,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:33,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:33,222 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:33,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:33,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 88 [2019-02-15 11:26:33,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:33,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:33,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:33,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:33,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:33,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:33,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:33,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:33,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:33,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:33,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:33,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:33,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:33,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:33,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 110 [2019-02-15 11:26:33,389 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:33,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-02-15 11:26:33,544 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:156, output treesize:242 [2019-02-15 11:26:33,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:33,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:33,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:33,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:33,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:26:33,735 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:33,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:26:33,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:26:33,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:26:33,735 INFO L87 Difference]: Start difference. First operand 181 states and 1128 transitions. Second operand 10 states. [2019-02-15 11:26:34,374 WARN L181 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-02-15 11:26:34,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:34,971 INFO L93 Difference]: Finished difference Result 280 states and 1534 transitions. [2019-02-15 11:26:34,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:26:34,971 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:26:34,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:34,976 INFO L225 Difference]: With dead ends: 280 [2019-02-15 11:26:34,976 INFO L226 Difference]: Without dead ends: 279 [2019-02-15 11:26:34,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:26:34,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-02-15 11:26:35,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 185. [2019-02-15 11:26:35,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-02-15 11:26:35,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 1156 transitions. [2019-02-15 11:26:35,021 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 1156 transitions. Word has length 5 [2019-02-15 11:26:35,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:35,021 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 1156 transitions. [2019-02-15 11:26:35,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:26:35,022 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 1156 transitions. [2019-02-15 11:26:35,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:26:35,023 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:35,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:26:35,023 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:35,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:35,023 INFO L82 PathProgramCache]: Analyzing trace with hash 28835766, now seen corresponding path program 1 times [2019-02-15 11:26:35,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:35,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:35,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:35,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:35,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:35,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:26:35,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:26:35,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-15 11:26:35,165 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:26:35,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:26:35,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:26:35,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-15 11:26:35,166 INFO L87 Difference]: Start difference. First operand 185 states and 1156 transitions. Second operand 4 states. [2019-02-15 11:26:35,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:35,283 INFO L93 Difference]: Finished difference Result 201 states and 1179 transitions. [2019-02-15 11:26:35,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 11:26:35,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-15 11:26:35,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:35,286 INFO L225 Difference]: With dead ends: 201 [2019-02-15 11:26:35,286 INFO L226 Difference]: Without dead ends: 198 [2019-02-15 11:26:35,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-15 11:26:35,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-02-15 11:26:35,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 187. [2019-02-15 11:26:35,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-02-15 11:26:35,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 1164 transitions. [2019-02-15 11:26:35,331 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 1164 transitions. Word has length 5 [2019-02-15 11:26:35,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:35,331 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 1164 transitions. [2019-02-15 11:26:35,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:26:35,332 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 1164 transitions. [2019-02-15 11:26:35,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:26:35,333 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:35,333 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:26:35,333 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:35,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:35,333 INFO L82 PathProgramCache]: Analyzing trace with hash 28822248, now seen corresponding path program 1 times [2019-02-15 11:26:35,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:35,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:35,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:35,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:35,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:35,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:26:35,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:35,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:35,696 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:26:35,696 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [28], [29] [2019-02-15 11:26:35,697 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:35,697 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:36,093 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:36,093 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:26:36,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:36,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:36,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:36,094 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:36,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:36,110 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:36,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:36,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:36,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:36,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 48 treesize of output 54 [2019-02-15 11:26:36,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:36,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:36,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:26:36,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:36,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:36,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:36,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:36,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:26:36,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:36,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:36,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:36,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:36,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:36,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:36,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:26:36,318 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:36,339 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:36,357 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:36,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:36,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:26:36,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:26:36,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:26:36,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:26:36,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:26:36,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-15 11:26:36,427 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:36,454 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:36,474 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:36,490 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:36,503 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:36,515 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:36,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:36,548 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-15 11:26:36,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:36,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:26:36,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:36,613 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-02-15 11:26:36,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 11:26:36,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:36,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:36,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:36,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:36,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:36,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:36,639 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:36,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 11:26:36,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:36,672 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-02-15 11:26:36,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-02-15 11:26:36,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:36,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:36,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:36,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:36,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:26:36,734 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:36,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:26:36,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:26:36,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:26:36,735 INFO L87 Difference]: Start difference. First operand 187 states and 1164 transitions. Second operand 8 states. [2019-02-15 11:26:37,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:37,055 INFO L93 Difference]: Finished difference Result 208 states and 1202 transitions. [2019-02-15 11:26:37,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:26:37,056 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:26:37,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:37,059 INFO L225 Difference]: With dead ends: 208 [2019-02-15 11:26:37,059 INFO L226 Difference]: Without dead ends: 207 [2019-02-15 11:26:37,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:26:37,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-02-15 11:26:37,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 189. [2019-02-15 11:26:37,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-02-15 11:26:37,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 1178 transitions. [2019-02-15 11:26:37,102 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 1178 transitions. Word has length 5 [2019-02-15 11:26:37,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:37,102 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 1178 transitions. [2019-02-15 11:26:37,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:26:37,103 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 1178 transitions. [2019-02-15 11:26:37,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:26:37,103 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:37,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:26:37,104 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:37,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:37,104 INFO L82 PathProgramCache]: Analyzing trace with hash 29302748, now seen corresponding path program 1 times [2019-02-15 11:26:37,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:37,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:37,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:37,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:37,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:37,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:37,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:37,172 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:37,172 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:26:37,173 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [28], [29] [2019-02-15 11:26:37,173 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:37,173 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:37,437 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:37,437 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:26:37,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:37,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:37,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:37,437 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:37,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:37,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:37,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:37,459 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:26:37,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:26:37,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:26:37,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:26:37,588 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:37,636 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:37,656 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:37,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:37,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:26:37,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:26:37,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:26:37,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:26:37,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:26:37,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-15 11:26:37,732 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:37,755 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:37,774 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:37,788 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:37,800 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:37,810 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:37,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:37,840 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-15 11:26:37,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-15 11:26:37,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:37,908 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-02-15 11:26:37,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-15 11:26:37,929 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 74 [2019-02-15 11:26:37,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:37,964 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-02-15 11:26:37,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:34 [2019-02-15 11:26:37,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:37,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:38,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:38,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:38,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:26:38,023 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:38,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:26:38,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:26:38,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:26:38,024 INFO L87 Difference]: Start difference. First operand 189 states and 1178 transitions. Second operand 8 states. [2019-02-15 11:26:38,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:38,327 INFO L93 Difference]: Finished difference Result 210 states and 1196 transitions. [2019-02-15 11:26:38,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:26:38,328 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:26:38,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:38,331 INFO L225 Difference]: With dead ends: 210 [2019-02-15 11:26:38,331 INFO L226 Difference]: Without dead ends: 208 [2019-02-15 11:26:38,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:26:38,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-02-15 11:26:38,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2019-02-15 11:26:38,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-02-15 11:26:38,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 1179 transitions. [2019-02-15 11:26:38,366 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 1179 transitions. Word has length 5 [2019-02-15 11:26:38,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:38,366 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 1179 transitions. [2019-02-15 11:26:38,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:26:38,366 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 1179 transitions. [2019-02-15 11:26:38,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:26:38,367 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:38,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:26:38,367 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:38,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:38,367 INFO L82 PathProgramCache]: Analyzing trace with hash 29308202, now seen corresponding path program 2 times [2019-02-15 11:26:38,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:38,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:38,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:38,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:38,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:38,442 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:38,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:38,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:38,442 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:26:38,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:26:38,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:38,443 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:38,452 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:26:38,452 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:26:38,461 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:26:38,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:26:38,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:38,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 68 treesize of output 71 [2019-02-15 11:26:38,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:26:38,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:26:38,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:26:38,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,716 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-15 11:26:38,725 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:38,754 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:38,785 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:38,818 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:38,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:38,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:26:38,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:26:38,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:26:38,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:26:38,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:26:38,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:26:38,909 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:39,127 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:39,148 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:39,165 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:39,177 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:39,187 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:39,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:39,233 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-15 11:26:39,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 11:26:39,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:39,311 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-02-15 11:26:39,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 11:26:39,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-02-15 11:26:39,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:39,395 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-02-15 11:26:39,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-02-15 11:26:39,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,435 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:39,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 124 [2019-02-15 11:26:39,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:39,489 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-02-15 11:26:39,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-02-15 11:26:39,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:39,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:39,553 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:39,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:39,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:26:39,572 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:39,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:26:39,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:26:39,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:26:39,573 INFO L87 Difference]: Start difference. First operand 191 states and 1179 transitions. Second operand 10 states. [2019-02-15 11:26:41,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:41,112 INFO L93 Difference]: Finished difference Result 242 states and 1308 transitions. [2019-02-15 11:26:41,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:26:41,112 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:26:41,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:41,115 INFO L225 Difference]: With dead ends: 242 [2019-02-15 11:26:41,115 INFO L226 Difference]: Without dead ends: 240 [2019-02-15 11:26:41,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:26:41,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-02-15 11:26:41,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 202. [2019-02-15 11:26:41,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-02-15 11:26:41,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1251 transitions. [2019-02-15 11:26:41,156 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1251 transitions. Word has length 5 [2019-02-15 11:26:41,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:41,156 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1251 transitions. [2019-02-15 11:26:41,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:26:41,156 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1251 transitions. [2019-02-15 11:26:41,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:26:41,157 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:41,157 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:26:41,158 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:41,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:41,158 INFO L82 PathProgramCache]: Analyzing trace with hash 29307954, now seen corresponding path program 1 times [2019-02-15 11:26:41,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:41,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:41,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:26:41,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:41,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:41,303 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-15 11:26:41,368 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:41,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:41,368 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:41,369 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:26:41,369 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [27] [2019-02-15 11:26:41,370 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:41,370 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:41,679 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:41,680 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:26:41,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:41,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:41,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:41,680 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:41,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:41,690 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:41,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:41,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:26:41,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:26:41,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:26:41,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:26:41,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:26:41,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:26:41,774 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:41,812 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:41,835 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:41,853 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:41,868 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:41,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:41,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 68 treesize of output 71 [2019-02-15 11:26:41,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:26:41,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:26:42,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:26:42,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-15 11:26:42,128 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:42,152 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:42,177 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:42,203 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:42,228 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:42,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:42,274 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-15 11:26:42,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 11:26:42,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:42,353 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-02-15 11:26:42,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 11:26:42,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-02-15 11:26:42,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:42,436 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-02-15 11:26:42,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-02-15 11:26:42,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:42,504 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:42,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 134 [2019-02-15 11:26:42,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:42,559 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-02-15 11:26:42,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-02-15 11:26:42,581 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:42,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:42,620 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:42,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:42,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:26:42,638 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:42,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:26:42,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:26:42,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:26:42,639 INFO L87 Difference]: Start difference. First operand 202 states and 1251 transitions. Second operand 10 states. [2019-02-15 11:26:43,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:43,239 INFO L93 Difference]: Finished difference Result 249 states and 1369 transitions. [2019-02-15 11:26:43,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:26:43,239 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:26:43,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:43,242 INFO L225 Difference]: With dead ends: 249 [2019-02-15 11:26:43,243 INFO L226 Difference]: Without dead ends: 247 [2019-02-15 11:26:43,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:26:43,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-02-15 11:26:43,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 212. [2019-02-15 11:26:43,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-02-15 11:26:43,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 1326 transitions. [2019-02-15 11:26:43,276 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 1326 transitions. Word has length 5 [2019-02-15 11:26:43,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:43,276 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 1326 transitions. [2019-02-15 11:26:43,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:26:43,276 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 1326 transitions. [2019-02-15 11:26:43,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:26:43,277 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:43,277 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:26:43,277 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:43,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:43,277 INFO L82 PathProgramCache]: Analyzing trace with hash 29294624, now seen corresponding path program 1 times [2019-02-15 11:26:43,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:43,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:43,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:43,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:43,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:43,378 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:43,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:43,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:43,379 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:26:43,379 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [22], [27] [2019-02-15 11:26:43,380 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:43,380 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:43,686 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:43,686 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:26:43,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:43,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:43,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:43,687 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:43,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:43,695 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:43,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:43,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:26:43,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:26:43,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:43,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:43,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:26:43,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:43,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:43,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:43,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:26:43,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:43,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:43,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:43,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:43,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:26:43,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-15 11:26:43,779 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:43,808 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:43,830 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:43,846 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:43,860 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:43,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:43,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:43,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 48 treesize of output 54 [2019-02-15 11:26:43,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:43,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:43,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:26:43,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:43,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:43,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:43,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:43,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:26:44,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:44,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:44,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:44,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:44,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:44,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:44,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:26:44,021 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:44,038 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:44,053 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:44,069 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:44,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:44,102 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-15 11:26:44,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:44,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:26:44,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:44,188 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-02-15 11:26:44,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-15 11:26:44,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:44,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:44,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:44,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:44,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:44,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:44,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:44,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 11:26:44,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:44,254 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-02-15 11:26:44,254 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-02-15 11:26:44,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:44,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:44,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:44,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:44,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:44,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:44,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:44,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:44,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:44,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:44,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:44,293 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:44,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 11:26:44,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:44,355 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-02-15 11:26:44,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-02-15 11:26:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:44,375 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:44,414 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:44,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:44,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:26:44,433 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:44,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:26:44,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:26:44,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:26:44,434 INFO L87 Difference]: Start difference. First operand 212 states and 1326 transitions. Second operand 10 states. [2019-02-15 11:26:46,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:46,988 INFO L93 Difference]: Finished difference Result 260 states and 1437 transitions. [2019-02-15 11:26:46,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:26:46,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:26:46,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:46,992 INFO L225 Difference]: With dead ends: 260 [2019-02-15 11:26:46,992 INFO L226 Difference]: Without dead ends: 258 [2019-02-15 11:26:46,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=109, Invalid=196, Unknown=1, NotChecked=0, Total=306 [2019-02-15 11:26:46,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-02-15 11:26:47,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 221. [2019-02-15 11:26:47,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-02-15 11:26:47,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1389 transitions. [2019-02-15 11:26:47,026 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1389 transitions. Word has length 5 [2019-02-15 11:26:47,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:47,026 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1389 transitions. [2019-02-15 11:26:47,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:26:47,026 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1389 transitions. [2019-02-15 11:26:47,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:26:47,027 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:47,027 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:26:47,027 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:47,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:47,027 INFO L82 PathProgramCache]: Analyzing trace with hash 29298904, now seen corresponding path program 1 times [2019-02-15 11:26:47,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:47,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:47,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:47,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:47,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:47,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:47,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:47,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:47,175 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:26:47,175 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [28], [29] [2019-02-15 11:26:47,176 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:47,176 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:47,388 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:47,388 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:26:47,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:47,388 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:47,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:47,389 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:47,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:47,397 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:47,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:47,407 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:26:47,414 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:26:47,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:26:47,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:26:47,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:26:47,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-15 11:26:47,473 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:47,514 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:47,536 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:47,554 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:47,568 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:47,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:47,607 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-02-15 11:26:47,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-02-15 11:26:47,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 11:26:47,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 11:26:47,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:26:47,793 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:47,818 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:47,842 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:47,866 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:47,893 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:47,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:47,937 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-02-15 11:26:47,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-02-15 11:26:47,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:48,008 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-02-15 11:26:48,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-02-15 11:26:48,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:48,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:48,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:48,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:48,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:48,036 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:48,037 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:48,038 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:48,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 101 [2019-02-15 11:26:48,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:48,082 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-02-15 11:26:48,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:55 [2019-02-15 11:26:48,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:48,105 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:48,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:48,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:48,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:26:48,145 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:48,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:26:48,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:26:48,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:26:48,146 INFO L87 Difference]: Start difference. First operand 221 states and 1389 transitions. Second operand 8 states. [2019-02-15 11:26:48,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:48,473 INFO L93 Difference]: Finished difference Result 244 states and 1417 transitions. [2019-02-15 11:26:48,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:26:48,474 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:26:48,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:48,477 INFO L225 Difference]: With dead ends: 244 [2019-02-15 11:26:48,477 INFO L226 Difference]: Without dead ends: 243 [2019-02-15 11:26:48,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:26:48,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-02-15 11:26:48,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 221. [2019-02-15 11:26:48,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-02-15 11:26:48,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1389 transitions. [2019-02-15 11:26:48,522 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1389 transitions. Word has length 5 [2019-02-15 11:26:48,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:48,523 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1389 transitions. [2019-02-15 11:26:48,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:26:48,523 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1389 transitions. [2019-02-15 11:26:48,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:26:48,524 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:48,524 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:26:48,524 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:48,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:48,524 INFO L82 PathProgramCache]: Analyzing trace with hash 29366174, now seen corresponding path program 1 times [2019-02-15 11:26:48,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:48,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:48,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:48,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:48,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:48,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:48,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:48,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:48,762 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:26:48,762 INFO L207 CegarAbsIntRunner]: [0], [22], [24], [28], [29] [2019-02-15 11:26:48,763 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:48,763 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:48,992 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:48,992 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:26:48,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:48,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:48,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:48,993 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:49,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:49,002 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:49,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:49,013 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:26:49,017 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:26:49,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:49,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:49,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:26:49,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:49,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:49,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:49,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:26:49,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:49,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:49,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:49,060 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:49,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:26:49,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-15 11:26:49,077 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:49,104 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:49,123 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:49,139 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:49,152 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:49,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:49,187 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:26:49,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:49,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:49,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:26:49,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:49,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:49,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:49,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:49,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:26:49,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:49,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:49,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:49,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:49,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:49,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:49,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:26:49,290 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:49,305 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:49,319 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:49,335 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:49,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:49,365 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-15 11:26:49,564 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-02-15 11:26:49,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:49,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 41 treesize of output 87 [2019-02-15 11:26:49,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-02-15 11:26:49,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 7 xjuncts. [2019-02-15 11:26:49,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:381 [2019-02-15 11:26:50,306 WARN L181 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 84 [2019-02-15 11:26:50,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 84 [2019-02-15 11:26:50,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:50,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 71 [2019-02-15 11:26:50,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:50,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,502 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:50,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 80 [2019-02-15 11:26:50,503 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:50,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-02-15 11:26:50,568 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:182, output treesize:126 [2019-02-15 11:26:51,028 WARN L181 SmtUtils]: Spent 440.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-02-15 11:26:51,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:51,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:51,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:51,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:51,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:26:51,089 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:51,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:26:51,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:26:51,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:26:51,089 INFO L87 Difference]: Start difference. First operand 221 states and 1389 transitions. Second operand 8 states. [2019-02-15 11:26:51,496 WARN L181 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-02-15 11:27:04,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:04,416 INFO L93 Difference]: Finished difference Result 273 states and 1446 transitions. [2019-02-15 11:27:04,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:27:04,417 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:27:04,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:04,420 INFO L225 Difference]: With dead ends: 273 [2019-02-15 11:27:04,420 INFO L226 Difference]: Without dead ends: 272 [2019-02-15 11:27:04,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=79, Invalid=130, Unknown=1, NotChecked=0, Total=210 [2019-02-15 11:27:04,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-02-15 11:27:04,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 222. [2019-02-15 11:27:04,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-02-15 11:27:04,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 1396 transitions. [2019-02-15 11:27:04,457 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 1396 transitions. Word has length 5 [2019-02-15 11:27:04,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:04,457 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 1396 transitions. [2019-02-15 11:27:04,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:27:04,457 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 1396 transitions. [2019-02-15 11:27:04,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:27:04,458 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:04,458 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:27:04,458 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:04,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:04,458 INFO L82 PathProgramCache]: Analyzing trace with hash 29353958, now seen corresponding path program 2 times [2019-02-15 11:27:04,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:04,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:04,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:04,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:04,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:04,567 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:04,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:04,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:04,567 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:27:04,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:27:04,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:04,568 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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:27:04,578 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:27:04,578 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:27:04,585 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:27:04,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:27:04,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:04,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:27:04,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:27:04,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:04,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:04,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:27:04,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:04,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:04,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:04,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:27:04,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:04,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:04,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:04,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:04,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:27:04,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:04,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:04,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:04,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:04,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:04,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:27:04,640 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:04,683 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:04,707 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:04,724 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:04,739 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:04,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:04,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:04,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 68 treesize of output 71 [2019-02-15 11:27:04,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:04,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:04,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:27:04,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:04,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:04,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:04,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:04,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:27:04,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:04,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:04,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:04,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:04,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:04,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:04,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:27:05,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:05,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:05,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:05,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:05,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:05,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:05,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:05,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:05,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-15 11:27:05,023 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:05,049 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:05,074 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:05,100 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:05,126 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:05,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:05,172 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-15 11:27:05,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:05,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 11:27:05,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:05,247 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-02-15 11:27:05,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 11:27:05,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:05,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:05,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:05,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:05,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:05,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:05,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:05,278 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:05,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 112 [2019-02-15 11:27:05,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:05,327 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-02-15 11:27:05,328 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-02-15 11:27:05,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:05,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:05,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:05,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:05,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:05,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:05,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:05,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:05,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:05,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:05,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:05,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 115 [2019-02-15 11:27:05,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:05,414 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-02-15 11:27:05,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-02-15 11:27:05,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:05,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:05,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:05,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:05,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:27:05,474 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:05,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:27:05,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:27:05,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:27:05,475 INFO L87 Difference]: Start difference. First operand 222 states and 1396 transitions. Second operand 10 states. [2019-02-15 11:27:06,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:06,243 INFO L93 Difference]: Finished difference Result 274 states and 1519 transitions. [2019-02-15 11:27:06,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:27:06,243 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:27:06,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:06,247 INFO L225 Difference]: With dead ends: 274 [2019-02-15 11:27:06,247 INFO L226 Difference]: Without dead ends: 273 [2019-02-15 11:27:06,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:27:06,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-02-15 11:27:06,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 225. [2019-02-15 11:27:06,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-02-15 11:27:06,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1417 transitions. [2019-02-15 11:27:06,287 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1417 transitions. Word has length 5 [2019-02-15 11:27:06,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:06,287 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1417 transitions. [2019-02-15 11:27:06,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:27:06,287 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1417 transitions. [2019-02-15 11:27:06,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:27:06,288 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:06,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:27:06,288 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:06,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:06,288 INFO L82 PathProgramCache]: Analyzing trace with hash 29372004, now seen corresponding path program 1 times [2019-02-15 11:27:06,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:06,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:06,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:27:06,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:06,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:06,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:06,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:06,321 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:06,321 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:27:06,321 INFO L207 CegarAbsIntRunner]: [0], [24], [28], [30], [31] [2019-02-15 11:27:06,322 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:06,322 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:07,722 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:07,723 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:27:07,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:07,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:07,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:07,723 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:27:07,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:07,731 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:07,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:07,742 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-02-15 11:27:07,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:07,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:07,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-02-15 11:27:07,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:07,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:07,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:07,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:07,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 11:27:07,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:07,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:07,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:07,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:07,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:07,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:07,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 11:27:07,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:07,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:07,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:07,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:07,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:07,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:07,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:07,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:07,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:27:07,949 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:07,972 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:07,996 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:08,021 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:08,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:08,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:27:08,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:27:08,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:27:08,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:27:08,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:27:08,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-15 11:27:08,104 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:08,136 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:08,155 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:08,170 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:08,182 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:08,194 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:08,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:08,237 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:84, output treesize:87 [2019-02-15 11:27:08,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:08,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-02-15 11:27:08,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:08,303 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-02-15 11:27:08,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:97, output treesize:67 [2019-02-15 11:27:08,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:08,321 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:08,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:08,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:08,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 11:27:08,348 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:08,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 11:27:08,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 11:27:08,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:27:08,349 INFO L87 Difference]: Start difference. First operand 225 states and 1417 transitions. Second operand 6 states. [2019-02-15 11:27:08,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:08,556 INFO L93 Difference]: Finished difference Result 242 states and 1433 transitions. [2019-02-15 11:27:08,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 11:27:08,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-02-15 11:27:08,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:08,560 INFO L225 Difference]: With dead ends: 242 [2019-02-15 11:27:08,560 INFO L226 Difference]: Without dead ends: 241 [2019-02-15 11:27:08,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 11:27:08,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-02-15 11:27:08,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 225. [2019-02-15 11:27:08,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-02-15 11:27:08,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1417 transitions. [2019-02-15 11:27:08,605 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1417 transitions. Word has length 5 [2019-02-15 11:27:08,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:08,606 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1417 transitions. [2019-02-15 11:27:08,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 11:27:08,606 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1417 transitions. [2019-02-15 11:27:08,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:27:08,607 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:08,607 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:27:08,607 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:08,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:08,607 INFO L82 PathProgramCache]: Analyzing trace with hash 29357926, now seen corresponding path program 1 times [2019-02-15 11:27:08,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:08,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:08,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:08,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:08,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:08,785 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2019-02-15 11:27:08,820 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:08,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:08,821 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:08,821 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:27:08,821 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [27] [2019-02-15 11:27:08,822 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:08,822 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:09,483 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:09,483 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:27:09,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:09,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:09,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:09,484 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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:27:09,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:09,493 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:09,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:09,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 68 treesize of output 71 [2019-02-15 11:27:09,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:27:09,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:27:09,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:27:09,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,747 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-15 11:27:09,755 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:09,780 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:09,807 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:09,834 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:09,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:09,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:27:09,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:27:09,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:27:09,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:27:09,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:27:09,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:27:09,914 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:09,950 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:09,971 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:09,987 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:10,000 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:10,012 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:10,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:10,059 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-15 11:27:10,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 11:27:10,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:10,147 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-02-15 11:27:10,148 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 11:27:10,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,182 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,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, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-02-15 11:27:10,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:10,235 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-02-15 11:27:10,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-15 11:27:10,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,273 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:10,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 128 [2019-02-15 11:27:10,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:10,326 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-02-15 11:27:10,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-02-15 11:27:10,348 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:10,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:10,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:10,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:10,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:27:10,403 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:10,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:27:10,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:27:10,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:27:10,404 INFO L87 Difference]: Start difference. First operand 225 states and 1417 transitions. Second operand 10 states. [2019-02-15 11:27:11,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:11,067 INFO L93 Difference]: Finished difference Result 276 states and 1527 transitions. [2019-02-15 11:27:11,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:27:11,068 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:27:11,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:11,071 INFO L225 Difference]: With dead ends: 276 [2019-02-15 11:27:11,071 INFO L226 Difference]: Without dead ends: 274 [2019-02-15 11:27:11,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:27:11,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-02-15 11:27:11,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 234. [2019-02-15 11:27:11,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-02-15 11:27:11,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 1480 transitions. [2019-02-15 11:27:11,118 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 1480 transitions. Word has length 5 [2019-02-15 11:27:11,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:11,118 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 1480 transitions. [2019-02-15 11:27:11,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:27:11,118 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 1480 transitions. [2019-02-15 11:27:11,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:27:11,119 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:11,119 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:27:11,119 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:11,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:11,119 INFO L82 PathProgramCache]: Analyzing trace with hash 28933724, now seen corresponding path program 1 times [2019-02-15 11:27:11,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:11,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:11,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:11,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:11,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:11,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:11,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:11,189 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:11,189 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:27:11,189 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [28], [29] [2019-02-15 11:27:11,190 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:11,190 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:11,462 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:11,463 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:27:11,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:11,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:11,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:11,463 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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:27:11,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:11,471 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:11,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:11,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 48 treesize of output 54 [2019-02-15 11:27:11,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:27:11,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:27:11,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:27:11,640 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:11,657 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:11,674 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:11,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:11,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:27:11,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:27:11,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:27:11,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:27:11,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:27:11,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-15 11:27:11,733 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:11,758 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:11,779 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:11,793 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:11,806 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:11,818 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:11,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:11,851 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-02-15 11:27:11,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:27:11,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:12,039 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-02-15 11:27:12,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 11:27:12,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:12,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:12,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:12,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:12,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:12,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:12,060 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:12,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 11:27:12,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:12,095 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-02-15 11:27:12,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-02-15 11:27:12,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:12,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:12,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:12,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:12,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:27:12,156 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:12,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:27:12,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:27:12,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:27:12,157 INFO L87 Difference]: Start difference. First operand 234 states and 1480 transitions. Second operand 8 states. [2019-02-15 11:27:12,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:12,554 INFO L93 Difference]: Finished difference Result 288 states and 1635 transitions. [2019-02-15 11:27:12,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:27:12,554 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:27:12,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:12,558 INFO L225 Difference]: With dead ends: 288 [2019-02-15 11:27:12,558 INFO L226 Difference]: Without dead ends: 287 [2019-02-15 11:27:12,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-15 11:27:12,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-02-15 11:27:12,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 250. [2019-02-15 11:27:12,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-02-15 11:27:12,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 1595 transitions. [2019-02-15 11:27:12,603 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 1595 transitions. Word has length 5 [2019-02-15 11:27:12,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:12,603 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 1595 transitions. [2019-02-15 11:27:12,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:27:12,603 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 1595 transitions. [2019-02-15 11:27:12,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:27:12,604 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:12,604 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:27:12,604 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:12,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:12,604 INFO L82 PathProgramCache]: Analyzing trace with hash 28941412, now seen corresponding path program 1 times [2019-02-15 11:27:12,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:12,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:12,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:12,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:12,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:12,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:12,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:12,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:12,757 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:27:12,758 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [28], [29] [2019-02-15 11:27:12,759 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:12,759 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:12,974 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:12,974 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:27:12,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:12,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:12,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:12,974 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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:27:12,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:12,983 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:12,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:12,994 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:27:12,999 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:27:13,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:27:13,026 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:27:13,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:27:13,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-15 11:27:13,053 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:13,081 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:13,102 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:13,118 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:13,131 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:13,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:13,167 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:27:13,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:27:13,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:27:13,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:27:13,266 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:13,281 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:13,295 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:13,311 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:13,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:13,342 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-02-15 11:27:13,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:27:13,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:27:13,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:27:13,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-02-15 11:27:13,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 11:27:13,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:13,538 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-02-15 11:27:13,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:27 [2019-02-15 11:27:13,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:13,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:13,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:13,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:13,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 11:27:13,588 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:13,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:27:13,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:27:13,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:27:13,589 INFO L87 Difference]: Start difference. First operand 250 states and 1595 transitions. Second operand 8 states. [2019-02-15 11:27:13,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:13,992 INFO L93 Difference]: Finished difference Result 319 states and 1823 transitions. [2019-02-15 11:27:13,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:27:13,992 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:27:13,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:13,997 INFO L225 Difference]: With dead ends: 319 [2019-02-15 11:27:13,997 INFO L226 Difference]: Without dead ends: 318 [2019-02-15 11:27:13,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:27:13,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-02-15 11:27:14,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 276. [2019-02-15 11:27:14,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-02-15 11:27:14,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 1782 transitions. [2019-02-15 11:27:14,055 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 1782 transitions. Word has length 5 [2019-02-15 11:27:14,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:14,055 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 1782 transitions. [2019-02-15 11:27:14,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:27:14,055 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 1782 transitions. [2019-02-15 11:27:14,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:27:14,056 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:14,056 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-15 11:27:14,056 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:14,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:14,056 INFO L82 PathProgramCache]: Analyzing trace with hash 904691166, now seen corresponding path program 1 times [2019-02-15 11:27:14,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:14,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:14,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:14,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:14,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:14,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:27:14,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:14,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:14,094 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:27:14,094 INFO L207 CegarAbsIntRunner]: [0], [18], [28], [30], [31] [2019-02-15 11:27:14,095 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:14,095 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:14,257 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:14,257 INFO L272 AbstractInterpreter]: Visited 5 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:27:14,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:14,258 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:14,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:14,258 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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:27:14,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:14,267 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:14,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:14,280 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:27:14,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:14,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:14,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:27:14,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:14,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:14,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:14,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:14,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:27:14,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:14,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:14,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:14,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:14,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:14,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:14,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:27:14,403 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:14,423 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:14,442 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:14,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:14,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:27:14,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:27:14,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:27:14,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:27:14,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:27:14,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-15 11:27:14,520 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:14,545 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:14,563 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:14,577 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:14,589 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:14,601 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:14,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:14,632 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-02-15 11:27:14,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:14,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-15 11:27:14,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:14,713 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-02-15 11:27:14,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-15 11:27:14,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:14,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:14,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:14,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:14,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:14,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:14,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:14,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 74 [2019-02-15 11:27:14,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:14,770 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-02-15 11:27:14,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:46 [2019-02-15 11:27:14,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:14,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:14,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:14,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:14,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-15 11:27:14,824 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:14,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-15 11:27:14,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-15 11:27:14,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:27:14,824 INFO L87 Difference]: Start difference. First operand 276 states and 1782 transitions. Second operand 7 states. [2019-02-15 11:27:15,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:15,035 INFO L93 Difference]: Finished difference Result 290 states and 1801 transitions. [2019-02-15 11:27:15,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:27:15,035 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-02-15 11:27:15,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:15,040 INFO L225 Difference]: With dead ends: 290 [2019-02-15 11:27:15,040 INFO L226 Difference]: Without dead ends: 289 [2019-02-15 11:27:15,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:27:15,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-02-15 11:27:15,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 276. [2019-02-15 11:27:15,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-02-15 11:27:15,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 1782 transitions. [2019-02-15 11:27:15,090 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 1782 transitions. Word has length 6 [2019-02-15 11:27:15,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:15,090 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 1782 transitions. [2019-02-15 11:27:15,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-15 11:27:15,090 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 1782 transitions. [2019-02-15 11:27:15,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:27:15,092 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:15,092 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-02-15 11:27:15,092 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:15,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:15,092 INFO L82 PathProgramCache]: Analyzing trace with hash 904323688, now seen corresponding path program 3 times [2019-02-15 11:27:15,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:15,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:15,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:15,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:15,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:15,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:27:15,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:15,270 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:15,270 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:27:15,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:27:15,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:15,271 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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:27:15,278 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:27:15,278 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:27:15,283 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:27:15,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:27:15,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:15,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:27:15,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:27:15,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:27:15,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:27:15,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:27:15,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-15 11:27:15,332 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:15,363 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:15,386 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:15,404 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:15,419 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:15,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:15,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 48 treesize of output 54 [2019-02-15 11:27:15,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:27:15,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:27:15,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,579 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:27:15,583 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:15,600 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:15,615 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:15,631 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:15,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:15,664 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-02-15 11:27:15,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 11:27:15,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:15,726 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-02-15 11:27:15,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 11:27:15,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 11:27:15,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:15,865 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-02-15 11:27:15,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-02-15 11:27:15,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 11:27:15,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:15,934 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-02-15 11:27:15,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-02-15 11:27:15,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 11:27:15,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:16,009 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-02-15 11:27:16,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-15 11:27:16,028 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:16,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:16,062 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:16,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:16,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-15 11:27:16,082 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:16,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:27:16,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:27:16,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:27:16,082 INFO L87 Difference]: Start difference. First operand 276 states and 1782 transitions. Second operand 11 states. [2019-02-15 11:27:16,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:16,720 INFO L93 Difference]: Finished difference Result 423 states and 2543 transitions. [2019-02-15 11:27:16,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:27:16,721 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-15 11:27:16,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:16,725 INFO L225 Difference]: With dead ends: 423 [2019-02-15 11:27:16,725 INFO L226 Difference]: Without dead ends: 421 [2019-02-15 11:27:16,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:27:16,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-02-15 11:27:16,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 325. [2019-02-15 11:27:16,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-02-15 11:27:16,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 2130 transitions. [2019-02-15 11:27:16,856 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 2130 transitions. Word has length 6 [2019-02-15 11:27:16,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:16,857 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 2130 transitions. [2019-02-15 11:27:16,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:27:16,857 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 2130 transitions. [2019-02-15 11:27:16,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:27:16,859 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:16,859 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:27:16,859 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:16,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:16,860 INFO L82 PathProgramCache]: Analyzing trace with hash 904327844, now seen corresponding path program 1 times [2019-02-15 11:27:16,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:16,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:16,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:27:16,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:16,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:17,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:27:17,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:17,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:17,206 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:27:17,206 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [28], [29] [2019-02-15 11:27:17,207 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:17,207 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:17,626 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:17,626 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:27:17,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:17,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:17,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:17,627 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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:27:17,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:17,648 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:17,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:17,865 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-02-15 11:27:17,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:27:17,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:27:17,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:17,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:17,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:27:17,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,028 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:27:18,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,140 INFO L303 Elim1Store]: Index analysis took 109 ms [2019-02-15 11:27:18,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:27:18,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,264 INFO L303 Elim1Store]: Index analysis took 120 ms [2019-02-15 11:27:18,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:27:18,266 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:18,800 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:19,100 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:19,331 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:19,513 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:19,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:19,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:19,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 68 treesize of output 71 [2019-02-15 11:27:20,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:27:20,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:27:20,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:27:20,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,182 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-15 11:27:20,186 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:20,210 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:20,235 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:20,261 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:20,287 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:20,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:20,334 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-15 11:27:20,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 11:27:20,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:20,410 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-02-15 11:27:20,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 11:27:20,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-02-15 11:27:20,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:20,494 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-02-15 11:27:20,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-15 11:27:20,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:20,538 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:20,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 119 [2019-02-15 11:27:20,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:20,589 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-02-15 11:27:20,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-15 11:27:20,614 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:20,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:20,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:20,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:20,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:27:20,770 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:20,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:27:20,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:27:20,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:27:20,771 INFO L87 Difference]: Start difference. First operand 325 states and 2130 transitions. Second operand 10 states. [2019-02-15 11:27:21,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:21,459 INFO L93 Difference]: Finished difference Result 368 states and 2210 transitions. [2019-02-15 11:27:21,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:27:21,460 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:27:21,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:21,464 INFO L225 Difference]: With dead ends: 368 [2019-02-15 11:27:21,464 INFO L226 Difference]: Without dead ends: 366 [2019-02-15 11:27:21,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:27:21,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-02-15 11:27:21,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 329. [2019-02-15 11:27:21,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-02-15 11:27:21,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 2135 transitions. [2019-02-15 11:27:21,529 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 2135 transitions. Word has length 6 [2019-02-15 11:27:21,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:21,529 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 2135 transitions. [2019-02-15 11:27:21,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:27:21,529 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 2135 transitions. [2019-02-15 11:27:21,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:27:21,530 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:21,530 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-15 11:27:21,531 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:21,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:21,531 INFO L82 PathProgramCache]: Analyzing trace with hash 904329640, now seen corresponding path program 3 times [2019-02-15 11:27:21,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:21,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:21,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:21,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:21,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:21,585 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:27:21,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:21,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:21,585 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:27:21,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:27:21,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:21,586 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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:27:21,595 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:27:21,595 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:27:21,600 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:27:21,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:27:21,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:21,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:27:21,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:27:21,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:27:21,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:27:21,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:27:21,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:27:21,661 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:21,702 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:21,725 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:21,744 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:21,758 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:21,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:21,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 68 treesize of output 71 [2019-02-15 11:27:21,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:27:21,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:27:21,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:27:22,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-15 11:27:22,016 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:22,042 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:22,068 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:22,094 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:22,120 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:22,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:22,166 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-15 11:27:22,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 11:27:22,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:22,235 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-02-15 11:27:22,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 11:27:22,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-02-15 11:27:22,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:22,319 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-02-15 11:27:22,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-15 11:27:22,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,354 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:22,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-02-15 11:27:22,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:22,406 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-02-15 11:27:22,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-02-15 11:27:22,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 135 [2019-02-15 11:27:22,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:22,510 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-02-15 11:27:22,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:45 [2019-02-15 11:27:22,533 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:22,533 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:22,577 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:22,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:22,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-15 11:27:22,596 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:22,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:27:22,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:27:22,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:27:22,596 INFO L87 Difference]: Start difference. First operand 329 states and 2135 transitions. Second operand 11 states. [2019-02-15 11:27:23,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:23,392 INFO L93 Difference]: Finished difference Result 407 states and 2353 transitions. [2019-02-15 11:27:23,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:27:23,393 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-15 11:27:23,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:23,398 INFO L225 Difference]: With dead ends: 407 [2019-02-15 11:27:23,398 INFO L226 Difference]: Without dead ends: 401 [2019-02-15 11:27:23,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:27:23,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2019-02-15 11:27:23,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 341. [2019-02-15 11:27:23,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-02-15 11:27:23,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 2222 transitions. [2019-02-15 11:27:23,474 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 2222 transitions. Word has length 6 [2019-02-15 11:27:23,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:23,474 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 2222 transitions. [2019-02-15 11:27:23,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:27:23,474 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 2222 transitions. [2019-02-15 11:27:23,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:27:23,475 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:23,475 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:27:23,476 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:23,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:23,476 INFO L82 PathProgramCache]: Analyzing trace with hash 904329206, now seen corresponding path program 1 times [2019-02-15 11:27:23,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:23,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:23,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:27:23,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:23,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:23,635 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:23,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:23,635 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:23,636 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:27:23,636 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [27] [2019-02-15 11:27:23,637 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:23,637 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:23,992 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:23,992 INFO L272 AbstractInterpreter]: Visited 6 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 11:27:23,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:23,992 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:23,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:23,992 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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:27:24,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:24,003 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:24,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:24,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:27:24,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:27:24,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:27:24,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:27:24,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:27:24,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:27:24,122 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:24,162 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:24,185 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:24,204 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:24,219 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:24,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:24,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 68 treesize of output 71 [2019-02-15 11:27:24,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:27:24,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:27:24,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:27:24,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-15 11:27:24,480 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:24,504 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:24,529 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:24,555 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:24,582 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:24,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:24,629 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-15 11:27:24,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 11:27:24,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:24,710 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-02-15 11:27:24,711 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 11:27:24,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-02-15 11:27:24,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:24,794 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-02-15 11:27:24,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-02-15 11:27:24,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,833 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:24,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-02-15 11:27:24,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:24,889 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-02-15 11:27:24,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-02-15 11:27:24,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,923 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:24,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 124 [2019-02-15 11:27:24,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:24,979 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-02-15 11:27:24,979 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-02-15 11:27:25,003 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:25,003 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:25,054 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:25,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:25,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 11:27:25,073 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:25,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:27:25,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:27:25,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:27:25,074 INFO L87 Difference]: Start difference. First operand 341 states and 2222 transitions. Second operand 12 states. [2019-02-15 11:27:26,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:26,160 INFO L93 Difference]: Finished difference Result 645 states and 3901 transitions. [2019-02-15 11:27:26,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-15 11:27:26,160 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 11:27:26,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:26,167 INFO L225 Difference]: With dead ends: 645 [2019-02-15 11:27:26,167 INFO L226 Difference]: Without dead ends: 643 [2019-02-15 11:27:26,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2019-02-15 11:27:26,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-02-15 11:27:26,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 463. [2019-02-15 11:27:26,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-02-15 11:27:26,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 3101 transitions. [2019-02-15 11:27:26,273 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 3101 transitions. Word has length 6 [2019-02-15 11:27:26,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:26,273 INFO L480 AbstractCegarLoop]: Abstraction has 463 states and 3101 transitions. [2019-02-15 11:27:26,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:27:26,273 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 3101 transitions. [2019-02-15 11:27:26,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:27:26,275 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:26,275 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:27:26,275 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:26,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:26,275 INFO L82 PathProgramCache]: Analyzing trace with hash 904333674, now seen corresponding path program 1 times [2019-02-15 11:27:26,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:26,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:26,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:26,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:26,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:26,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:26,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:26,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:26,346 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:27:26,346 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [28], [30], [31] [2019-02-15 11:27:26,347 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:26,347 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:26,555 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:26,555 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:27:26,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:26,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:26,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:26,555 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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:27:26,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:26,564 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:26,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:26,571 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:27:26,579 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:27:26,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:27:26,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:27:26,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:27:26,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-15 11:27:26,636 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:26,661 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:26,681 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:26,697 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:26,709 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:26,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:26,743 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:27:26,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:27:26,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:27:26,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:27:26,839 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:26,852 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:26,865 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:26,880 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:26,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:26,910 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-15 11:27:26,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-15 11:27:26,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:26,976 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-02-15 11:27:26,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-15 11:27:27,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:27,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:27,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:27,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:27,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:27,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:27,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:27,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 11:27:27,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:27:27,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:27:27,160 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:68 [2019-02-15 11:27:27,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:27,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:27,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:27,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:27,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-02-15 11:27:27,238 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:27,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 11:27:27,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 11:27:27,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:27:27,238 INFO L87 Difference]: Start difference. First operand 463 states and 3101 transitions. Second operand 9 states. [2019-02-15 11:27:27,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:27,777 INFO L93 Difference]: Finished difference Result 527 states and 3325 transitions. [2019-02-15 11:27:27,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:27:27,777 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-15 11:27:27,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:27,783 INFO L225 Difference]: With dead ends: 527 [2019-02-15 11:27:27,783 INFO L226 Difference]: Without dead ends: 524 [2019-02-15 11:27:27,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:27:27,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-02-15 11:27:27,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 487. [2019-02-15 11:27:27,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-02-15 11:27:27,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 3268 transitions. [2019-02-15 11:27:27,895 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 3268 transitions. Word has length 6 [2019-02-15 11:27:27,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:27,895 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 3268 transitions. [2019-02-15 11:27:27,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 11:27:27,895 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 3268 transitions. [2019-02-15 11:27:27,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:27:27,896 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:27,896 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:27:27,896 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:27,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:27,896 INFO L82 PathProgramCache]: Analyzing trace with hash 904320156, now seen corresponding path program 1 times [2019-02-15 11:27:27,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:27,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:27,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:27,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:27,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:27,974 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:27:27,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:27,974 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:27,974 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:27:27,974 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [28], [29] [2019-02-15 11:27:27,976 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:27,976 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:28,271 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:28,271 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:27:28,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:28,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:28,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:28,272 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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:27:28,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:28,281 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:28,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:28,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:27:28,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:27:28,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:27:28,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:27:28,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:27:28,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-15 11:27:28,358 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:28,386 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:28,407 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:28,424 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:28,438 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:28,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:28,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 48 treesize of output 54 [2019-02-15 11:27:28,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:27:28,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:27:28,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:27:28,593 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:28,609 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:28,623 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:28,639 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:28,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:28,670 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-15 11:27:28,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 11:27:28,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:28,747 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-02-15 11:27:28,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-15 11:27:28,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 11:27:28,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:28,811 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-02-15 11:27:28,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-02-15 11:27:28,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,847 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:28,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-02-15 11:27:28,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:28,884 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-02-15 11:27:28,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-02-15 11:27:28,906 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:28,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:28,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:28,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:28,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:27:28,961 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:28,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:27:28,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:27:28,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:27:28,961 INFO L87 Difference]: Start difference. First operand 487 states and 3268 transitions. Second operand 10 states. [2019-02-15 11:27:29,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:29,587 INFO L93 Difference]: Finished difference Result 534 states and 3436 transitions. [2019-02-15 11:27:29,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:27:29,588 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:27:29,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:29,595 INFO L225 Difference]: With dead ends: 534 [2019-02-15 11:27:29,595 INFO L226 Difference]: Without dead ends: 533 [2019-02-15 11:27:29,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:27:29,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-02-15 11:27:29,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 505. [2019-02-15 11:27:29,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-02-15 11:27:29,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 3394 transitions. [2019-02-15 11:27:29,724 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 3394 transitions. Word has length 6 [2019-02-15 11:27:29,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:29,725 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 3394 transitions. [2019-02-15 11:27:29,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:27:29,725 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 3394 transitions. [2019-02-15 11:27:29,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:27:29,726 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:29,726 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:27:29,726 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:29,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:29,727 INFO L82 PathProgramCache]: Analyzing trace with hash 904806422, now seen corresponding path program 1 times [2019-02-15 11:27:29,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:29,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:29,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:29,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:29,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:29,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:29,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:29,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:29,799 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:27:29,799 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [24], [28], [29] [2019-02-15 11:27:29,800 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:29,800 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:30,092 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:30,093 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:27:30,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:30,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:30,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:30,093 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 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:27:30,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:30,103 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:30,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:30,115 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:27:30,120 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:27:30,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:27:30,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:27:30,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:27:30,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-15 11:27:30,173 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:30,213 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:30,234 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:30,248 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:30,263 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:30,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:30,306 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-02-15 11:27:30,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-02-15 11:27:30,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 11:27:30,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 11:27:30,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:27:30,532 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:30,556 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:30,579 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:30,603 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:30,628 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:30,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:30,670 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-02-15 11:27:30,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-02-15 11:27:30,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:30,742 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-02-15 11:27:30,743 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-02-15 11:27:30,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 101 [2019-02-15 11:27:30,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:30,824 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-02-15 11:27:30,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-02-15 11:27:30,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,861 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:30,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 114 [2019-02-15 11:27:30,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:30,909 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-02-15 11:27:30,910 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:43 [2019-02-15 11:27:30,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:30,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:30,970 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:30,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:30,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:27:30,988 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:30,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:27:30,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:27:30,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:27:30,989 INFO L87 Difference]: Start difference. First operand 505 states and 3394 transitions. Second operand 10 states. [2019-02-15 11:27:31,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:31,609 INFO L93 Difference]: Finished difference Result 543 states and 3439 transitions. [2019-02-15 11:27:31,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:27:31,609 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:27:31,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:31,615 INFO L225 Difference]: With dead ends: 543 [2019-02-15 11:27:31,615 INFO L226 Difference]: Without dead ends: 542 [2019-02-15 11:27:31,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:27:31,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-02-15 11:27:31,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 500. [2019-02-15 11:27:31,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-02-15 11:27:31,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 3359 transitions. [2019-02-15 11:27:31,734 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 3359 transitions. Word has length 6 [2019-02-15 11:27:31,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:31,734 INFO L480 AbstractCegarLoop]: Abstraction has 500 states and 3359 transitions. [2019-02-15 11:27:31,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:27:31,734 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 3359 transitions. [2019-02-15 11:27:31,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:27:31,736 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:31,736 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:27:31,736 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:31,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:31,736 INFO L82 PathProgramCache]: Analyzing trace with hash 904796812, now seen corresponding path program 1 times [2019-02-15 11:27:31,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:31,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:31,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:31,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:31,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:31,824 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:31,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:31,824 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:31,824 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:27:31,825 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [28], [29] [2019-02-15 11:27:31,825 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:31,825 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:32,099 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:32,100 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:27:32,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:32,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:32,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:32,100 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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:27:32,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:32,110 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:32,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:32,121 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:27:32,128 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:27:32,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:27:32,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:27:32,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:27:32,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-15 11:27:32,176 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:32,214 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:32,234 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:32,249 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:32,262 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:32,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:32,303 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-02-15 11:27:32,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-02-15 11:27:32,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 11:27:32,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 11:27:32,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:27:32,489 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:32,513 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:32,537 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:32,561 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:32,587 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:32,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:32,631 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-02-15 11:27:32,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-02-15 11:27:32,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:32,706 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-02-15 11:27:32,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-02-15 11:27:32,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 101 [2019-02-15 11:27:32,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:32,784 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-02-15 11:27:32,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-02-15 11:27:32,813 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,813 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:32,828 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:32,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 119 [2019-02-15 11:27:32,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:32,877 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-02-15 11:27:32,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2019-02-15 11:27:32,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:32,901 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:32,941 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:32,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:32,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:27:32,959 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:32,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:27:32,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:27:32,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:27:32,960 INFO L87 Difference]: Start difference. First operand 500 states and 3359 transitions. Second operand 10 states. [2019-02-15 11:27:33,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:33,649 INFO L93 Difference]: Finished difference Result 537 states and 3427 transitions. [2019-02-15 11:27:33,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:27:33,649 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:27:33,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:33,653 INFO L225 Difference]: With dead ends: 537 [2019-02-15 11:27:33,654 INFO L226 Difference]: Without dead ends: 536 [2019-02-15 11:27:33,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:27:33,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-02-15 11:27:33,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 501. [2019-02-15 11:27:33,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-02-15 11:27:33,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 3366 transitions. [2019-02-15 11:27:33,773 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 3366 transitions. Word has length 6 [2019-02-15 11:27:33,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:33,773 INFO L480 AbstractCegarLoop]: Abstraction has 501 states and 3366 transitions. [2019-02-15 11:27:33,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:27:33,773 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 3366 transitions. [2019-02-15 11:27:33,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:27:33,774 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:33,774 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:27:33,774 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:33,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:33,774 INFO L82 PathProgramCache]: Analyzing trace with hash 904848706, now seen corresponding path program 1 times [2019-02-15 11:27:33,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:33,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:33,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:33,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:33,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:34,168 WARN L181 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-02-15 11:27:34,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:27:34,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:34,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:34,208 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:27:34,208 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [28], [29] [2019-02-15 11:27:34,209 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:34,210 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:34,563 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:34,564 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:27:34,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:34,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:34,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:34,564 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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:27:34,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:34,583 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:34,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:34,801 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-02-15 11:27:34,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:27:34,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:27:34,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:27:34,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:27:34,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:27:34,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:27:34,868 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:34,909 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:34,931 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:34,949 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:34,964 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:34,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:35,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 68 treesize of output 71 [2019-02-15 11:27:35,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:27:35,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:27:35,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:27:35,285 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-02-15 11:27:35,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-15 11:27:35,297 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:35,323 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:35,348 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:35,372 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:35,398 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:35,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:35,443 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-15 11:27:35,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 11:27:35,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:35,517 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-02-15 11:27:35,517 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 11:27:35,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,552 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:35,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-02-15 11:27:35,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:35,611 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-02-15 11:27:35,611 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:59 [2019-02-15 11:27:35,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:35,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 115 [2019-02-15 11:27:35,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:35,693 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-02-15 11:27:35,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-02-15 11:27:35,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:35,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:35,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:35,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:35,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:27:35,773 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:35,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:27:35,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:27:35,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:27:35,774 INFO L87 Difference]: Start difference. First operand 501 states and 3366 transitions. Second operand 10 states. [2019-02-15 11:27:36,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:36,499 INFO L93 Difference]: Finished difference Result 588 states and 3737 transitions. [2019-02-15 11:27:36,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:27:36,499 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:27:36,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:36,503 INFO L225 Difference]: With dead ends: 588 [2019-02-15 11:27:36,504 INFO L226 Difference]: Without dead ends: 587 [2019-02-15 11:27:36,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:27:36,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-02-15 11:27:36,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 534. [2019-02-15 11:27:36,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-02-15 11:27:36,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 3605 transitions. [2019-02-15 11:27:36,625 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 3605 transitions. Word has length 6 [2019-02-15 11:27:36,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:36,626 INFO L480 AbstractCegarLoop]: Abstraction has 534 states and 3605 transitions. [2019-02-15 11:27:36,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:27:36,626 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 3605 transitions. [2019-02-15 11:27:36,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:27:36,627 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:36,627 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:27:36,627 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:36,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:36,628 INFO L82 PathProgramCache]: Analyzing trace with hash 904869912, now seen corresponding path program 1 times [2019-02-15 11:27:36,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:36,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:36,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:36,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:36,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:36,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:36,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:36,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:36,673 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:27:36,673 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [28], [30], [31] [2019-02-15 11:27:36,674 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:36,674 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:37,106 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:37,107 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:27:37,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:37,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:37,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:37,107 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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:27:37,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:37,127 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:37,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:37,164 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:27:37,202 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:27:37,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:27:37,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:27:37,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:27:37,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-15 11:27:37,286 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:37,434 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:37,451 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:37,468 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:37,482 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:37,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:37,519 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-02-15 11:27:37,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-02-15 11:27:37,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 11:27:37,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 11:27:37,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:27:37,698 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:37,722 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:37,746 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:37,769 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:37,795 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:37,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:37,836 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-02-15 11:27:37,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-02-15 11:27:37,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:37,904 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-02-15 11:27:37,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-02-15 11:27:37,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,935 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:37,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 102 [2019-02-15 11:27:37,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:37,977 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-02-15 11:27:37,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:55 [2019-02-15 11:27:37,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:37,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:38,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:38,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:38,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:27:38,040 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:38,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:27:38,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:27:38,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:27:38,040 INFO L87 Difference]: Start difference. First operand 534 states and 3605 transitions. Second operand 8 states. [2019-02-15 11:27:38,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:38,520 INFO L93 Difference]: Finished difference Result 558 states and 3635 transitions. [2019-02-15 11:27:38,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:27:38,520 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 11:27:38,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:38,524 INFO L225 Difference]: With dead ends: 558 [2019-02-15 11:27:38,524 INFO L226 Difference]: Without dead ends: 557 [2019-02-15 11:27:38,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:27:38,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-02-15 11:27:38,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 533. [2019-02-15 11:27:38,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-02-15 11:27:38,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 3598 transitions. [2019-02-15 11:27:38,654 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 3598 transitions. Word has length 6 [2019-02-15 11:27:38,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:38,655 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 3598 transitions. [2019-02-15 11:27:38,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:27:38,655 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 3598 transitions. [2019-02-15 11:27:38,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:27:38,656 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:38,656 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:27:38,656 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:38,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:38,656 INFO L82 PathProgramCache]: Analyzing trace with hash 904431632, now seen corresponding path program 1 times [2019-02-15 11:27:38,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:38,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:38,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:38,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:38,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:38,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:38,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:38,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:38,735 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:27:38,735 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [28], [29] [2019-02-15 11:27:38,736 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:38,736 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:39,007 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:39,007 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:27:39,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:39,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:39,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:39,008 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 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:27:39,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:39,034 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:39,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:39,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 48 treesize of output 54 [2019-02-15 11:27:39,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:27:39,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:27:39,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:27:39,192 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:39,208 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:39,224 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:39,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:39,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:27:39,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:27:39,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:27:39,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:27:39,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:27:39,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-15 11:27:39,280 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:39,306 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:39,326 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:39,341 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:39,353 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:39,365 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:39,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:39,396 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-15 11:27:39,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 11:27:39,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:39,461 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-02-15 11:27:39,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 11:27:39,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,487 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:39,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-02-15 11:27:39,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:39,519 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-02-15 11:27:39,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:42 [2019-02-15 11:27:39,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 90 [2019-02-15 11:27:39,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:39,584 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-02-15 11:27:39,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-02-15 11:27:39,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:39,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:39,626 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:39,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:39,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:27:39,646 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:39,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:27:39,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:27:39,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:27:39,646 INFO L87 Difference]: Start difference. First operand 533 states and 3598 transitions. Second operand 10 states. [2019-02-15 11:27:40,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:40,340 INFO L93 Difference]: Finished difference Result 795 states and 5176 transitions. [2019-02-15 11:27:40,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:27:40,341 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:27:40,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:40,345 INFO L225 Difference]: With dead ends: 795 [2019-02-15 11:27:40,345 INFO L226 Difference]: Without dead ends: 794 [2019-02-15 11:27:40,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:27:40,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-02-15 11:27:40,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 484. [2019-02-15 11:27:40,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-02-15 11:27:40,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 3230 transitions. [2019-02-15 11:27:40,488 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 3230 transitions. Word has length 6 [2019-02-15 11:27:40,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:40,488 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 3230 transitions. [2019-02-15 11:27:40,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:27:40,488 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 3230 transitions. [2019-02-15 11:27:40,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:27:40,490 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:40,490 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:27:40,490 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:40,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:40,490 INFO L82 PathProgramCache]: Analyzing trace with hash 904452838, now seen corresponding path program 1 times [2019-02-15 11:27:40,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:40,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:40,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:40,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:40,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:40,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:40,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:40,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:40,620 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:27:40,620 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [28], [30], [31] [2019-02-15 11:27:40,621 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:40,621 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:40,845 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:40,845 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:27:40,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:40,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:40,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:40,845 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 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:27:40,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:40,854 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:40,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:40,866 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:27:40,870 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:27:40,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:27:40,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:27:40,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:27:40,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-15 11:27:40,935 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:40,962 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:40,982 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:40,998 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:41,011 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:41,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:41,045 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:27:41,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:41,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:41,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:27:41,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:41,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:41,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:41,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:41,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:27:41,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:41,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:41,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:41,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:41,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:41,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:41,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:27:41,142 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:41,156 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:41,170 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:41,185 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:41,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:41,215 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-15 11:27:41,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:41,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-15 11:27:41,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:41,287 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-02-15 11:27:41,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-15 11:27:41,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:41,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:41,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:41,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:41,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:41,318 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:41,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 81 [2019-02-15 11:27:41,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:27:41,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:27:41,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:76 [2019-02-15 11:27:41,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:41,462 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:41,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:41,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:41,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-02-15 11:27:41,507 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:41,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 11:27:41,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 11:27:41,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:27:41,507 INFO L87 Difference]: Start difference. First operand 484 states and 3230 transitions. Second operand 9 states. [2019-02-15 11:27:42,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:42,216 INFO L93 Difference]: Finished difference Result 539 states and 3425 transitions. [2019-02-15 11:27:42,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:27:42,216 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-15 11:27:42,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:42,220 INFO L225 Difference]: With dead ends: 539 [2019-02-15 11:27:42,220 INFO L226 Difference]: Without dead ends: 538 [2019-02-15 11:27:42,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:27:42,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-02-15 11:27:42,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 500. [2019-02-15 11:27:42,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-02-15 11:27:42,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 3342 transitions. [2019-02-15 11:27:42,449 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 3342 transitions. Word has length 6 [2019-02-15 11:27:42,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:42,449 INFO L480 AbstractCegarLoop]: Abstraction has 500 states and 3342 transitions. [2019-02-15 11:27:42,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 11:27:42,449 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 3342 transitions. [2019-02-15 11:27:42,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:27:42,450 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:42,450 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-15 11:27:42,450 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:42,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:42,451 INFO L82 PathProgramCache]: Analyzing trace with hash 893599114, now seen corresponding path program 4 times [2019-02-15 11:27:42,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:42,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:42,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:42,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:42,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:42,531 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:27:42,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:42,531 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:42,531 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:27:42,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:27:42,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:42,531 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 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:27:42,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:42,540 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:42,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:42,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:27:42,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:27:42,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:27:42,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:27:42,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:27:42,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-15 11:27:42,605 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:42,634 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:42,656 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:42,673 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:42,686 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:42,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:42,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 48 treesize of output 54 [2019-02-15 11:27:42,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:27:42,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:27:42,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:27:42,885 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:42,902 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:42,918 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:42,934 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:42,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:42,967 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-15 11:27:43,171 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-02-15 11:27:43,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:43,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-02-15 11:27:43,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:27:43,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-02-15 11:27:43,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:109 [2019-02-15 11:27:43,515 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-02-15 11:27:43,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:43,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:43,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:43,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:43,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:43,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:43,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:43,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 81 [2019-02-15 11:27:43,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:43,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:43,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:43,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:43,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:43,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:43,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:43,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:43,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:43,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 91 [2019-02-15 11:27:43,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-02-15 11:27:43,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-02-15 11:27:43,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:129, output treesize:126 [2019-02-15 11:27:43,996 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-02-15 11:27:44,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 101 [2019-02-15 11:27:44,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:44,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 111 [2019-02-15 11:27:44,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:44,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-02-15 11:27:44,229 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:44,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-02-15 11:27:44,309 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:159, output treesize:123 [2019-02-15 11:27:44,508 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-02-15 11:27:44,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 125 [2019-02-15 11:27:44,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-15 11:27:44,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-02-15 11:27:44,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:45,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:45,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:45,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:45,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:45,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:45,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:45,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:45,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:45,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:45,058 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:45,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:45,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 88 [2019-02-15 11:27:45,061 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:45,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-02-15 11:27:45,197 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:156, output treesize:238 [2019-02-15 11:27:45,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:45,321 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:45,403 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:45,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:45,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-15 11:27:45,423 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:45,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:27:45,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:27:45,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:27:45,424 INFO L87 Difference]: Start difference. First operand 500 states and 3342 transitions. Second operand 11 states. [2019-02-15 11:27:45,626 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-02-15 11:27:46,298 WARN L181 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2019-02-15 11:27:46,789 WARN L181 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-02-15 11:27:47,296 WARN L181 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2019-02-15 11:27:48,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:48,121 INFO L93 Difference]: Finished difference Result 678 states and 4253 transitions. [2019-02-15 11:27:48,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:27:48,122 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-15 11:27:48,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:48,126 INFO L225 Difference]: With dead ends: 678 [2019-02-15 11:27:48,127 INFO L226 Difference]: Without dead ends: 673 [2019-02-15 11:27:48,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2019-02-15 11:27:48,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-02-15 11:27:48,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 555. [2019-02-15 11:27:48,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-02-15 11:27:48,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 3727 transitions. [2019-02-15 11:27:48,326 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 3727 transitions. Word has length 6 [2019-02-15 11:27:48,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:48,327 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 3727 transitions. [2019-02-15 11:27:48,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:27:48,327 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 3727 transitions. [2019-02-15 11:27:48,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:27:48,328 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:48,328 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-15 11:27:48,328 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:48,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:48,328 INFO L82 PathProgramCache]: Analyzing trace with hash 893598680, now seen corresponding path program 2 times [2019-02-15 11:27:48,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:48,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:48,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:48,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:48,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:48,394 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:27:48,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:48,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:48,395 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:27:48,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:27:48,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:48,395 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 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:27:48,405 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:27:48,406 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:27:48,412 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:27:48,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:27:48,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:48,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:27:48,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:27:48,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:27:48,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:27:48,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:27:48,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:27:48,482 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:48,522 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:48,546 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:48,564 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:48,579 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:48,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:48,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 68 treesize of output 71 [2019-02-15 11:27:48,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:27:48,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:27:48,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:27:48,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:48,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-15 11:27:48,838 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:48,888 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:48,912 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:48,938 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:48,964 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:49,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:49,010 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-15 11:27:49,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 11:27:49,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:49,089 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-02-15 11:27:49,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 11:27:49,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-02-15 11:27:49,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:49,239 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-02-15 11:27:49,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-02-15 11:27:49,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-02-15 11:27:49,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:49,332 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-02-15 11:27:49,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:55 [2019-02-15 11:27:49,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 135 [2019-02-15 11:27:49,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:49,424 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-02-15 11:27:49,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:45 [2019-02-15 11:27:49,451 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:49,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:49,499 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:49,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:49,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-15 11:27:49,519 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:49,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:27:49,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:27:49,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:27:49,519 INFO L87 Difference]: Start difference. First operand 555 states and 3727 transitions. Second operand 11 states. [2019-02-15 11:27:50,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:50,366 INFO L93 Difference]: Finished difference Result 704 states and 4501 transitions. [2019-02-15 11:27:50,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:27:50,366 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-15 11:27:50,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:50,371 INFO L225 Difference]: With dead ends: 704 [2019-02-15 11:27:50,371 INFO L226 Difference]: Without dead ends: 703 [2019-02-15 11:27:50,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:27:50,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-02-15 11:27:50,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 655. [2019-02-15 11:27:50,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-02-15 11:27:50,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 4427 transitions. [2019-02-15 11:27:50,617 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 4427 transitions. Word has length 6 [2019-02-15 11:27:50,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:50,617 INFO L480 AbstractCegarLoop]: Abstraction has 655 states and 4427 transitions. [2019-02-15 11:27:50,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:27:50,617 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 4427 transitions. [2019-02-15 11:27:50,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:27:50,619 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:50,619 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:27:50,619 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:50,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:50,619 INFO L82 PathProgramCache]: Analyzing trace with hash 893604446, now seen corresponding path program 2 times [2019-02-15 11:27:50,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:50,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:50,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:27:50,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:50,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:50,796 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 13 [2019-02-15 11:27:50,881 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:50,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:50,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:50,882 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:27:50,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:27:50,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:50,882 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 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:27:50,891 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:27:50,891 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:27:50,897 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:27:50,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:27:50,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:50,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:27:50,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:27:50,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:50,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:50,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:27:50,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:50,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:50,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:50,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:27:50,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:50,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:50,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:50,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:50,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:27:50,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:50,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:50,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:50,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:50,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:50,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:27:50,964 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:51,013 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:51,036 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:51,054 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:51,069 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:51,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:51,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 68 treesize of output 71 [2019-02-15 11:27:51,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:27:51,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:27:51,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:27:51,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-15 11:27:51,327 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:51,353 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:51,378 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:51,403 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:51,429 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:51,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:51,474 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-15 11:27:51,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 11:27:51,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:51,555 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-02-15 11:27:51,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-15 11:27:51,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-02-15 11:27:51,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:51,640 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-02-15 11:27:51,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-02-15 11:27:51,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,679 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:51,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-02-15 11:27:51,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:51,733 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-02-15 11:27:51,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-02-15 11:27:51,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,770 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:51,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 124 [2019-02-15 11:27:51,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:51,825 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-02-15 11:27:51,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-02-15 11:27:51,883 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:51,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:51,933 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:51,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:51,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 11:27:51,952 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:51,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:27:51,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:27:51,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:27:51,952 INFO L87 Difference]: Start difference. First operand 655 states and 4427 transitions. Second operand 12 states. [2019-02-15 11:27:53,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:53,312 INFO L93 Difference]: Finished difference Result 1218 states and 7896 transitions. [2019-02-15 11:27:53,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-15 11:27:53,313 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 11:27:53,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:53,319 INFO L225 Difference]: With dead ends: 1218 [2019-02-15 11:27:53,319 INFO L226 Difference]: Without dead ends: 1217 [2019-02-15 11:27:53,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:27:53,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2019-02-15 11:27:53,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 738. [2019-02-15 11:27:53,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-02-15 11:27:53,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 5008 transitions. [2019-02-15 11:27:53,638 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 5008 transitions. Word has length 6 [2019-02-15 11:27:53,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:53,638 INFO L480 AbstractCegarLoop]: Abstraction has 738 states and 5008 transitions. [2019-02-15 11:27:53,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:27:53,639 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 5008 transitions. [2019-02-15 11:27:53,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:27:53,640 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:53,640 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:27:53,640 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:53,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:53,640 INFO L82 PathProgramCache]: Analyzing trace with hash 893724170, now seen corresponding path program 1 times [2019-02-15 11:27:53,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:53,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:53,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:27:53,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:53,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:53,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:27:53,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:53,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:53,715 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:27:53,715 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [24], [28], [29] [2019-02-15 11:27:53,716 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:53,716 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:54,015 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:54,015 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:27:54,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:54,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:54,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:54,016 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 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:27:54,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:54,025 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:54,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:54,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:27:54,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:27:54,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:27:54,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:27:54,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:27:54,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:27:54,108 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:54,147 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:54,170 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:54,186 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:54,201 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:54,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:54,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 68 treesize of output 71 [2019-02-15 11:27:54,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:27:54,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:27:54,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:27:54,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-15 11:27:54,459 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:54,485 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:54,510 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:54,536 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:54,562 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:54,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:54,607 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-15 11:27:54,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 11:27:54,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:54,686 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-02-15 11:27:54,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 11:27:54,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,716 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,719 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:54,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 105 [2019-02-15 11:27:54,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:54,765 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-02-15 11:27:54,766 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:59 [2019-02-15 11:27:54,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-02-15 11:27:54,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:54,853 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-02-15 11:27:54,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:69, output treesize:47 [2019-02-15 11:27:54,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:54,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:54,915 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:54,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:54,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:27:54,933 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:54,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:27:54,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:27:54,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:27:54,933 INFO L87 Difference]: Start difference. First operand 738 states and 5008 transitions. Second operand 10 states. [2019-02-15 11:27:55,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:55,764 INFO L93 Difference]: Finished difference Result 814 states and 5311 transitions. [2019-02-15 11:27:55,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:27:55,764 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:27:55,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:55,767 INFO L225 Difference]: With dead ends: 814 [2019-02-15 11:27:55,767 INFO L226 Difference]: Without dead ends: 811 [2019-02-15 11:27:55,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:27:55,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-02-15 11:27:56,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 775. [2019-02-15 11:27:56,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2019-02-15 11:27:56,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 5267 transitions. [2019-02-15 11:27:56,058 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 5267 transitions. Word has length 6 [2019-02-15 11:27:56,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:56,058 INFO L480 AbstractCegarLoop]: Abstraction has 775 states and 5267 transitions. [2019-02-15 11:27:56,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:27:56,058 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 5267 transitions. [2019-02-15 11:27:56,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:27:56,059 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:56,059 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:27:56,059 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:56,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:56,060 INFO L82 PathProgramCache]: Analyzing trace with hash 893714560, now seen corresponding path program 1 times [2019-02-15 11:27:56,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:56,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:56,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:56,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:56,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:56,161 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:27:56,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:56,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:56,161 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:27:56,162 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [22], [28], [29] [2019-02-15 11:27:56,162 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:56,162 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:56,438 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:56,438 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:27:56,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:56,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:56,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:56,439 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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:27:56,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:56,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:56,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:56,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 48 treesize of output 54 [2019-02-15 11:27:56,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:27:56,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:27:56,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:27:56,612 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:56,629 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:56,646 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:56,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:56,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:27:56,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:27:56,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:27:56,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:27:56,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:27:56,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-15 11:27:56,704 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:56,729 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:56,749 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:56,764 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:56,777 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:56,789 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:56,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:56,821 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-15 11:27:56,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:27:56,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:56,905 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-02-15 11:27:56,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-15 11:27:56,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,935 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:56,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 11:27:56,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:56,967 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-02-15 11:27:56,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-02-15 11:27:56,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,999 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:57,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 11:27:57,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:57,030 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-02-15 11:27:57,030 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-15 11:27:57,052 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:57,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:57,089 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:57,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:57,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-15 11:27:57,107 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:57,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 11:27:57,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 11:27:57,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:27:57,108 INFO L87 Difference]: Start difference. First operand 775 states and 5267 transitions. Second operand 9 states. [2019-02-15 11:27:57,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:57,964 INFO L93 Difference]: Finished difference Result 812 states and 5339 transitions. [2019-02-15 11:27:57,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:27:57,964 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-15 11:27:57,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:57,968 INFO L225 Difference]: With dead ends: 812 [2019-02-15 11:27:57,968 INFO L226 Difference]: Without dead ends: 811 [2019-02-15 11:27:57,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:27:57,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-02-15 11:27:58,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 780. [2019-02-15 11:27:58,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-02-15 11:27:58,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 5302 transitions. [2019-02-15 11:27:58,285 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 5302 transitions. Word has length 6 [2019-02-15 11:27:58,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:58,285 INFO L480 AbstractCegarLoop]: Abstraction has 780 states and 5302 transitions. [2019-02-15 11:27:58,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 11:27:58,285 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 5302 transitions. [2019-02-15 11:27:58,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:27:58,286 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:58,286 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:27:58,286 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:58,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:58,287 INFO L82 PathProgramCache]: Analyzing trace with hash 893787660, now seen corresponding path program 1 times [2019-02-15 11:27:58,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:58,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:58,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:58,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:58,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:58,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:27:58,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:58,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:58,374 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:27:58,374 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [28], [30], [31] [2019-02-15 11:27:58,375 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:58,375 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:58,598 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:58,598 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:27:58,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:58,599 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:58,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:58,599 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 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:27:58,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:58,608 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:58,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:58,617 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:27:58,621 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:27:58,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:58,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:58,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:27:58,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:58,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:58,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:58,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:27:58,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:58,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:58,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:58,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:58,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:27:58,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:58,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:58,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:58,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:58,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:58,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-15 11:27:58,675 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:58,713 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:58,735 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:58,752 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:58,765 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:58,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:58,805 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-02-15 11:27:58,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:58,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:58,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-02-15 11:27:58,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:58,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:58,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:58,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:58,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 11:27:58,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:58,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:58,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:58,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:58,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:58,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:58,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 11:27:58,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:58,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:58,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:58,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:58,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:58,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:58,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:58,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:58,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:27:58,991 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:59,012 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:59,036 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:59,060 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:59,085 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:59,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:59,128 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-02-15 11:27:59,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:59,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 11:27:59,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:27:59,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:27:59,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:138 [2019-02-15 11:27:59,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:59,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:59,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:59,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 11:27:59,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:59,726 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-02-15 11:27:59,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:38 [2019-02-15 11:27:59,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:59,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:59,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:59,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:59,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 11:27:59,780 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:59,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:27:59,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:27:59,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:27:59,781 INFO L87 Difference]: Start difference. First operand 780 states and 5302 transitions. Second operand 8 states. [2019-02-15 11:28:00,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:28:00,451 INFO L93 Difference]: Finished difference Result 843 states and 5575 transitions. [2019-02-15 11:28:00,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:28:00,452 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 11:28:00,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:28:00,454 INFO L225 Difference]: With dead ends: 843 [2019-02-15 11:28:00,454 INFO L226 Difference]: Without dead ends: 842 [2019-02-15 11:28:00,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-02-15 11:28:00,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-02-15 11:28:00,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 813. [2019-02-15 11:28:00,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-02-15 11:28:00,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 5533 transitions. [2019-02-15 11:28:00,766 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 5533 transitions. Word has length 6 [2019-02-15 11:28:00,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:28:00,766 INFO L480 AbstractCegarLoop]: Abstraction has 813 states and 5533 transitions. [2019-02-15 11:28:00,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:28:00,766 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 5533 transitions. [2019-02-15 11:28:00,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:28:00,767 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:28:00,767 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:28:00,767 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:28:00,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:00,768 INFO L82 PathProgramCache]: Analyzing trace with hash 893774142, now seen corresponding path program 1 times [2019-02-15 11:28:00,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:28:00,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:00,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:00,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:00,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:28:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:00,888 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:28:00,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:00,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:28:00,888 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:28:00,888 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [28], [29] [2019-02-15 11:28:00,889 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:28:00,889 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:28:01,214 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:28:01,215 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:28:01,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:01,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:28:01,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:01,215 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 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:28:01,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:01,224 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:28:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:01,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:28:01,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 48 treesize of output 54 [2019-02-15 11:28:01,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:28:01,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:28:01,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:28:01,390 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:01,414 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:01,435 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:01,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:01,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:28:01,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:28:01,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:28:01,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:28:01,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:28:01,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-15 11:28:01,505 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:01,531 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:01,551 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:01,567 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:01,580 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:01,591 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:01,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:01,623 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-15 11:28:01,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-02-15 11:28:01,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:28:01,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:28:01,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:106 [2019-02-15 11:28:01,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,224 INFO L303 Elim1Store]: Index analysis took 272 ms [2019-02-15 11:28:02,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 65 treesize of output 103 [2019-02-15 11:28:02,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-15 11:28:02,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,594 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:02,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 88 [2019-02-15 11:28:02,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:02,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 19 dim-0 vars, and 6 xjuncts. [2019-02-15 11:28:02,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:126, output treesize:278 [2019-02-15 11:28:02,956 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 103 [2019-02-15 11:28:02,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 88 [2019-02-15 11:28:02,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:03,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,085 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:03,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 100 [2019-02-15 11:28:03,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:03,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,217 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:03,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 94 [2019-02-15 11:28:03,219 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:03,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,343 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:03,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-02-15 11:28:03,344 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:03,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2019-02-15 11:28:03,447 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 20 variables, input treesize:227, output treesize:173 [2019-02-15 11:28:03,592 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2019-02-15 11:28:03,595 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:03,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:28:03,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:03,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:28:03,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:28:03,670 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:28:03,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:28:03,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:28:03,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:28:03,671 INFO L87 Difference]: Start difference. First operand 813 states and 5533 transitions. Second operand 10 states. [2019-02-15 11:28:03,856 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-02-15 11:28:04,100 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-02-15 11:28:04,488 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 87 [2019-02-15 11:28:05,089 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 83 [2019-02-15 11:28:05,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:28:05,416 INFO L93 Difference]: Finished difference Result 896 states and 5824 transitions. [2019-02-15 11:28:05,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:28:05,416 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:28:05,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:28:05,419 INFO L225 Difference]: With dead ends: 896 [2019-02-15 11:28:05,419 INFO L226 Difference]: Without dead ends: 895 [2019-02-15 11:28:05,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-02-15 11:28:05,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2019-02-15 11:28:05,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 848. [2019-02-15 11:28:05,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-02-15 11:28:05,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 5778 transitions. [2019-02-15 11:28:05,772 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 5778 transitions. Word has length 6 [2019-02-15 11:28:05,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:28:05,772 INFO L480 AbstractCegarLoop]: Abstraction has 848 states and 5778 transitions. [2019-02-15 11:28:05,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:28:05,772 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 5778 transitions. [2019-02-15 11:28:05,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:28:05,773 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:28:05,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:28:05,773 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:28:05,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:05,774 INFO L82 PathProgramCache]: Analyzing trace with hash 893364756, now seen corresponding path program 1 times [2019-02-15 11:28:05,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:28:05,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:05,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:05,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:05,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:28:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:05,853 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:05,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:05,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:28:05,854 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:28:05,854 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [22], [28], [29] [2019-02-15 11:28:05,855 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:28:05,855 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:28:06,126 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:28:06,127 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:28:06,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:06,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:28:06,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:06,127 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 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:28:06,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:06,135 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:28:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:06,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:28:06,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:06,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 48 treesize of output 54 [2019-02-15 11:28:06,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:06,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:06,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:28:06,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:06,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:06,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:06,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:06,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:28:06,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:06,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:06,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:06,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:06,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:06,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:06,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:28:06,301 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:06,318 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:06,335 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:06,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:06,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:28:06,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:28:06,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:28:06,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:28:06,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:28:06,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-15 11:28:06,396 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:06,423 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:06,443 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:06,459 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:06,472 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:06,483 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:06,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:06,516 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-15 11:28:06,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:06,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:28:06,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:06,586 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-02-15 11:28:06,586 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 11:28:06,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:06,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:06,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:06,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:06,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:06,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:06,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:06,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 11:28:06,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:06,652 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-02-15 11:28:06,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-02-15 11:28:06,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:06,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:06,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:06,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:06,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:06,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:06,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:06,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:06,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:06,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:06,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:06,681 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:06,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 11:28:06,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:06,808 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-02-15 11:28:06,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-02-15 11:28:06,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:06,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:28:06,859 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:06,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:28:06,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:28:06,879 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:28:06,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:28:06,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:28:06,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:28:06,880 INFO L87 Difference]: Start difference. First operand 848 states and 5778 transitions. Second operand 10 states. [2019-02-15 11:28:07,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:28:07,896 INFO L93 Difference]: Finished difference Result 975 states and 6393 transitions. [2019-02-15 11:28:07,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:28:07,896 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:28:07,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:28:07,899 INFO L225 Difference]: With dead ends: 975 [2019-02-15 11:28:07,899 INFO L226 Difference]: Without dead ends: 973 [2019-02-15 11:28:07,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:28:07,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2019-02-15 11:28:08,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 930. [2019-02-15 11:28:08,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2019-02-15 11:28:08,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 6346 transitions. [2019-02-15 11:28:08,286 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 6346 transitions. Word has length 6 [2019-02-15 11:28:08,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:28:08,287 INFO L480 AbstractCegarLoop]: Abstraction has 930 states and 6346 transitions. [2019-02-15 11:28:08,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:28:08,287 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 6346 transitions. [2019-02-15 11:28:08,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:28:08,289 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:28:08,289 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:28:08,289 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:28:08,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:08,289 INFO L82 PathProgramCache]: Analyzing trace with hash 893370586, now seen corresponding path program 1 times [2019-02-15 11:28:08,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:28:08,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:08,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:08,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:08,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:28:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:08,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:28:08,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:08,375 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:28:08,375 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:28:08,375 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [28], [30], [31] [2019-02-15 11:28:08,377 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:28:08,377 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:28:08,619 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:28:08,620 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:28:08,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:08,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:28:08,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:08,620 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 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:28:08,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:08,629 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:28:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:08,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:28:08,641 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:28:08,645 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:28:08,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:08,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:08,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:28:08,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:08,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:08,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:08,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:28:08,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:08,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:08,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:08,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:08,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:28:08,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-15 11:28:08,708 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:08,735 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:08,756 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:08,772 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:08,785 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:08,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:08,822 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:28:08,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:08,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:08,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:28:08,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:08,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:08,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:08,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:08,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:28:08,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:08,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:08,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:08,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:08,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:08,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:08,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:28:08,918 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:08,934 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:08,948 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:08,964 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:08,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:08,994 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-15 11:28:09,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:09,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:28:09,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:28:09,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:28:09,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:88 [2019-02-15 11:28:09,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:09,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:09,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:09,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:09,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:09,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:09,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:09,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 86 [2019-02-15 11:28:09,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:09,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:09,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:09,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:09,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:09,245 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:09,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 59 [2019-02-15 11:28:09,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:09,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:28:09,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:108, output treesize:84 [2019-02-15 11:28:09,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:09,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:28:09,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:09,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:28:09,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 11:28:09,381 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:28:09,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:28:09,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:28:09,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:28:09,382 INFO L87 Difference]: Start difference. First operand 930 states and 6346 transitions. Second operand 8 states. [2019-02-15 11:28:09,878 WARN L181 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-02-15 11:28:12,242 WARN L181 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-02-15 11:28:13,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:28:13,090 INFO L93 Difference]: Finished difference Result 985 states and 6551 transitions. [2019-02-15 11:28:13,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:28:13,091 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 11:28:13,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:28:13,094 INFO L225 Difference]: With dead ends: 985 [2019-02-15 11:28:13,094 INFO L226 Difference]: Without dead ends: 984 [2019-02-15 11:28:13,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:28:13,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-02-15 11:28:13,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 951. [2019-02-15 11:28:13,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-02-15 11:28:13,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 6492 transitions. [2019-02-15 11:28:13,467 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 6492 transitions. Word has length 6 [2019-02-15 11:28:13,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:28:13,467 INFO L480 AbstractCegarLoop]: Abstraction has 951 states and 6492 transitions. [2019-02-15 11:28:13,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:28:13,467 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 6492 transitions. [2019-02-15 11:28:13,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:28:13,469 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:28:13,469 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:28:13,469 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:28:13,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:13,469 INFO L82 PathProgramCache]: Analyzing trace with hash 908380782, now seen corresponding path program 1 times [2019-02-15 11:28:13,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:28:13,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:13,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:13,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:13,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:28:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:13,577 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:13,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:13,577 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:28:13,577 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:28:13,577 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [24], [27] [2019-02-15 11:28:13,578 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:28:13,578 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:28:13,965 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:28:13,965 INFO L272 AbstractInterpreter]: Visited 6 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 11:28:13,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:13,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:28:13,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:13,966 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 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:28:13,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:13,975 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:28:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:13,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:28:14,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 68 treesize of output 71 [2019-02-15 11:28:14,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:28:14,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:28:14,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:28:14,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-15 11:28:14,233 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:14,260 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:14,287 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:14,314 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:14,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:14,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:28:14,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:28:14,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:28:14,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:28:14,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:28:14,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:28:14,393 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:14,429 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:14,450 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:14,466 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:14,477 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:14,489 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:14,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:14,535 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-02-15 11:28:14,579 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 11:28:14,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:14,624 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-02-15 11:28:14,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-15 11:28:14,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-02-15 11:28:14,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:14,714 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-02-15 11:28:14,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-02-15 11:28:14,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,760 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:14,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-02-15 11:28:14,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:14,812 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-02-15 11:28:14,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-02-15 11:28:14,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,852 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:14,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:14,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 124 [2019-02-15 11:28:14,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:14,905 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-02-15 11:28:14,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-02-15 11:28:14,933 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:14,933 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:28:15,144 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:15,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:28:15,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 11:28:15,164 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:28:15,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:28:15,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:28:15,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:28:15,165 INFO L87 Difference]: Start difference. First operand 951 states and 6492 transitions. Second operand 12 states. [2019-02-15 11:28:19,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:28:19,422 INFO L93 Difference]: Finished difference Result 1024 states and 6701 transitions. [2019-02-15 11:28:19,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:28:19,422 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 11:28:19,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:28:19,427 INFO L225 Difference]: With dead ends: 1024 [2019-02-15 11:28:19,427 INFO L226 Difference]: Without dead ends: 1023 [2019-02-15 11:28:19,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2019-02-15 11:28:19,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2019-02-15 11:28:19,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 948. [2019-02-15 11:28:19,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2019-02-15 11:28:19,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 6467 transitions. [2019-02-15 11:28:19,834 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 6467 transitions. Word has length 6 [2019-02-15 11:28:19,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:28:19,835 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 6467 transitions. [2019-02-15 11:28:19,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:28:19,835 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 6467 transitions. [2019-02-15 11:28:19,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:28:19,836 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:28:19,836 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:28:19,836 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:28:19,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:19,837 INFO L82 PathProgramCache]: Analyzing trace with hash 908380906, now seen corresponding path program 1 times [2019-02-15 11:28:19,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:28:19,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:19,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:19,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:19,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:28:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:20,004 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:20,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:20,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:28:20,005 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:28:20,005 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [24], [27] [2019-02-15 11:28:20,006 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:28:20,006 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:28:20,390 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:28:20,390 INFO L272 AbstractInterpreter]: Visited 6 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 11:28:20,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:20,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:28:20,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:20,390 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 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:28:20,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:20,399 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:28:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:20,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:28:20,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:28:20,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:28:20,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:28:20,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:28:20,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:28:20,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:28:20,479 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:20,522 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:20,545 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:20,565 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:20,580 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:20,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:20,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 68 treesize of output 71 [2019-02-15 11:28:20,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:28:20,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:28:20,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:28:20,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:20,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-15 11:28:20,840 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:20,867 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:20,892 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:20,918 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:20,945 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:20,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:20,991 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-02-15 11:28:21,036 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 11:28:21,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:21,081 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-02-15 11:28:21,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-15 11:28:21,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-02-15 11:28:21,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:21,174 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-02-15 11:28:21,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-02-15 11:28:21,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,218 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:21,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-02-15 11:28:21,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:21,271 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-02-15 11:28:21,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-02-15 11:28:21,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:21,316 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:21,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 125 [2019-02-15 11:28:21,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:21,367 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-02-15 11:28:21,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:47 [2019-02-15 11:28:21,394 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:21,394 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:28:21,450 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:21,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:28:21,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 11:28:21,469 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:28:21,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:28:21,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:28:21,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:28:21,470 INFO L87 Difference]: Start difference. First operand 948 states and 6467 transitions. Second operand 12 states. [2019-02-15 11:28:22,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:28:22,777 INFO L93 Difference]: Finished difference Result 1059 states and 6958 transitions. [2019-02-15 11:28:22,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:28:22,778 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 11:28:22,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:28:22,782 INFO L225 Difference]: With dead ends: 1059 [2019-02-15 11:28:22,783 INFO L226 Difference]: Without dead ends: 1057 [2019-02-15 11:28:22,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-02-15 11:28:22,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2019-02-15 11:28:23,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 945. [2019-02-15 11:28:23,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-02-15 11:28:23,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 6457 transitions. [2019-02-15 11:28:23,198 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 6457 transitions. Word has length 6 [2019-02-15 11:28:23,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:28:23,199 INFO L480 AbstractCegarLoop]: Abstraction has 945 states and 6457 transitions. [2019-02-15 11:28:23,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:28:23,199 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 6457 transitions. [2019-02-15 11:28:23,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:28:23,200 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:28:23,200 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:28:23,200 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:28:23,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:23,201 INFO L82 PathProgramCache]: Analyzing trace with hash 908367452, now seen corresponding path program 1 times [2019-02-15 11:28:23,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:28:23,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:23,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:23,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:23,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:28:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:23,347 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:23,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:23,348 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:28:23,348 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:28:23,348 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [27] [2019-02-15 11:28:23,349 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:28:23,349 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:28:23,688 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:28:23,688 INFO L272 AbstractInterpreter]: Visited 6 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 11:28:23,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:23,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:28:23,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:23,688 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 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:28:23,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:23,698 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:28:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:23,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:28:23,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:28:23,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:28:23,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:23,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:23,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:28:23,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:23,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:23,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:23,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:28:23,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:23,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:23,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:23,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:23,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:28:23,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-15 11:28:23,769 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:23,804 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:23,825 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:23,843 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:23,857 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:23,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:23,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:23,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 48 treesize of output 54 [2019-02-15 11:28:23,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:23,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:23,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:28:23,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:23,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:23,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:23,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:23,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:28:24,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:28:24,023 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:24,039 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:24,054 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:24,070 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:24,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:24,102 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:72, output treesize:71 [2019-02-15 11:28:24,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:28:24,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:24,199 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-02-15 11:28:24,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-02-15 11:28:24,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-15 11:28:24,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:24,267 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-02-15 11:28:24,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:38 [2019-02-15 11:28:24,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,301 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:24,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-02-15 11:28:24,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:24,338 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-02-15 11:28:24,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:34 [2019-02-15 11:28:24,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:24,375 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:24,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 100 [2019-02-15 11:28:24,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:24,408 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-02-15 11:28:24,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 11:28:24,428 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:24,428 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:28:24,490 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:24,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:28:24,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 11:28:24,510 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:28:24,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:28:24,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:28:24,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:28:24,510 INFO L87 Difference]: Start difference. First operand 945 states and 6457 transitions. Second operand 12 states. [2019-02-15 11:28:26,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:28:26,586 INFO L93 Difference]: Finished difference Result 1044 states and 6871 transitions. [2019-02-15 11:28:26,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:28:26,587 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 11:28:26,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:28:26,591 INFO L225 Difference]: With dead ends: 1044 [2019-02-15 11:28:26,591 INFO L226 Difference]: Without dead ends: 1042 [2019-02-15 11:28:26,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2019-02-15 11:28:26,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2019-02-15 11:28:27,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 982. [2019-02-15 11:28:27,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2019-02-15 11:28:27,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 6716 transitions. [2019-02-15 11:28:27,012 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 6716 transitions. Word has length 6 [2019-02-15 11:28:27,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:28:27,013 INFO L480 AbstractCegarLoop]: Abstraction has 982 states and 6716 transitions. [2019-02-15 11:28:27,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:28:27,013 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 6716 transitions. [2019-02-15 11:28:27,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:28:27,014 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:28:27,014 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:28:27,014 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:28:27,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:27,015 INFO L82 PathProgramCache]: Analyzing trace with hash 908371606, now seen corresponding path program 2 times [2019-02-15 11:28:27,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:28:27,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:27,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:27,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:27,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:28:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:27,125 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:27,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:27,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:28:27,125 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:28:27,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:28:27,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:27,126 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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:28:27,137 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:28:27,137 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:28:27,143 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:28:27,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:28:27,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:28:27,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 68 treesize of output 71 [2019-02-15 11:28:27,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:28:27,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:28:27,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:28:27,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-15 11:28:27,374 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:27,400 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:27,425 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:27,451 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:27,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:27,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:28:27,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:28:27,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:28:27,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:28:27,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:28:27,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:28:27,526 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:27,561 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:27,580 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:27,596 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:27,608 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:27,620 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:27,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:27,663 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-02-15 11:28:27,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 11:28:27,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:27,748 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-02-15 11:28:27,749 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-15 11:28:27,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-02-15 11:28:27,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:27,838 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-02-15 11:28:27,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-02-15 11:28:27,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,885 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:27,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-02-15 11:28:27,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:27,934 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-02-15 11:28:27,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-02-15 11:28:27,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,977 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:27,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:27,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-02-15 11:28:27,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:28,027 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-02-15 11:28:28,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:43 [2019-02-15 11:28:28,212 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:28,213 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:28:28,271 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:28,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:28:28,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 11:28:28,289 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:28:28,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:28:28,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:28:28,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:28:28,289 INFO L87 Difference]: Start difference. First operand 982 states and 6716 transitions. Second operand 12 states. [2019-02-15 11:28:29,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:28:29,529 INFO L93 Difference]: Finished difference Result 1044 states and 6839 transitions. [2019-02-15 11:28:29,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:28:29,529 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 11:28:29,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:28:29,534 INFO L225 Difference]: With dead ends: 1044 [2019-02-15 11:28:29,534 INFO L226 Difference]: Without dead ends: 1041 [2019-02-15 11:28:29,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-02-15 11:28:29,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-02-15 11:28:29,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 980. [2019-02-15 11:28:29,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2019-02-15 11:28:29,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 6702 transitions. [2019-02-15 11:28:29,921 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 6702 transitions. Word has length 6 [2019-02-15 11:28:29,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:28:29,922 INFO L480 AbstractCegarLoop]: Abstraction has 980 states and 6702 transitions. [2019-02-15 11:28:29,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:28:29,922 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 6702 transitions. [2019-02-15 11:28:29,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:28:29,923 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:28:29,923 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:28:29,923 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:28:29,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:29,924 INFO L82 PathProgramCache]: Analyzing trace with hash 908017958, now seen corresponding path program 1 times [2019-02-15 11:28:29,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:28:29,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:29,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:28:29,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:29,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:28:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:30,019 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:30,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:30,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:28:30,019 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:28:30,019 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [24], [27] [2019-02-15 11:28:30,020 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:28:30,020 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:28:30,402 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:28:30,402 INFO L272 AbstractInterpreter]: Visited 6 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 11:28:30,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:30,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:28:30,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:30,402 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 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:28:30,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:30,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:28:30,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:30,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:28:30,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:28:30,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:28:30,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:30,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:30,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:28:30,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:30,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:30,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:30,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:28:30,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:30,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:30,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:30,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:30,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:28:30,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-15 11:28:30,490 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:30,517 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:30,539 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:30,556 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:30,569 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:30,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:30,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:30,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 48 treesize of output 54 [2019-02-15 11:28:30,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:30,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:30,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:28:30,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:30,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:30,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:30,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:30,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:28:30,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:30,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:30,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:30,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:30,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:30,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:30,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:28:30,727 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:30,761 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:30,776 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:30,792 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:30,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:30,823 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-15 11:28:30,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:30,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-02-15 11:28:30,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:28:31,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:28:31,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:106 [2019-02-15 11:28:31,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,162 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:31,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 93 [2019-02-15 11:28:31,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:28:31,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,322 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:31,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 80 [2019-02-15 11:28:31,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:31,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-02-15 11:28:31,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:126, output treesize:135 [2019-02-15 11:28:31,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 95 [2019-02-15 11:28:31,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:28:31,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,716 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 93 [2019-02-15 11:28:31,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:31,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:31,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 86 [2019-02-15 11:28:31,837 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:31,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 14 dim-0 vars, and 4 xjuncts. [2019-02-15 11:28:31,932 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:165, output treesize:147 [2019-02-15 11:28:32,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,060 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,060 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 102 [2019-02-15 11:28:32,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:32,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,207 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:32,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 118 [2019-02-15 11:28:32,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-02-15 11:28:32,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,491 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:32,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 92 [2019-02-15 11:28:32,492 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:32,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:32,647 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:32,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 98 [2019-02-15 11:28:32,648 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:32,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 17 dim-0 vars, 4 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-02-15 11:28:32,781 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 21 variables, input treesize:190, output treesize:230 [2019-02-15 11:28:33,134 WARN L181 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 103 [2019-02-15 11:28:33,137 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:33,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:28:33,227 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:33,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:28:33,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 11:28:33,247 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:28:33,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:28:33,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:28:33,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:28:33,247 INFO L87 Difference]: Start difference. First operand 980 states and 6702 transitions. Second operand 12 states. [2019-02-15 11:28:33,433 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-02-15 11:28:33,697 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-02-15 11:28:34,093 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 54 [2019-02-15 11:28:34,530 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 75 [2019-02-15 11:28:35,000 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 85 [2019-02-15 11:28:35,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:28:35,910 INFO L93 Difference]: Finished difference Result 1104 states and 7131 transitions. [2019-02-15 11:28:35,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:28:35,911 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 11:28:35,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:28:35,915 INFO L225 Difference]: With dead ends: 1104 [2019-02-15 11:28:35,915 INFO L226 Difference]: Without dead ends: 1102 [2019-02-15 11:28:35,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-02-15 11:28:35,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2019-02-15 11:28:36,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 984. [2019-02-15 11:28:36,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-02-15 11:28:36,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 6730 transitions. [2019-02-15 11:28:36,307 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 6730 transitions. Word has length 6 [2019-02-15 11:28:36,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:28:36,307 INFO L480 AbstractCegarLoop]: Abstraction has 984 states and 6730 transitions. [2019-02-15 11:28:36,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:28:36,307 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 6730 transitions. [2019-02-15 11:28:36,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:28:36,309 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:28:36,309 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:28:36,309 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:28:36,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:36,309 INFO L82 PathProgramCache]: Analyzing trace with hash 908017524, now seen corresponding path program 1 times [2019-02-15 11:28:36,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:28:36,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:36,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:36,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:36,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:28:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:36,408 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:36,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:36,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:28:36,408 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:28:36,408 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [22], [27] [2019-02-15 11:28:36,410 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:28:36,410 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:28:36,741 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:28:36,741 INFO L272 AbstractInterpreter]: Visited 6 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 11:28:36,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:36,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:28:36,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:36,742 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 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:28:36,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:36,750 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:28:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:36,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:28:36,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:36,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 48 treesize of output 54 [2019-02-15 11:28:36,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:36,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:36,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:28:36,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:36,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:36,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:36,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:36,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:28:36,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:36,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:36,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:36,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:36,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:36,904 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:36,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:28:36,905 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:36,926 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:36,947 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:36,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:36,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:28:36,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:28:37,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:28:37,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:28:37,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:28:37,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-15 11:28:37,016 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:37,042 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:37,061 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:37,076 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:37,088 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:37,099 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:37,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:37,131 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-15 11:28:37,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:37,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:28:37,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:37,213 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-02-15 11:28:37,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-15 11:28:37,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:37,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:37,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:37,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:37,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:37,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:37,247 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:37,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 11:28:37,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:37,279 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-02-15 11:28:37,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:42 [2019-02-15 11:28:37,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:37,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:37,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:37,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:37,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:37,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:37,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:37,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:37,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:37,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-15 11:28:37,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:37,341 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-02-15 11:28:37,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-02-15 11:28:37,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:37,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:37,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:37,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:37,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:37,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:37,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:37,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:37,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:37,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:37,376 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:37,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:37,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-02-15 11:28:37,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:37,411 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-02-15 11:28:37,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:34 [2019-02-15 11:28:37,434 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:37,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:28:37,480 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:37,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:28:37,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 11:28:37,499 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:28:37,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:28:37,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:28:37,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:28:37,499 INFO L87 Difference]: Start difference. First operand 984 states and 6730 transitions. Second operand 12 states. [2019-02-15 11:28:39,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:28:39,812 INFO L93 Difference]: Finished difference Result 1313 states and 8698 transitions. [2019-02-15 11:28:39,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:28:39,813 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 11:28:39,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:28:39,817 INFO L225 Difference]: With dead ends: 1313 [2019-02-15 11:28:39,818 INFO L226 Difference]: Without dead ends: 1312 [2019-02-15 11:28:39,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2019-02-15 11:28:39,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2019-02-15 11:28:40,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 839. [2019-02-15 11:28:40,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-02-15 11:28:40,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 5721 transitions. [2019-02-15 11:28:40,212 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 5721 transitions. Word has length 6 [2019-02-15 11:28:40,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:28:40,212 INFO L480 AbstractCegarLoop]: Abstraction has 839 states and 5721 transitions. [2019-02-15 11:28:40,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:28:40,212 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 5721 transitions. [2019-02-15 11:28:40,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:28:40,213 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:28:40,214 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:28:40,214 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:28:40,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:40,214 INFO L82 PathProgramCache]: Analyzing trace with hash 908550478, now seen corresponding path program 1 times [2019-02-15 11:28:40,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:28:40,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:40,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:40,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:40,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:28:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:40,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:40,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:40,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:28:40,268 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:28:40,268 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [24], [28], [29] [2019-02-15 11:28:40,269 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:28:40,269 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:28:40,557 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:28:40,557 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:28:40,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:40,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:28:40,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:40,558 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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:28:40,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:40,565 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:28:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:40,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:28:40,574 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:28:40,580 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:28:40,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:40,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:40,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:28:40,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:40,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:40,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:40,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:28:40,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:40,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:40,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:40,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:40,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:28:40,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:40,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:40,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:40,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:40,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:40,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-15 11:28:40,627 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:41,121 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:41,389 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:41,595 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:41,747 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:41,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:42,100 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-02-15 11:28:42,115 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-02-15 11:28:42,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 11:28:42,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 11:28:42,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:28:42,276 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:42,300 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:42,322 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:42,346 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:42,371 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:42,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:42,412 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-02-15 11:28:42,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-02-15 11:28:42,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:42,486 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-02-15 11:28:42,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-02-15 11:28:42,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 107 [2019-02-15 11:28:42,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:42,570 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-02-15 11:28:42,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:51 [2019-02-15 11:28:42,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:42,657 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:42,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 119 [2019-02-15 11:28:42,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:42,704 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-02-15 11:28:42,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2019-02-15 11:28:42,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:42,730 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:28:42,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:42,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:28:42,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:28:42,807 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:28:42,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:28:42,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:28:42,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:28:42,807 INFO L87 Difference]: Start difference. First operand 839 states and 5721 transitions. Second operand 10 states. [2019-02-15 11:28:43,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:28:43,707 INFO L93 Difference]: Finished difference Result 881 states and 5780 transitions. [2019-02-15 11:28:43,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:28:43,707 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:28:43,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:28:43,710 INFO L225 Difference]: With dead ends: 881 [2019-02-15 11:28:43,710 INFO L226 Difference]: Without dead ends: 880 [2019-02-15 11:28:43,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:28:43,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2019-02-15 11:28:44,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 841. [2019-02-15 11:28:44,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-02-15 11:28:44,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 5735 transitions. [2019-02-15 11:28:44,133 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 5735 transitions. Word has length 6 [2019-02-15 11:28:44,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:28:44,133 INFO L480 AbstractCegarLoop]: Abstraction has 841 states and 5735 transitions. [2019-02-15 11:28:44,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:28:44,133 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 5735 transitions. [2019-02-15 11:28:44,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:28:44,135 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:28:44,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:28:44,135 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:28:44,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:44,135 INFO L82 PathProgramCache]: Analyzing trace with hash 908133404, now seen corresponding path program 1 times [2019-02-15 11:28:44,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:28:44,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:44,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:44,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:44,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:28:44,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:44,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:44,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:44,209 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:28:44,209 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:28:44,209 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [22], [28], [29] [2019-02-15 11:28:44,210 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:28:44,210 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:28:44,478 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:28:44,479 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:28:44,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:44,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:28:44,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:44,479 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 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:28:44,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:44,487 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:28:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:44,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:28:44,501 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:28:44,508 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:28:44,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:44,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:44,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:28:44,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:44,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:44,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:44,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:28:44,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:44,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:44,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:44,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:44,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:28:44,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-15 11:28:44,546 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:44,571 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:44,588 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:44,604 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:44,616 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:44,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:44,650 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:28:44,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:44,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:44,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:28:44,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:44,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:44,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:44,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:44,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:28:44,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:44,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:44,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:44,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:44,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:44,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:44,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:28:44,743 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:44,758 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:44,771 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:44,787 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:44,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:44,816 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-15 11:28:44,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:44,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-15 11:28:44,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:44,883 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-02-15 11:28:44,883 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-15 11:28:44,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:44,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:44,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:44,907 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:44,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:44,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:44,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:44,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 11:28:44,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:28:45,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:28:45,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-02-15 11:28:45,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:45,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:45,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:45,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:45,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:45,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:45,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:45,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:45,085 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:45,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 11:28:45,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:45,106 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-02-15 11:28:45,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:27 [2019-02-15 11:28:45,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:45,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:28:45,148 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:45,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:28:45,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:28:45,167 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:28:45,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:28:45,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:28:45,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:28:45,167 INFO L87 Difference]: Start difference. First operand 841 states and 5735 transitions. Second operand 10 states. [2019-02-15 11:28:46,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:28:46,360 INFO L93 Difference]: Finished difference Result 1415 states and 9444 transitions. [2019-02-15 11:28:46,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:28:46,360 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:28:46,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:28:46,365 INFO L225 Difference]: With dead ends: 1415 [2019-02-15 11:28:46,365 INFO L226 Difference]: Without dead ends: 1413 [2019-02-15 11:28:46,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:28:46,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2019-02-15 11:28:47,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1280. [2019-02-15 11:28:47,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1280 states. [2019-02-15 11:28:47,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 8838 transitions. [2019-02-15 11:28:47,066 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 8838 transitions. Word has length 6 [2019-02-15 11:28:47,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:28:47,066 INFO L480 AbstractCegarLoop]: Abstraction has 1280 states and 8838 transitions. [2019-02-15 11:28:47,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:28:47,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 8838 transitions. [2019-02-15 11:28:47,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:28:47,069 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:28:47,069 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:28:47,069 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:28:47,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:47,069 INFO L82 PathProgramCache]: Analyzing trace with hash 909988134, now seen corresponding path program 1 times [2019-02-15 11:28:47,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:28:47,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:47,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:47,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:47,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:28:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:47,135 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:47,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:47,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:28:47,135 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:28:47,135 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [28], [29] [2019-02-15 11:28:47,136 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:28:47,136 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:28:47,418 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:28:47,419 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:28:47,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:47,419 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:28:47,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:47,419 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 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:28:47,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:47,428 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:28:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:47,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:28:47,436 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:28:47,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:47,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:47,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:28:47,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:47,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:47,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:47,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:47,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:28:47,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:47,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:47,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:47,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:47,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:47,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:47,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:28:47,567 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:47,580 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:47,594 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:47,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:47,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:28:47,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:28:47,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:28:47,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:28:47,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:28:47,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-15 11:28:47,654 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:47,676 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:47,694 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:47,707 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:47,718 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:47,730 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:47,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:47,759 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-15 11:28:47,939 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-02-15 11:28:47,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:47,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 41 treesize of output 87 [2019-02-15 11:28:47,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-02-15 11:28:48,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 7 xjuncts. [2019-02-15 11:28:48,362 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:381 [2019-02-15 11:28:50,402 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 192 DAG size of output: 82 [2019-02-15 11:28:50,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:50,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:50,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:50,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:50,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 57 [2019-02-15 11:28:50,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:50,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:50,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:50,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:50,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:50,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:50,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:50,500 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:50,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 95 [2019-02-15 11:28:50,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-02-15 11:28:50,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:50,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:50,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:50,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:50,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:50,660 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:50,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 93 [2019-02-15 11:28:50,669 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-02-15 11:28:50,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-1 vars, End of recursive call: 12 dim-0 vars, and 5 xjuncts. [2019-02-15 11:28:50,825 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 11 variables, input treesize:178, output treesize:184 [2019-02-15 11:28:50,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:50,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:50,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:50,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:50,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:50,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:50,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 71 [2019-02-15 11:28:50,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:50,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:50,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:50,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:50,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:50,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:50,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:50,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:50,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 61 [2019-02-15 11:28:50,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:51,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:51,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:51,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:51,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:51,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:51,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:51,050 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:51,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 53 [2019-02-15 11:28:51,051 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:51,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-02-15 11:28:51,094 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:132, output treesize:92 [2019-02-15 11:28:51,152 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:51,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:28:51,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:51,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:28:51,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:28:51,213 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:28:51,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:28:51,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:28:51,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:28:51,214 INFO L87 Difference]: Start difference. First operand 1280 states and 8838 transitions. Second operand 10 states. [2019-02-15 11:28:51,621 WARN L181 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-02-15 11:28:52,226 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-02-15 11:28:53,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:28:53,065 INFO L93 Difference]: Finished difference Result 1381 states and 9127 transitions. [2019-02-15 11:28:53,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:28:53,066 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:28:53,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:28:53,070 INFO L225 Difference]: With dead ends: 1381 [2019-02-15 11:28:53,070 INFO L226 Difference]: Without dead ends: 1379 [2019-02-15 11:28:53,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:28:53,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2019-02-15 11:28:53,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1274. [2019-02-15 11:28:53,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-02-15 11:28:53,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 8796 transitions. [2019-02-15 11:28:53,727 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 8796 transitions. Word has length 6 [2019-02-15 11:28:53,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:28:53,727 INFO L480 AbstractCegarLoop]: Abstraction has 1274 states and 8796 transitions. [2019-02-15 11:28:53,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:28:53,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 8796 transitions. [2019-02-15 11:28:53,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:28:53,729 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:28:53,729 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:28:53,729 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:28:53,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:53,730 INFO L82 PathProgramCache]: Analyzing trace with hash 909993964, now seen corresponding path program 1 times [2019-02-15 11:28:53,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:28:53,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:53,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:53,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:53,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:28:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:53,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:28:53,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:53,789 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:28:53,790 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:28:53,790 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [28], [30], [31] [2019-02-15 11:28:53,791 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:28:53,791 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:28:54,327 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:28:54,327 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:28:54,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:54,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:28:54,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:54,328 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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:28:54,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:54,335 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:28:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:54,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:28:54,345 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-02-15 11:28:54,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:54,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:54,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-02-15 11:28:54,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:54,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:54,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:54,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:54,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 11:28:54,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:54,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:54,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:54,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:54,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:54,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:54,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 11:28:54,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:54,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:54,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:54,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:54,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:54,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:54,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:54,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:54,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:28:54,531 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:54,554 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:54,578 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:54,602 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:54,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:54,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:28:54,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:28:54,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:28:54,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:28:54,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:28:54,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-15 11:28:54,699 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:54,730 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:54,748 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:54,762 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:54,773 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:54,785 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:54,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:54,826 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-02-15 11:28:54,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:54,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-02-15 11:28:54,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:54,892 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-02-15 11:28:54,893 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-02-15 11:28:54,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:54,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:54,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:54,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:54,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:54,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:54,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:54,925 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:54,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 112 [2019-02-15 11:28:54,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:28:55,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-02-15 11:28:55,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:110 [2019-02-15 11:28:56,949 WARN L181 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 72 DAG size of output: 35 [2019-02-15 11:28:56,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:56,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:28:56,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:56,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:28:56,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:28:56,992 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:28:56,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:28:56,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:28:56,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:28:56,993 INFO L87 Difference]: Start difference. First operand 1274 states and 8796 transitions. Second operand 8 states. [2019-02-15 11:28:58,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:28:58,109 INFO L93 Difference]: Finished difference Result 1306 states and 8833 transitions. [2019-02-15 11:28:58,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:28:58,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 11:28:58,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:28:58,114 INFO L225 Difference]: With dead ends: 1306 [2019-02-15 11:28:58,114 INFO L226 Difference]: Without dead ends: 1305 [2019-02-15 11:28:58,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:28:58,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2019-02-15 11:28:58,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1274. [2019-02-15 11:28:58,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-02-15 11:28:58,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 8796 transitions. [2019-02-15 11:28:58,768 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 8796 transitions. Word has length 6 [2019-02-15 11:28:58,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:28:58,768 INFO L480 AbstractCegarLoop]: Abstraction has 1274 states and 8796 transitions. [2019-02-15 11:28:58,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:28:58,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 8796 transitions. [2019-02-15 11:28:58,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:28:58,771 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:28:58,771 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:28:58,771 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:28:58,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:58,771 INFO L82 PathProgramCache]: Analyzing trace with hash 909980134, now seen corresponding path program 1 times [2019-02-15 11:28:58,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:28:58,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:58,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:58,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:58,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:28:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:58,909 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:58,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:58,909 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:28:58,909 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:28:58,909 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [27] [2019-02-15 11:28:58,911 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:28:58,911 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:28:59,260 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:28:59,260 INFO L272 AbstractInterpreter]: Visited 6 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 11:28:59,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:59,260 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:28:59,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:59,261 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 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:28:59,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:59,268 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:28:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:59,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:28:59,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:59,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 68 treesize of output 71 [2019-02-15 11:28:59,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:59,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:59,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:28:59,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:59,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:59,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:59,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:59,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:28:59,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:59,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:59,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:59,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:59,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:59,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:59,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:28:59,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:59,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:59,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:59,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:59,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:59,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:59,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:59,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:59,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-15 11:28:59,500 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:59,526 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:59,550 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:59,576 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:59,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:59,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:28:59,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:28:59,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:28:59,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:28:59,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:28:59,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:28:59,664 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:59,697 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:59,716 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:59,732 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:59,776 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:59,788 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:59,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:59,831 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-02-15 11:28:59,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:59,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 11:28:59,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:59,919 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-02-15 11:28:59,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-15 11:28:59,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:59,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:59,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:59,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:59,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:59,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:59,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:59,960 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:59,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 112 [2019-02-15 11:28:59,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:00,008 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-02-15 11:29:00,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:59 [2019-02-15 11:29:00,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:00,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:00,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:00,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:00,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:00,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:00,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:00,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:00,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:00,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:00,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:00,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 115 [2019-02-15 11:29:00,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:00,096 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-02-15 11:29:00,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:73, output treesize:51 [2019-02-15 11:29:00,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:00,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:00,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:00,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:00,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:00,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:00,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:00,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:00,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:00,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:00,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:00,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:00,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:00,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:00,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:00,138 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:29:00,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 120 [2019-02-15 11:29:00,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:00,185 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-02-15 11:29:00,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-02-15 11:29:00,215 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:00,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:29:00,277 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:00,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:29:00,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 11:29:00,295 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:29:00,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:29:00,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:29:00,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:29:00,295 INFO L87 Difference]: Start difference. First operand 1274 states and 8796 transitions. Second operand 12 states. [2019-02-15 11:29:01,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:29:01,782 INFO L93 Difference]: Finished difference Result 1360 states and 9097 transitions. [2019-02-15 11:29:01,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:29:01,783 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 11:29:01,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:29:01,789 INFO L225 Difference]: With dead ends: 1360 [2019-02-15 11:29:01,789 INFO L226 Difference]: Without dead ends: 1358 [2019-02-15 11:29:01,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2019-02-15 11:29:01,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2019-02-15 11:29:02,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1309. [2019-02-15 11:29:02,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1309 states. [2019-02-15 11:29:02,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 9030 transitions. [2019-02-15 11:29:02,464 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 9030 transitions. Word has length 6 [2019-02-15 11:29:02,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:29:02,464 INFO L480 AbstractCegarLoop]: Abstraction has 1309 states and 9030 transitions. [2019-02-15 11:29:02,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:29:02,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 9030 transitions. [2019-02-15 11:29:02,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:29:02,467 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:29:02,467 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:29:02,467 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:29:02,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:29:02,467 INFO L82 PathProgramCache]: Analyzing trace with hash 896939676, now seen corresponding path program 2 times [2019-02-15 11:29:02,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:29:02,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:02,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:29:02,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:02,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:29:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:29:02,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:29:02,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:29:02,548 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:29:02,548 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:29:02,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:29:02,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:29:02,548 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 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:29:02,557 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:29:02,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:29:02,563 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:29:02,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:29:02,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:29:02,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:02,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 68 treesize of output 71 [2019-02-15 11:29:02,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:02,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:02,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:29:02,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:02,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:02,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:02,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:02,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:29:02,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:02,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:02,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:02,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:02,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:02,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:02,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:29:02,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:02,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:02,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:02,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:02,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:02,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:02,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:02,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:02,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-15 11:29:02,823 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:02,849 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:02,877 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:02,906 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:02,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:02,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:29:02,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:29:02,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:29:02,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:29:02,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:29:02,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:29:02,985 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:03,021 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:03,040 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:03,056 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:03,068 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:03,080 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:03,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:29:03,124 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-15 11:29:03,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:03,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 11:29:03,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:03,197 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-02-15 11:29:03,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 11:29:03,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:03,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:03,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:03,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:03,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:03,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:03,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:03,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:03,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-02-15 11:29:03,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:03,275 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-02-15 11:29:03,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-15 11:29:03,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:03,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:03,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:03,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:03,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:03,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:03,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:03,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:03,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:03,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:03,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:03,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:03,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:03,311 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:29:03,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-02-15 11:29:03,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:03,359 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-02-15 11:29:03,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-15 11:29:03,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:03,381 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:29:03,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:03,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:29:03,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:29:03,437 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:29:03,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:29:03,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:29:03,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:29:03,438 INFO L87 Difference]: Start difference. First operand 1309 states and 9030 transitions. Second operand 10 states. [2019-02-15 11:29:05,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:29:05,094 INFO L93 Difference]: Finished difference Result 1898 states and 12744 transitions. [2019-02-15 11:29:05,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:29:05,095 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:29:05,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:29:05,100 INFO L225 Difference]: With dead ends: 1898 [2019-02-15 11:29:05,100 INFO L226 Difference]: Without dead ends: 1896 [2019-02-15 11:29:05,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:29:05,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-02-15 11:29:06,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1669. [2019-02-15 11:29:06,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2019-02-15 11:29:06,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 11590 transitions. [2019-02-15 11:29:06,073 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 11590 transitions. Word has length 6 [2019-02-15 11:29:06,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:29:06,074 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 11590 transitions. [2019-02-15 11:29:06,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:29:06,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 11590 transitions. [2019-02-15 11:29:06,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:29:06,078 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:29:06,078 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:29:06,078 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:29:06,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:29:06,078 INFO L82 PathProgramCache]: Analyzing trace with hash 897602894, now seen corresponding path program 1 times [2019-02-15 11:29:06,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:29:06,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:06,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:29:06,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:06,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:29:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:29:06,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:29:06,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:29:06,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-15 11:29:06,155 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:29:06,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-15 11:29:06,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-15 11:29:06,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-15 11:29:06,155 INFO L87 Difference]: Start difference. First operand 1669 states and 11590 transitions. Second operand 5 states. [2019-02-15 11:29:07,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:29:07,200 INFO L93 Difference]: Finished difference Result 1693 states and 11616 transitions. [2019-02-15 11:29:07,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 11:29:07,201 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-02-15 11:29:07,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:29:07,205 INFO L225 Difference]: With dead ends: 1693 [2019-02-15 11:29:07,205 INFO L226 Difference]: Without dead ends: 1692 [2019-02-15 11:29:07,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-02-15 11:29:07,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2019-02-15 11:29:08,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1672. [2019-02-15 11:29:08,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-02-15 11:29:08,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 11593 transitions. [2019-02-15 11:29:08,163 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 11593 transitions. Word has length 6 [2019-02-15 11:29:08,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:29:08,163 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 11593 transitions. [2019-02-15 11:29:08,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-15 11:29:08,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 11593 transitions. [2019-02-15 11:29:08,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:29:08,166 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:29:08,166 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:29:08,166 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:29:08,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:29:08,167 INFO L82 PathProgramCache]: Analyzing trace with hash 900997082, now seen corresponding path program 1 times [2019-02-15 11:29:08,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:29:08,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:08,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:29:08,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:08,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:29:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:29:08,332 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2019-02-15 11:29:08,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:08,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:29:08,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:29:08,344 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:29:08,344 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [28], [30], [31] [2019-02-15 11:29:08,344 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:29:08,345 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:29:08,552 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:29:08,553 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:29:08,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:29:08,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:29:08,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:29:08,553 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 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:29:08,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:29:08,562 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:29:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:29:08,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:29:08,583 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:29:08,585 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:29:08,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:08,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:08,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:29:08,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:08,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:08,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:08,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:29:08,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:08,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:08,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:08,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:08,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:29:08,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:08,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:08,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:08,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:08,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:08,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-15 11:29:08,618 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:08,658 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:08,679 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:08,695 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:08,708 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:08,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:08,746 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-02-15 11:29:08,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:08,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:08,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-02-15 11:29:08,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:08,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:08,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:08,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:08,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 11:29:08,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:08,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:08,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:08,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:08,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:08,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:08,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 11:29:08,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:08,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:08,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:08,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:08,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:08,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:08,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:08,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:08,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:29:08,919 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:08,942 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:08,963 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:08,987 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:09,012 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:09,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:29:09,054 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:84, output treesize:87 [2019-02-15 11:29:09,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:09,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-02-15 11:29:09,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:09,120 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-02-15 11:29:09,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-02-15 11:29:09,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:09,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:09,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:09,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:09,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:09,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:09,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:09,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:09,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 99 [2019-02-15 11:29:09,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:09,192 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-02-15 11:29:09,192 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:51 [2019-02-15 11:29:09,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:09,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:29:09,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:09,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:29:09,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 11:29:09,240 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:29:09,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:29:09,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:29:09,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:29:09,240 INFO L87 Difference]: Start difference. First operand 1672 states and 11593 transitions. Second operand 8 states. [2019-02-15 11:29:11,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:29:11,240 INFO L93 Difference]: Finished difference Result 2759 states and 18997 transitions. [2019-02-15 11:29:11,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:29:11,241 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 11:29:11,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:29:11,248 INFO L225 Difference]: With dead ends: 2759 [2019-02-15 11:29:11,249 INFO L226 Difference]: Without dead ends: 2757 [2019-02-15 11:29:11,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:29:11,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2019-02-15 11:29:12,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 2639. [2019-02-15 11:29:12,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2019-02-15 11:29:12,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 18434 transitions. [2019-02-15 11:29:12,914 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 18434 transitions. Word has length 6 [2019-02-15 11:29:12,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:29:12,914 INFO L480 AbstractCegarLoop]: Abstraction has 2639 states and 18434 transitions. [2019-02-15 11:29:12,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:29:12,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 18434 transitions. [2019-02-15 11:29:12,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:29:12,918 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:29:12,918 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:29:12,918 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:29:12,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:29:12,919 INFO L82 PathProgramCache]: Analyzing trace with hash 900629790, now seen corresponding path program 1 times [2019-02-15 11:29:12,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:29:12,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:12,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:29:12,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:12,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:29:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:29:13,063 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:13,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:29:13,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:29:13,064 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:29:13,064 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [27] [2019-02-15 11:29:13,065 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:29:13,065 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:29:13,412 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:29:13,413 INFO L272 AbstractInterpreter]: Visited 6 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 11:29:13,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:29:13,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:29:13,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:29:13,413 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 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:29:13,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:29:13,422 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:29:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:29:13,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:29:13,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:29:13,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:29:13,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:29:13,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:29:13,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:29:13,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:29:13,497 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:13,534 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:13,555 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:13,573 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:13,586 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:13,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:13,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 68 treesize of output 71 [2019-02-15 11:29:13,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:29:13,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:29:13,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:29:14,201 WARN L181 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-02-15 11:29:14,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-15 11:29:14,211 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:14,237 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:14,261 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:14,286 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:14,311 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:14,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:29:14,355 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-15 11:29:14,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 11:29:14,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:14,434 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-02-15 11:29:14,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 11:29:14,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,470 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:29:14,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 105 [2019-02-15 11:29:14,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:14,513 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-02-15 11:29:14,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:59 [2019-02-15 11:29:14,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-02-15 11:29:14,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:14,595 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-02-15 11:29:14,595 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:69, output treesize:47 [2019-02-15 11:29:14,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,635 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:29:14,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-02-15 11:29:14,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:14,686 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-02-15 11:29:14,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:43 [2019-02-15 11:29:14,712 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:14,712 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:29:14,761 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:14,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:29:14,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 11:29:14,779 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:29:14,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:29:14,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:29:14,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:29:14,780 INFO L87 Difference]: Start difference. First operand 2639 states and 18434 transitions. Second operand 12 states. [2019-02-15 11:29:18,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:29:18,134 INFO L93 Difference]: Finished difference Result 3636 states and 24951 transitions. [2019-02-15 11:29:18,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:29:18,135 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 11:29:18,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:29:18,145 INFO L225 Difference]: With dead ends: 3636 [2019-02-15 11:29:18,146 INFO L226 Difference]: Without dead ends: 3626 [2019-02-15 11:29:18,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-02-15 11:29:18,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3626 states. [2019-02-15 11:29:20,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3626 to 2790. [2019-02-15 11:29:20,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2790 states. [2019-02-15 11:29:20,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 19490 transitions. [2019-02-15 11:29:20,465 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 19490 transitions. Word has length 6 [2019-02-15 11:29:20,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:29:20,465 INFO L480 AbstractCegarLoop]: Abstraction has 2790 states and 19490 transitions. [2019-02-15 11:29:20,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:29:20,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 19490 transitions. [2019-02-15 11:29:20,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:29:20,469 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:29:20,469 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:29:20,469 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:29:20,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:29:20,469 INFO L82 PathProgramCache]: Analyzing trace with hash 900752924, now seen corresponding path program 2 times [2019-02-15 11:29:20,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:29:20,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:20,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:29:20,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:20,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:29:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:29:20,520 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:20,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:29:20,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:29:20,521 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:29:20,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:29:20,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:29:20,521 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 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:29:20,530 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:29:20,530 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:29:20,536 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:29:20,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:29:20,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:29:20,540 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:29:20,544 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:29:20,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:20,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:20,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:29:20,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:20,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:20,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:20,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:29:20,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:20,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:20,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:20,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:20,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:29:20,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:20,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:20,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:20,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:20,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:20,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-15 11:29:20,578 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:20,616 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:20,637 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:20,653 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:20,666 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:20,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:20,706 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-02-15 11:29:20,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:20,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:20,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-02-15 11:29:20,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:20,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:20,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:20,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:20,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 11:29:20,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:20,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:20,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:20,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:20,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:20,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:20,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 11:29:20,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:20,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:20,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:20,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:20,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:20,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:20,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:20,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:20,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:29:20,884 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:20,907 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:20,930 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:20,954 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:20,979 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:21,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:29:21,021 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-02-15 11:29:21,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:21,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-02-15 11:29:21,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:21,088 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-02-15 11:29:21,089 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-02-15 11:29:21,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:21,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:21,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:21,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:21,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:21,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:21,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:21,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:21,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 111 [2019-02-15 11:29:21,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:29:21,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:29:21,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:98 [2019-02-15 11:29:21,400 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 31 [2019-02-15 11:29:21,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:21,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:21,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:21,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:21,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:21,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:21,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:21,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:21,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:21,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:21,413 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:29:21,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 11:29:21,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:21,449 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-02-15 11:29:21,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:36 [2019-02-15 11:29:21,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:21,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:29:21,490 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:21,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:29:21,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:29:21,507 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:29:21,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:29:21,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:29:21,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:29:21,508 INFO L87 Difference]: Start difference. First operand 2790 states and 19490 transitions. Second operand 10 states. [2019-02-15 11:29:25,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:29:25,395 INFO L93 Difference]: Finished difference Result 4300 states and 29900 transitions. [2019-02-15 11:29:25,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:29:25,395 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:29:25,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:29:25,408 INFO L225 Difference]: With dead ends: 4300 [2019-02-15 11:29:25,408 INFO L226 Difference]: Without dead ends: 4298 [2019-02-15 11:29:25,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:29:25,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4298 states. [2019-02-15 11:29:28,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4298 to 4076. [2019-02-15 11:29:28,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4076 states. [2019-02-15 11:29:28,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4076 states to 4076 states and 28660 transitions. [2019-02-15 11:29:28,914 INFO L78 Accepts]: Start accepts. Automaton has 4076 states and 28660 transitions. Word has length 6 [2019-02-15 11:29:28,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:29:28,914 INFO L480 AbstractCegarLoop]: Abstraction has 4076 states and 28660 transitions. [2019-02-15 11:29:28,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:29:28,914 INFO L276 IsEmpty]: Start isEmpty. Operand 4076 states and 28660 transitions. [2019-02-15 11:29:28,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:29:28,920 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:29:28,920 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:29:28,920 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:29:28,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:29:28,920 INFO L82 PathProgramCache]: Analyzing trace with hash -2030611754, now seen corresponding path program 1 times [2019-02-15 11:29:28,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:29:28,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:28,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:29:28,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:28,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:29:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:29:28,982 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:29:28,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:29:28,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:29:28,982 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:29:28,982 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [24], [28], [29] [2019-02-15 11:29:28,983 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:29:28,983 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:29:29,427 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:29:29,427 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 11:29:29,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:29:29,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:29:29,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:29:29,427 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 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:29:29,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:29:29,436 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:29:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:29:29,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:29:29,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:29:29,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:29:29,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:29:29,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:29:29,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:29:29,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:29:29,505 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:29,544 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:29,566 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:29,584 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:29,597 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:29,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:29,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 68 treesize of output 71 [2019-02-15 11:29:29,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:29:29,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:29:29,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:29:29,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:29,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-15 11:29:29,850 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:29,875 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:29,912 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:29,938 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:29,963 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:30,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:29:30,007 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-02-15 11:29:30,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 11:29:30,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:30,101 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-02-15 11:29:30,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-15 11:29:30,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-02-15 11:29:30,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:30,191 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-02-15 11:29:30,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-02-15 11:29:30,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,236 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:29:30,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 119 [2019-02-15 11:29:30,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:30,285 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-02-15 11:29:30,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-02-15 11:29:30,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,330 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:29:30,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:30,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-02-15 11:29:30,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:30,380 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-02-15 11:29:30,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:43 [2019-02-15 11:29:30,407 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:30,407 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:29:30,462 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:30,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:29:30,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-15 11:29:30,481 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:29:30,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:29:30,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:29:30,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:29:30,481 INFO L87 Difference]: Start difference. First operand 4076 states and 28660 transitions. Second operand 11 states. [2019-02-15 11:29:34,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:29:34,636 INFO L93 Difference]: Finished difference Result 4236 states and 29539 transitions. [2019-02-15 11:29:34,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:29:34,636 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-15 11:29:34,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:29:34,649 INFO L225 Difference]: With dead ends: 4236 [2019-02-15 11:29:34,650 INFO L226 Difference]: Without dead ends: 4233 [2019-02-15 11:29:34,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-02-15 11:29:34,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4233 states. [2019-02-15 11:29:38,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4233 to 4163. [2019-02-15 11:29:38,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4163 states. [2019-02-15 11:29:38,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4163 states to 4163 states and 29269 transitions. [2019-02-15 11:29:38,198 INFO L78 Accepts]: Start accepts. Automaton has 4163 states and 29269 transitions. Word has length 7 [2019-02-15 11:29:38,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:29:38,198 INFO L480 AbstractCegarLoop]: Abstraction has 4163 states and 29269 transitions. [2019-02-15 11:29:38,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:29:38,199 INFO L276 IsEmpty]: Start isEmpty. Operand 4163 states and 29269 transitions. [2019-02-15 11:29:38,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:29:38,204 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:29:38,204 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:29:38,204 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:29:38,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:29:38,204 INFO L82 PathProgramCache]: Analyzing trace with hash -2030621364, now seen corresponding path program 1 times [2019-02-15 11:29:38,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:29:38,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:38,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:29:38,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:38,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:29:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:29:38,290 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:29:38,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:29:38,291 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:29:38,291 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:29:38,291 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [22], [28], [29] [2019-02-15 11:29:38,292 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:29:38,292 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:29:38,628 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:29:38,628 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 11:29:38,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:29:38,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:29:38,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:29:38,629 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 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:29:38,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:29:38,637 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:29:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:29:38,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:29:38,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:38,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 48 treesize of output 54 [2019-02-15 11:29:38,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:38,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:38,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:29:38,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:38,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:38,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:38,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:38,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:29:38,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:38,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:38,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:38,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:38,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:38,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:38,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:29:38,797 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:38,813 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:38,829 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:38,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:38,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:29:38,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:29:38,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:29:38,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:29:38,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:29:38,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-15 11:29:38,887 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:38,913 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:38,932 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:38,947 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:38,959 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:38,970 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:39,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:29:39,001 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:72, output treesize:71 [2019-02-15 11:29:39,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:39,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 11:29:39,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:39,091 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-02-15 11:29:39,091 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-02-15 11:29:39,253 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-02-15 11:29:39,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:39,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:39,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:39,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:39,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:39,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:39,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:39,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 11:29:39,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:39,296 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-02-15 11:29:39,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-02-15 11:29:39,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:39,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:39,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:39,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:39,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:39,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:39,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:39,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:39,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:39,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:39,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:39,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:39,335 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:29:39,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-02-15 11:29:39,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:39,371 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-02-15 11:29:39,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-02-15 11:29:39,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:39,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:39,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:39,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:39,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:39,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:39,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:39,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:39,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:39,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:39,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:39,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:39,418 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:29:39,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 11:29:39,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:39,453 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-02-15 11:29:39,454 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-02-15 11:29:39,478 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:39,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:29:39,537 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:39,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:29:39,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 11:29:39,556 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:29:39,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:29:39,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:29:39,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:29:39,556 INFO L87 Difference]: Start difference. First operand 4163 states and 29269 transitions. Second operand 12 states. [2019-02-15 11:29:43,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:29:43,562 INFO L93 Difference]: Finished difference Result 4232 states and 29577 transitions. [2019-02-15 11:29:43,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:29:43,562 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-15 11:29:43,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:29:43,574 INFO L225 Difference]: With dead ends: 4232 [2019-02-15 11:29:43,575 INFO L226 Difference]: Without dead ends: 4231 [2019-02-15 11:29:43,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2019-02-15 11:29:43,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4231 states. [2019-02-15 11:29:47,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4231 to 4190. [2019-02-15 11:29:47,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4190 states. [2019-02-15 11:29:47,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 29458 transitions. [2019-02-15 11:29:47,195 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 29458 transitions. Word has length 7 [2019-02-15 11:29:47,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:29:47,195 INFO L480 AbstractCegarLoop]: Abstraction has 4190 states and 29458 transitions. [2019-02-15 11:29:47,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:29:47,195 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 29458 transitions. [2019-02-15 11:29:47,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:29:47,201 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:29:47,201 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:29:47,201 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:29:47,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:29:47,201 INFO L82 PathProgramCache]: Analyzing trace with hash -2030548264, now seen corresponding path program 1 times [2019-02-15 11:29:47,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:29:47,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:47,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:29:47,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:47,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:29:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:29:47,333 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:29:47,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:29:47,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:29:47,334 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:29:47,334 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [28], [30], [31] [2019-02-15 11:29:47,335 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:29:47,335 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:29:47,713 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:29:47,713 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:29:47,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:29:47,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:29:47,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:29:47,713 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 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:29:47,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:29:47,722 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:29:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:29:47,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:29:47,730 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-02-15 11:29:47,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:47,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:47,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-02-15 11:29:47,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:47,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:47,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:47,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:47,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 11:29:47,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:47,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:47,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:47,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:47,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:47,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:47,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 11:29:47,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:47,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:47,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:47,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:47,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:47,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:47,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:47,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:47,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:29:47,925 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:47,954 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:47,983 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:48,010 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:48,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:48,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:29:48,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:29:48,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:29:48,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:29:48,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:29:48,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-15 11:29:48,129 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:48,161 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:48,179 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:48,193 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:48,204 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:48,214 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:48,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:29:48,256 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-02-15 11:29:48,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:48,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-02-15 11:29:48,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:48,329 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-02-15 11:29:48,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-02-15 11:29:48,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:48,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:48,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:48,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:48,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:48,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:48,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:48,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:48,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 113 [2019-02-15 11:29:48,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:29:48,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:29:48,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:98 [2019-02-15 11:29:48,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:48,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:48,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:48,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:48,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:48,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:48,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:48,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:48,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:48,590 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:29:48,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:48,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-02-15 11:29:48,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:48,626 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-02-15 11:29:48,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-02-15 11:29:48,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:48,698 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:29:48,729 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:48,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:29:48,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:29:48,747 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:29:48,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:29:48,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:29:48,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:29:48,747 INFO L87 Difference]: Start difference. First operand 4190 states and 29458 transitions. Second operand 10 states. [2019-02-15 11:29:52,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:29:52,800 INFO L93 Difference]: Finished difference Result 4570 states and 31903 transitions. [2019-02-15 11:29:52,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:29:52,800 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 11:29:52,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:29:52,813 INFO L225 Difference]: With dead ends: 4570 [2019-02-15 11:29:52,813 INFO L226 Difference]: Without dead ends: 4569 [2019-02-15 11:29:52,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:29:52,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4569 states. [2019-02-15 11:29:56,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4569 to 4419. [2019-02-15 11:29:56,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4419 states. [2019-02-15 11:29:56,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4419 states to 4419 states and 31072 transitions. [2019-02-15 11:29:56,603 INFO L78 Accepts]: Start accepts. Automaton has 4419 states and 31072 transitions. Word has length 7 [2019-02-15 11:29:56,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:29:56,603 INFO L480 AbstractCegarLoop]: Abstraction has 4419 states and 31072 transitions. [2019-02-15 11:29:56,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:29:56,604 INFO L276 IsEmpty]: Start isEmpty. Operand 4419 states and 31072 transitions. [2019-02-15 11:29:56,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:29:56,610 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:29:56,610 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:29:56,610 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:29:56,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:29:56,610 INFO L82 PathProgramCache]: Analyzing trace with hash -2030561782, now seen corresponding path program 1 times [2019-02-15 11:29:56,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:29:56,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:56,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:29:56,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:56,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:29:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:29:56,820 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:29:56,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:29:56,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:29:56,821 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:29:56,821 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [28], [29] [2019-02-15 11:29:56,822 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:29:56,822 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:29:57,538 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:29:57,538 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 11:29:57,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:29:57,538 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:29:57,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:29:57,539 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 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:29:57,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:29:57,547 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:29:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:29:57,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:29:57,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:29:57,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:29:57,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:29:57,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:29:57,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:29:57,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:29:57,606 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:57,645 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:57,667 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:57,685 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:57,698 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:57,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:57,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 68 treesize of output 71 [2019-02-15 11:29:57,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:29:57,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:29:57,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:29:57,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:57,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-15 11:29:57,949 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:57,974 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:57,999 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:58,023 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:58,048 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:58,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:29:58,092 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-02-15 11:29:58,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 11:29:58,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:58,176 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-02-15 11:29:58,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-15 11:29:58,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-02-15 11:29:58,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:58,343 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-02-15 11:29:58,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-02-15 11:29:58,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,386 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:29:58,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-02-15 11:29:58,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:58,436 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-02-15 11:29:58,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-02-15 11:29:58,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:58,483 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:29:58,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 131 [2019-02-15 11:29:58,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:58,535 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-02-15 11:29:58,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:47 [2019-02-15 11:29:58,564 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:58,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:29:58,646 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:58,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:29:58,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 11:29:58,666 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:29:58,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:29:58,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:29:58,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:29:58,667 INFO L87 Difference]: Start difference. First operand 4419 states and 31072 transitions. Second operand 12 states. [2019-02-15 11:30:06,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:30:06,365 INFO L93 Difference]: Finished difference Result 5928 states and 41521 transitions. [2019-02-15 11:30:06,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:30:06,365 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-15 11:30:06,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:30:06,384 INFO L225 Difference]: With dead ends: 5928 [2019-02-15 11:30:06,384 INFO L226 Difference]: Without dead ends: 5927 [2019-02-15 11:30:06,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-02-15 11:30:06,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5927 states. [2019-02-15 11:30:11,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5927 to 5628. [2019-02-15 11:30:11,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5628 states. [2019-02-15 11:30:11,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5628 states to 5628 states and 39710 transitions. [2019-02-15 11:30:11,630 INFO L78 Accepts]: Start accepts. Automaton has 5628 states and 39710 transitions. Word has length 7 [2019-02-15 11:30:11,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:30:11,631 INFO L480 AbstractCegarLoop]: Abstraction has 5628 states and 39710 transitions. [2019-02-15 11:30:11,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:30:11,631 INFO L276 IsEmpty]: Start isEmpty. Operand 5628 states and 39710 transitions. [2019-02-15 11:30:11,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:30:11,637 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:30:11,637 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:30:11,638 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:30:11,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:30:11,638 INFO L82 PathProgramCache]: Analyzing trace with hash -2030965338, now seen corresponding path program 1 times [2019-02-15 11:30:11,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:30:11,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:30:11,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:30:11,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:30:11,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:30:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:30:11,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:30:11,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:30:11,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:30:11,751 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:30:11,751 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [28], [30], [31] [2019-02-15 11:30:11,752 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:30:11,752 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:30:12,026 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:30:12,026 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:30:12,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:30:12,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:30:12,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:30:12,027 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 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:30:12,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:30:12,035 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:30:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:30:12,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:30:12,043 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:30:12,050 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:30:12,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:30:12,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:30:12,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:30:12,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-15 11:30:12,100 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:30:12,125 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:12,143 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:12,158 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:12,170 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:12,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:12,204 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:30:12,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:30:12,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:30:12,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:30:12,301 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:30:12,315 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:12,329 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:12,344 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:12,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:30:12,374 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-02-15 11:30:12,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-15 11:30:12,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:30:12,446 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-02-15 11:30:12,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-02-15 11:30:12,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 11:30:12,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:30:12,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:30:12,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:68 [2019-02-15 11:30:12,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,635 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:30:12,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 101 [2019-02-15 11:30:12,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:30:12,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,700 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:30:12,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2019-02-15 11:30:12,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:30:12,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:30:12,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-02-15 11:30:12,801 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:30:12,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:30:12,831 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:30:12,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:30:12,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-15 11:30:12,849 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:30:12,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:30:12,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:30:12,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:30:12,850 INFO L87 Difference]: Start difference. First operand 5628 states and 39710 transitions. Second operand 11 states. [2019-02-15 11:30:19,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:30:19,495 INFO L93 Difference]: Finished difference Result 6511 states and 45570 transitions. [2019-02-15 11:30:19,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:30:19,495 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-15 11:30:19,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:30:19,516 INFO L225 Difference]: With dead ends: 6511 [2019-02-15 11:30:19,516 INFO L226 Difference]: Without dead ends: 6510 [2019-02-15 11:30:19,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:30:19,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6510 states. [2019-02-15 11:30:26,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6510 to 6405. [2019-02-15 11:30:26,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6405 states. [2019-02-15 11:30:26,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6405 states to 6405 states and 45149 transitions. [2019-02-15 11:30:26,236 INFO L78 Accepts]: Start accepts. Automaton has 6405 states and 45149 transitions. Word has length 7 [2019-02-15 11:30:26,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:30:26,237 INFO L480 AbstractCegarLoop]: Abstraction has 6405 states and 45149 transitions. [2019-02-15 11:30:26,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:30:26,237 INFO L276 IsEmpty]: Start isEmpty. Operand 6405 states and 45149 transitions. [2019-02-15 11:30:26,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:30:26,246 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:30:26,246 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:30:26,247 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:30:26,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:30:26,247 INFO L82 PathProgramCache]: Analyzing trace with hash -2015785446, now seen corresponding path program 1 times [2019-02-15 11:30:26,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:30:26,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:30:26,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:30:26,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:30:26,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:30:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:30:26,566 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:30:26,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:30:26,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:30:26,566 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:30:26,566 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [24], [28], [29] [2019-02-15 11:30:26,567 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:30:26,567 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:30:26,932 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:30:26,933 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 11:30:26,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:30:26,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:30:26,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:30:26,933 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 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:30:26,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:30:26,943 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:30:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:30:26,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:30:26,951 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-02-15 11:30:26,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:26,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:26,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-02-15 11:30:27,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 11:30:27,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 11:30:27,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:30:27,138 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:30:27,163 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:27,186 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:27,211 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:27,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:27,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:30:27,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:30:27,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:30:27,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:30:27,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:30:27,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-15 11:30:27,290 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:30:27,321 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:27,339 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:27,353 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:27,364 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:27,375 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:27,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:30:27,416 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:84, output treesize:87 [2019-02-15 11:30:27,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 11:30:27,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:30:27,514 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-02-15 11:30:27,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-02-15 11:30:27,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-02-15 11:30:27,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:30:27,585 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-02-15 11:30:27,586 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-02-15 11:30:27,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,625 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:30:27,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-02-15 11:30:27,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:30:27,661 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-02-15 11:30:27,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:34 [2019-02-15 11:30:27,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:27,700 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:30:27,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 100 [2019-02-15 11:30:27,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:30:27,735 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-02-15 11:30:27,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 11:30:27,762 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:30:27,762 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:30:27,833 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:30:27,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:30:27,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-02-15 11:30:27,852 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:30:27,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 11:30:27,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 11:30:27,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:30:27,853 INFO L87 Difference]: Start difference. First operand 6405 states and 45149 transitions. Second operand 13 states. [2019-02-15 11:30:36,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:30:36,244 INFO L93 Difference]: Finished difference Result 7179 states and 50083 transitions. [2019-02-15 11:30:36,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-15 11:30:36,245 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-02-15 11:30:36,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:30:36,267 INFO L225 Difference]: With dead ends: 7179 [2019-02-15 11:30:36,267 INFO L226 Difference]: Without dead ends: 7170 [2019-02-15 11:30:36,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2019-02-15 11:30:36,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states. [2019-02-15 11:30:43,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 6542. [2019-02-15 11:30:43,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6542 states. [2019-02-15 11:30:43,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6542 states to 6542 states and 46140 transitions. [2019-02-15 11:30:43,067 INFO L78 Accepts]: Start accepts. Automaton has 6542 states and 46140 transitions. Word has length 7 [2019-02-15 11:30:43,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:30:43,067 INFO L480 AbstractCegarLoop]: Abstraction has 6542 states and 46140 transitions. [2019-02-15 11:30:43,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 11:30:43,067 INFO L276 IsEmpty]: Start isEmpty. Operand 6542 states and 46140 transitions. [2019-02-15 11:30:43,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:30:43,074 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:30:43,074 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:30:43,074 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:30:43,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:30:43,074 INFO L82 PathProgramCache]: Analyzing trace with hash -2015650778, now seen corresponding path program 1 times [2019-02-15 11:30:43,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:30:43,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:30:43,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:30:43,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:30:43,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:30:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:30:43,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:30:43,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:30:43,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:30:43,113 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:30:43,113 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [28], [30], [32], [33] [2019-02-15 11:30:43,114 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:30:43,114 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:30:43,327 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:30:43,327 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:30:43,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:30:43,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:30:43,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:30:43,327 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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:30:43,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:30:43,338 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:30:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:30:43,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:30:43,346 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2019-02-15 11:30:43,350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-02-15 11:30:43,359 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2019-02-15 11:30:43,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:43,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:43,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:43,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:43,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 56 [2019-02-15 11:30:43,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:43,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:43,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:43,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:43,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:43,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:43,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:43,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:43,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 37 [2019-02-15 11:30:43,435 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:30:43,451 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:43,467 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:43,483 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:43,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:43,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 21 treesize of output 24 [2019-02-15 11:30:43,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:30:43,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-15 11:30:43,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-02-15 11:30:43,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 48 [2019-02-15 11:30:43,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-15 11:30:43,558 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:30:43,581 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:43,591 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:43,602 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:43,613 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:43,624 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:43,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:30:43,654 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:59, output treesize:67 [2019-02-15 11:30:43,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:43,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 79 [2019-02-15 11:30:43,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-15 11:30:43,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 20 dim-0 vars, and 8 xjuncts. [2019-02-15 11:30:43,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:369 [2019-02-15 11:30:44,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:44,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:44,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:44,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:44,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2019-02-15 11:30:44,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:30:44,087 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-02-15 11:30:44,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2019-02-15 11:30:44,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:30:44,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:30:44,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:30:44,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:30:44,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 11:30:44,129 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:30:44,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:30:44,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:30:44,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:30:44,130 INFO L87 Difference]: Start difference. First operand 6542 states and 46140 transitions. Second operand 8 states. [2019-02-15 11:30:53,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:30:53,561 INFO L93 Difference]: Finished difference Result 10441 states and 73753 transitions. [2019-02-15 11:30:53,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:30:53,561 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-15 11:30:53,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:30:53,594 INFO L225 Difference]: With dead ends: 10441 [2019-02-15 11:30:53,594 INFO L226 Difference]: Without dead ends: 10440 [2019-02-15 11:30:53,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:30:53,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10440 states. [2019-02-15 11:31:03,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10440 to 10397. [2019-02-15 11:31:03,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10397 states. [2019-02-15 11:31:03,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10397 states to 10397 states and 73709 transitions. [2019-02-15 11:31:03,830 INFO L78 Accepts]: Start accepts. Automaton has 10397 states and 73709 transitions. Word has length 7 [2019-02-15 11:31:03,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:31:03,830 INFO L480 AbstractCegarLoop]: Abstraction has 10397 states and 73709 transitions. [2019-02-15 11:31:03,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:31:03,830 INFO L276 IsEmpty]: Start isEmpty. Operand 10397 states and 73709 transitions. [2019-02-15 11:31:03,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:31:03,840 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:31:03,840 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:31:03,840 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:31:03,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:31:03,840 INFO L82 PathProgramCache]: Analyzing trace with hash -2014341960, now seen corresponding path program 1 times [2019-02-15 11:31:03,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:31:03,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:31:03,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:31:03,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:31:03,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:31:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:31:03,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:31:03,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:31:03,931 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:31:03,931 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:31:03,931 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [28], [30], [31] [2019-02-15 11:31:03,932 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:31:03,932 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:31:04,220 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:31:04,220 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:31:04,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:31:04,220 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:31:04,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:31:04,220 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 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:31:04,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:31:04,229 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:31:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:31:04,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:31:04,237 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:31:04,243 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:31:04,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:31:04,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:31:04,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:31:04,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-15 11:31:04,280 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:04,315 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:04,336 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:04,352 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:04,365 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:04,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:04,404 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-02-15 11:31:04,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-02-15 11:31:04,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 11:31:04,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 11:31:04,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:31:04,581 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:04,604 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:04,627 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:04,650 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:04,675 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:04,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:31:04,716 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-02-15 11:31:04,747 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-02-15 11:31:04,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:04,788 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-02-15 11:31:04,788 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-02-15 11:31:04,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,820 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:31:04,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 102 [2019-02-15 11:31:04,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:04,864 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-02-15 11:31:04,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:55 [2019-02-15 11:31:04,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,899 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:31:04,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 108 [2019-02-15 11:31:04,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:31:05,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-02-15 11:31:05,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:69, output treesize:102 [2019-02-15 11:31:05,100 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:31:05,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:31:05,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:31:05,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:31:05,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:31:05,156 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:31:05,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:31:05,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:31:05,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:31:05,157 INFO L87 Difference]: Start difference. First operand 10397 states and 73709 transitions. Second operand 10 states. [2019-02-15 11:31:14,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:31:14,810 INFO L93 Difference]: Finished difference Result 10427 states and 73743 transitions. [2019-02-15 11:31:14,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:31:14,810 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 11:31:14,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:31:14,844 INFO L225 Difference]: With dead ends: 10427 [2019-02-15 11:31:14,844 INFO L226 Difference]: Without dead ends: 10426 [2019-02-15 11:31:14,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:31:14,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10426 states. [2019-02-15 11:31:25,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10426 to 10394. [2019-02-15 11:31:25,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10394 states. [2019-02-15 11:31:25,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10394 states to 10394 states and 73688 transitions. [2019-02-15 11:31:25,111 INFO L78 Accepts]: Start accepts. Automaton has 10394 states and 73688 transitions. Word has length 7 [2019-02-15 11:31:25,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:31:25,111 INFO L480 AbstractCegarLoop]: Abstraction has 10394 states and 73688 transitions. [2019-02-15 11:31:25,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:31:25,111 INFO L276 IsEmpty]: Start isEmpty. Operand 10394 states and 73688 transitions. [2019-02-15 11:31:25,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:31:25,121 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:31:25,121 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:31:25,122 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:31:25,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:31:25,122 INFO L82 PathProgramCache]: Analyzing trace with hash -2026927280, now seen corresponding path program 1 times [2019-02-15 11:31:25,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:31:25,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:31:25,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:31:25,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:31:25,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:31:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:31:25,235 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:31:25,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:31:25,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:31:25,236 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:31:25,236 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [28], [29] [2019-02-15 11:31:25,237 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:31:25,237 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:31:25,571 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:31:25,572 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 11:31:25,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:31:25,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:31:25,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:31:25,572 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 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:31:25,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:31:25,583 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:31:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:31:25,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:31:25,596 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:31:25,601 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:31:25,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:31:25,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:31:25,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:31:25,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-15 11:31:25,639 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:25,665 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:25,685 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:25,701 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:25,713 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:25,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:25,748 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:31:25,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:31:25,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:31:25,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:31:25,844 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:25,858 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:25,872 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:25,887 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:25,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:31:25,916 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-02-15 11:31:25,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:31:25,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:25,981 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-02-15 11:31:25,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:31:26,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:26,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:26,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:26,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:26,006 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:31:26,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-02-15 11:31:26,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:26,027 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-02-15 11:31:26,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2019-02-15 11:31:26,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:26,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:26,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:26,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:26,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:26,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:26,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:26,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-02-15 11:31:26,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:26,071 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-02-15 11:31:26,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-02-15 11:31:26,092 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:26,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:26,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:26,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:26,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:26,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:26,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:26,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:26,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:26,102 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:31:26,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-02-15 11:31:26,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:26,125 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-02-15 11:31:26,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-02-15 11:31:26,145 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:31:26,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:31:26,201 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:31:26,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:31:26,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 11:31:26,220 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:31:26,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:31:26,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:31:26,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:31:26,221 INFO L87 Difference]: Start difference. First operand 10394 states and 73688 transitions. Second operand 12 states. [2019-02-15 11:31:36,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:31:36,677 INFO L93 Difference]: Finished difference Result 11408 states and 80747 transitions. [2019-02-15 11:31:36,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:31:36,677 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-15 11:31:36,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:31:36,717 INFO L225 Difference]: With dead ends: 11408 [2019-02-15 11:31:36,717 INFO L226 Difference]: Without dead ends: 11406 [2019-02-15 11:31:36,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-02-15 11:31:36,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11406 states. [2019-02-15 11:31:47,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11406 to 11270. [2019-02-15 11:31:47,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11270 states. [2019-02-15 11:31:47,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11270 states to 11270 states and 80138 transitions. [2019-02-15 11:31:47,534 INFO L78 Accepts]: Start accepts. Automaton has 11270 states and 80138 transitions. Word has length 7 [2019-02-15 11:31:47,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:31:47,534 INFO L480 AbstractCegarLoop]: Abstraction has 11270 states and 80138 transitions. [2019-02-15 11:31:47,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:31:47,534 INFO L276 IsEmpty]: Start isEmpty. Operand 11270 states and 80138 transitions. [2019-02-15 11:31:47,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:31:47,545 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:31:47,545 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-15 11:31:47,545 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:31:47,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:31:47,545 INFO L82 PathProgramCache]: Analyzing trace with hash -2023700554, now seen corresponding path program 2 times [2019-02-15 11:31:47,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:31:47,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:31:47,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:31:47,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:31:47,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:31:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:31:47,713 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:31:47,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:31:47,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:31:47,713 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:31:47,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:31:47,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:31:47,714 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 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:31:47,725 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:31:47,725 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:31:47,731 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-15 11:31:47,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:31:47,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:31:47,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:31:47,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:31:47,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:47,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:47,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:31:47,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:47,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:47,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:47,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:31:47,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:47,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:47,926 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:47,927 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:47,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:31:47,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:47,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:47,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:47,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:47,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:47,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:31:47,936 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:47,975 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:47,997 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:48,014 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:48,028 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:48,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:48,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 68 treesize of output 71 [2019-02-15 11:31:48,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:31:48,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:31:48,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:31:48,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-15 11:31:48,280 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:48,305 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:48,329 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:48,354 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:48,379 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:48,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:31:48,423 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-15 11:31:48,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 11:31:48,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:48,499 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-02-15 11:31:48,499 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-15 11:31:48,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-02-15 11:31:48,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:48,651 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-02-15 11:31:48,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-02-15 11:31:48,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,691 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:31:48,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 129 [2019-02-15 11:31:48,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:48,743 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-02-15 11:31:48,743 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:49 [2019-02-15 11:31:48,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,783 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:31:48,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-02-15 11:31:48,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:48,832 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-02-15 11:31:48,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:43 [2019-02-15 11:31:48,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:48,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 125 [2019-02-15 11:31:48,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:48,930 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-02-15 11:31:48,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:57, output treesize:41 [2019-02-15 11:31:48,955 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:31:48,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:31:49,027 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:31:49,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:31:49,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-02-15 11:31:49,046 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:31:49,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 11:31:49,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 11:31:49,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:31:49,046 INFO L87 Difference]: Start difference. First operand 11270 states and 80138 transitions. Second operand 13 states. [2019-02-15 11:32:02,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:32:02,982 INFO L93 Difference]: Finished difference Result 14692 states and 103813 transitions. [2019-02-15 11:32:02,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-15 11:32:02,982 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-02-15 11:32:02,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:32:03,036 INFO L225 Difference]: With dead ends: 14692 [2019-02-15 11:32:03,036 INFO L226 Difference]: Without dead ends: 14688 [2019-02-15 11:32:03,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-02-15 11:32:03,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14688 states. [2019-02-15 11:32:16,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14688 to 12758. [2019-02-15 11:32:16,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12758 states. [2019-02-15 11:32:16,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12758 states to 12758 states and 90546 transitions. [2019-02-15 11:32:16,070 INFO L78 Accepts]: Start accepts. Automaton has 12758 states and 90546 transitions. Word has length 7 [2019-02-15 11:32:16,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:32:16,070 INFO L480 AbstractCegarLoop]: Abstraction has 12758 states and 90546 transitions. [2019-02-15 11:32:16,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 11:32:16,070 INFO L276 IsEmpty]: Start isEmpty. Operand 12758 states and 90546 transitions. [2019-02-15 11:32:16,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:32:16,080 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:32:16,081 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:32:16,081 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:32:16,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:32:16,081 INFO L82 PathProgramCache]: Analyzing trace with hash -2023160096, now seen corresponding path program 1 times [2019-02-15 11:32:16,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:32:16,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:32:16,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:32:16,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:32:16,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:32:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:32:16,159 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:32:16,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:32:16,159 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:32:16,159 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:32:16,159 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [28], [30], [31] [2019-02-15 11:32:16,162 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:32:16,162 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:32:16,458 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:32:16,458 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:32:16,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:32:16,458 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:32:16,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:32:16,458 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 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:32:16,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:32:16,467 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:32:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:32:16,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:32:16,497 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:32:16,500 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:32:16,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:32:16,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:32:16,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:32:16,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-15 11:32:16,533 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:32:16,570 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:16,589 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:16,605 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:16,618 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:16,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:16,658 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-02-15 11:32:16,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-02-15 11:32:16,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,716 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 11:32:16,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 11:32:16,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:32:16,835 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:32:16,858 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:16,881 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:16,904 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:16,929 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:16,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:32:16,970 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-02-15 11:32:16,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:16,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-02-15 11:32:16,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:32:17,035 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-02-15 11:32:17,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-02-15 11:32:17,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:17,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:17,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:17,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:17,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:17,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:17,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:17,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:17,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 109 [2019-02-15 11:32:17,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:32:17,113 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-02-15 11:32:17,114 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-02-15 11:32:17,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:17,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:17,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:17,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:17,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:17,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:17,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:17,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:17,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:17,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:17,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:17,149 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:32:17,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:17,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-02-15 11:32:17,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:32:17,196 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-02-15 11:32:17,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:43 [2019-02-15 11:32:17,217 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:32:17,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:32:17,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:32:17,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:32:17,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:32:17,331 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:32:17,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:32:17,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:32:17,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:32:17,331 INFO L87 Difference]: Start difference. First operand 12758 states and 90546 transitions. Second operand 10 states. [2019-02-15 11:32:29,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:32:29,441 INFO L93 Difference]: Finished difference Result 13016 states and 92075 transitions. [2019-02-15 11:32:29,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:32:29,441 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 11:32:29,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:32:29,486 INFO L225 Difference]: With dead ends: 13016 [2019-02-15 11:32:29,486 INFO L226 Difference]: Without dead ends: 13015 [2019-02-15 11:32:29,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:32:29,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13015 states. [2019-02-15 11:32:42,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13015 to 12958. [2019-02-15 11:32:42,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12958 states. [2019-02-15 11:32:42,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12958 states to 12958 states and 91946 transitions. [2019-02-15 11:32:42,425 INFO L78 Accepts]: Start accepts. Automaton has 12958 states and 91946 transitions. Word has length 7 [2019-02-15 11:32:42,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:32:42,425 INFO L480 AbstractCegarLoop]: Abstraction has 12958 states and 91946 transitions. [2019-02-15 11:32:42,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:32:42,425 INFO L276 IsEmpty]: Start isEmpty. Operand 12958 states and 91946 transitions. [2019-02-15 11:32:42,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:32:42,437 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:32:42,437 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-15 11:32:42,438 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:32:42,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:32:42,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1920990370, now seen corresponding path program 1 times [2019-02-15 11:32:42,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:32:42,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:32:42,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:32:42,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:32:42,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:32:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:32:42,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:32:42,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:32:42,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:32:42,497 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:32:42,497 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [30], [32], [33] [2019-02-15 11:32:42,498 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:32:42,498 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:32:42,643 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:32:42,644 INFO L272 AbstractInterpreter]: Visited 6 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:32:42,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:32:42,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:32:42,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:32:42,644 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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:32:42,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:32:42,829 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:32:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:32:42,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:32:42,838 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:32:42,841 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:32:42,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:42,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:42,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:32:42,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:42,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:42,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:42,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:32:42,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:42,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:42,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:42,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:42,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:32:42,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-15 11:32:42,874 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:32:42,900 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:42,920 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:42,935 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:42,947 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:42,960 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:42,982 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:32:42,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:42,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:42,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:32:43,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:43,030 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:43,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:43,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:43,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:32:43,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:43,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:43,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:43,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:43,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:43,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:43,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:32:43,078 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:32:43,092 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:43,106 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:43,121 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:43,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:32:43,150 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-02-15 11:32:43,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:43,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:32:43,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:32:43,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:32:43,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:88 [2019-02-15 11:32:45,362 WARN L181 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 51 DAG size of output: 24 [2019-02-15 11:32:45,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:45,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:45,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:45,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:45,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:45,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:45,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:32:45,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:32:45,392 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-02-15 11:32:45,392 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:33 [2019-02-15 11:32:45,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:32:45,407 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:32:45,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:32:45,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:32:45,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-15 11:32:45,441 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:32:45,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-15 11:32:45,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-15 11:32:45,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:32:45,442 INFO L87 Difference]: Start difference. First operand 12958 states and 91946 transitions. Second operand 7 states. [2019-02-15 11:32:57,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:32:57,227 INFO L93 Difference]: Finished difference Result 12974 states and 91967 transitions. [2019-02-15 11:32:57,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:32:57,228 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-02-15 11:32:57,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:32:57,273 INFO L225 Difference]: With dead ends: 12974 [2019-02-15 11:32:57,274 INFO L226 Difference]: Without dead ends: 12973 [2019-02-15 11:32:57,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:32:57,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12973 states. [2019-02-15 11:33:10,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12973 to 12958. [2019-02-15 11:33:10,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12958 states. [2019-02-15 11:33:10,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12958 states to 12958 states and 91946 transitions. [2019-02-15 11:33:10,389 INFO L78 Accepts]: Start accepts. Automaton has 12958 states and 91946 transitions. Word has length 7 [2019-02-15 11:33:10,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:33:10,389 INFO L480 AbstractCegarLoop]: Abstraction has 12958 states and 91946 transitions. [2019-02-15 11:33:10,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-15 11:33:10,389 INFO L276 IsEmpty]: Start isEmpty. Operand 12958 states and 91946 transitions. [2019-02-15 11:33:10,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:33:10,400 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:33:10,400 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:33:10,400 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:33:10,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:33:10,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1935645556, now seen corresponding path program 1 times [2019-02-15 11:33:10,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:33:10,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:33:10,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:33:10,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:33:10,401 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:33:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:33:10,591 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-15 11:33:10,685 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:33:10,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:33:10,686 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:33:10,686 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:33:10,686 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [24], [28], [30], [31] [2019-02-15 11:33:10,687 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:33:10,687 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:33:10,976 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:33:10,976 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:33:10,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:33:10,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:33:10,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:33:10,977 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 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:33:10,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:33:10,984 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:33:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:33:10,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:33:10,992 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:33:10,996 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:33:11,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:33:11,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:33:11,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:33:11,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,026 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,028 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-15 11:33:11,029 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:33:11,064 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:11,083 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:11,099 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:11,111 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:11,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:11,150 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-02-15 11:33:11,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-02-15 11:33:11,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 11:33:11,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 11:33:11,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:33:11,328 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:33:11,351 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:11,372 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:11,395 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:11,420 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:11,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:33:11,461 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-02-15 11:33:11,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 11:33:11,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:33:11,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:33:11,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:138 [2019-02-15 11:33:11,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,705 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:33:11,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:33:11,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:33:11,742 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-02-15 11:33:11,742 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:42 [2019-02-15 11:33:11,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:11,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-15 11:33:11,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:33:11,806 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-02-15 11:33:11,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:34 [2019-02-15 11:33:11,828 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:33:11,828 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:33:11,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:33:11,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:33:11,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:33:11,880 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:33:11,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:33:11,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:33:11,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:33:11,881 INFO L87 Difference]: Start difference. First operand 12958 states and 91946 transitions. Second operand 10 states. [2019-02-15 11:33:24,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:33:24,264 INFO L93 Difference]: Finished difference Result 13106 states and 92752 transitions. [2019-02-15 11:33:24,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:33:24,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 11:33:24,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:33:24,309 INFO L225 Difference]: With dead ends: 13106 [2019-02-15 11:33:24,309 INFO L226 Difference]: Without dead ends: 13105 [2019-02-15 11:33:24,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:33:24,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13105 states. [2019-02-15 11:33:37,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13105 to 13023. [2019-02-15 11:33:37,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13023 states. [2019-02-15 11:33:37,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13023 states to 13023 states and 92401 transitions. [2019-02-15 11:33:37,341 INFO L78 Accepts]: Start accepts. Automaton has 13023 states and 92401 transitions. Word has length 7 [2019-02-15 11:33:37,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:33:37,341 INFO L480 AbstractCegarLoop]: Abstraction has 13023 states and 92401 transitions. [2019-02-15 11:33:37,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:33:37,341 INFO L276 IsEmpty]: Start isEmpty. Operand 13023 states and 92401 transitions. [2019-02-15 11:33:37,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:33:37,352 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:33:37,352 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:33:37,352 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:33:37,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:33:37,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1935632038, now seen corresponding path program 1 times [2019-02-15 11:33:37,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:33:37,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:33:37,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:33:37,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:33:37,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:33:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:33:37,428 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:33:37,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:33:37,428 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:33:37,428 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:33:37,428 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [22], [24], [28], [29] [2019-02-15 11:33:37,429 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:33:37,429 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:33:37,956 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:33:37,956 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 11:33:37,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:33:37,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:33:37,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:33:37,957 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 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:33:37,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:33:37,965 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:33:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:33:37,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:33:37,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:33:37,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:33:37,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:37,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:37,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:33:38,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:33:38,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:33:38,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:33:38,023 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:33:38,062 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:38,084 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:38,102 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:38,116 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:38,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:38,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 68 treesize of output 71 [2019-02-15 11:33:38,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:33:38,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:33:38,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:33:38,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-15 11:33:38,368 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:33:38,392 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:38,417 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:38,442 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:38,465 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:38,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:33:38,509 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-02-15 11:33:38,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 11:33:38,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:33:38,596 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-02-15 11:33:38,596 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-15 11:33:38,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,641 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:33:38,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 105 [2019-02-15 11:33:38,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:33:38,687 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-02-15 11:33:38,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:59 [2019-02-15 11:33:38,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-02-15 11:33:38,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:33:38,778 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-02-15 11:33:38,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:69, output treesize:47 [2019-02-15 11:33:38,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,813 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:38,823 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:33:38,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-02-15 11:33:38,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:33:38,874 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-02-15 11:33:38,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:49 [2019-02-15 11:33:38,907 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:33:38,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:33:38,970 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:33:38,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:33:38,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 11:33:38,989 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:33:38,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:33:38,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:33:38,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:33:38,989 INFO L87 Difference]: Start difference. First operand 13023 states and 92401 transitions. Second operand 12 states. [2019-02-15 11:33:51,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:33:51,679 INFO L93 Difference]: Finished difference Result 13278 states and 93926 transitions. [2019-02-15 11:33:51,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:33:51,679 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-15 11:33:51,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:33:51,726 INFO L225 Difference]: With dead ends: 13278 [2019-02-15 11:33:51,726 INFO L226 Difference]: Without dead ends: 13277 [2019-02-15 11:33:51,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-02-15 11:33:51,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13277 states. [2019-02-15 11:34:05,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13277 to 13233. [2019-02-15 11:34:05,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13233 states. [2019-02-15 11:34:05,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13233 states to 13233 states and 93871 transitions. [2019-02-15 11:34:05,062 INFO L78 Accepts]: Start accepts. Automaton has 13233 states and 93871 transitions. Word has length 7 [2019-02-15 11:34:05,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:34:05,063 INFO L480 AbstractCegarLoop]: Abstraction has 13233 states and 93871 transitions. [2019-02-15 11:34:05,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:34:05,063 INFO L276 IsEmpty]: Start isEmpty. Operand 13233 states and 93871 transitions. [2019-02-15 11:34:05,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:34:05,073 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:34:05,074 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:34:05,074 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:34:05,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:34:05,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1935214964, now seen corresponding path program 1 times [2019-02-15 11:34:05,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:34:05,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:34:05,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:34:05,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:34:05,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:34:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:34:05,220 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:34:05,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:34:05,220 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:34:05,221 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:34:05,221 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [22], [28], [29] [2019-02-15 11:34:05,221 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:34:05,221 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:34:05,573 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:34:05,573 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 11:34:05,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:34:05,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:34:05,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:34:05,574 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 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:34:05,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:34:05,582 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:34:05,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:34:05,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:34:05,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:34:05,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:34:05,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:34:05,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:34:05,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:34:05,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-15 11:34:05,647 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:05,674 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:05,695 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:05,713 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:05,726 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:05,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:05,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 48 treesize of output 54 [2019-02-15 11:34:05,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:34:05,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:34:05,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:34:05,885 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:05,901 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:05,914 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:05,930 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:05,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:34:05,961 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-15 11:34:06,030 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:06,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:34:06,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:06,058 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-02-15 11:34:06,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-15 11:34:06,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:06,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:06,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:06,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:06,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:06,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:06,090 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:34:06,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 11:34:06,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:06,121 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-02-15 11:34:06,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-02-15 11:34:06,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:06,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:06,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:06,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:06,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:06,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:06,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:06,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:06,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:06,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 11:34:06,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:06,185 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-02-15 11:34:06,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-02-15 11:34:06,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:06,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:06,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:06,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:06,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:06,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:06,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:06,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:06,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:06,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:06,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:06,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:06,220 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:34:06,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 11:34:06,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:06,253 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-02-15 11:34:06,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-02-15 11:34:06,311 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:34:06,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:34:06,367 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:34:06,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:34:06,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-02-15 11:34:06,386 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:34:06,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 11:34:06,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 11:34:06,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:34:06,387 INFO L87 Difference]: Start difference. First operand 13233 states and 93871 transitions. Second operand 13 states. [2019-02-15 11:34:06,690 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-02-15 11:34:22,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:34:22,129 INFO L93 Difference]: Finished difference Result 17581 states and 124519 transitions. [2019-02-15 11:34:22,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:34:22,130 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-02-15 11:34:22,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:34:22,194 INFO L225 Difference]: With dead ends: 17581 [2019-02-15 11:34:22,194 INFO L226 Difference]: Without dead ends: 17580 [2019-02-15 11:34:22,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2019-02-15 11:34:22,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17580 states. [2019-02-15 11:34:32,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17580 to 9927. [2019-02-15 11:34:32,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9927 states. [2019-02-15 11:34:32,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9927 states to 9927 states and 70376 transitions. [2019-02-15 11:34:32,674 INFO L78 Accepts]: Start accepts. Automaton has 9927 states and 70376 transitions. Word has length 7 [2019-02-15 11:34:32,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:34:32,674 INFO L480 AbstractCegarLoop]: Abstraction has 9927 states and 70376 transitions. [2019-02-15 11:34:32,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 11:34:32,674 INFO L276 IsEmpty]: Start isEmpty. Operand 9927 states and 70376 transitions. [2019-02-15 11:34:32,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:34:32,682 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:34:32,682 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:34:32,682 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:34:32,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:34:32,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1935766706, now seen corresponding path program 1 times [2019-02-15 11:34:32,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:34:32,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:34:32,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:34:32,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:34:32,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:34:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:34:32,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:34:32,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:34:32,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:34:32,739 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:34:32,739 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [28], [30], [32], [33] [2019-02-15 11:34:32,739 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:34:32,740 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:34:32,947 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:34:32,947 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:34:32,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:34:32,947 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:34:32,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:34:32,947 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 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:34:32,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:34:32,955 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:34:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:34:32,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:34:32,964 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:34:32,971 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:34:32,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:32,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:32,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:34:32,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:32,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:32,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:32,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:34:32,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:32,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:32,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:33,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:33,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:34:33,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:33,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:33,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:33,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:33,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:33,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-15 11:34:33,011 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:33,049 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:33,067 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:33,083 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:33,096 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:33,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:33,136 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-02-15 11:34:33,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:33,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:33,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-02-15 11:34:33,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:33,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:33,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:33,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:33,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 11:34:33,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:33,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:33,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:33,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:33,240 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:33,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:33,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 11:34:33,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:33,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:33,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:33,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:33,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:33,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:33,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:33,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:33,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:34:33,310 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:33,332 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:33,355 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:33,378 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:33,403 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:33,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:34:33,445 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-02-15 11:34:33,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:33,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 11:34:33,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:34:33,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:34:33,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:138 [2019-02-15 11:34:33,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:33,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:33,679 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:34:33,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 11:34:33,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:33,708 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-02-15 11:34:33,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:42 [2019-02-15 11:34:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:34:33,728 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:34:33,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:34:33,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:34:33,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:34:33,768 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:34:33,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:34:33,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:34:33,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:34:33,768 INFO L87 Difference]: Start difference. First operand 9927 states and 70376 transitions. Second operand 8 states. [2019-02-15 11:34:43,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:34:43,317 INFO L93 Difference]: Finished difference Result 9947 states and 70395 transitions. [2019-02-15 11:34:43,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:34:43,318 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-15 11:34:43,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:34:43,352 INFO L225 Difference]: With dead ends: 9947 [2019-02-15 11:34:43,352 INFO L226 Difference]: Without dead ends: 9946 [2019-02-15 11:34:43,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:34:43,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9946 states. [2019-02-15 11:34:53,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9946 to 9927. [2019-02-15 11:34:53,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9927 states. [2019-02-15 11:34:53,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9927 states to 9927 states and 70376 transitions. [2019-02-15 11:34:53,656 INFO L78 Accepts]: Start accepts. Automaton has 9927 states and 70376 transitions. Word has length 7 [2019-02-15 11:34:53,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:34:53,656 INFO L480 AbstractCegarLoop]: Abstraction has 9927 states and 70376 transitions. [2019-02-15 11:34:53,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:34:53,657 INFO L276 IsEmpty]: Start isEmpty. Operand 9927 states and 70376 transitions. [2019-02-15 11:34:53,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:34:53,665 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:34:53,665 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-15 11:34:53,665 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:34:53,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:34:53,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1937303618, now seen corresponding path program 3 times [2019-02-15 11:34:53,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:34:53,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:34:53,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:34:53,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:34:53,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:34:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:34:53,730 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:34:53,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:34:53,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:34:53,731 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:34:53,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:34:53,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:34:53,731 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 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:34:53,885 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:34:53,885 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:34:53,891 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:34:53,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:34:53,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:34:53,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:34:53,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:34:53,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:53,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:53,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:34:53,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:53,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:53,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:53,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:34:53,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:53,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:53,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:53,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:53,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:34:53,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-15 11:34:53,944 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:53,972 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:53,994 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:54,011 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:54,024 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:54,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:54,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:54,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 48 treesize of output 54 [2019-02-15 11:34:54,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:54,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:54,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:34:54,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:54,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:54,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:54,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:54,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:34:54,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:54,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:54,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:54,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:54,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:54,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:54,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:34:54,180 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:54,196 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:54,211 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:54,226 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:54,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:34:54,258 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-15 11:34:54,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:54,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-02-15 11:34:54,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:34:54,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-02-15 11:34:54,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:109 [2019-02-15 11:34:54,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:54,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:54,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:54,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:54,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:54,598 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:34:54,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 72 [2019-02-15 11:34:54,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:54,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:54,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:54,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:54,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:54,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:54,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:54,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:54,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:54,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 65 treesize of output 107 [2019-02-15 11:34:54,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2019-02-15 11:34:55,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 13 dim-0 vars, and 6 xjuncts. [2019-02-15 11:34:55,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:126, output treesize:280 [2019-02-15 11:34:55,167 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 92 [2019-02-15 11:34:55,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,182 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:34:55,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 93 [2019-02-15 11:34:55,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:55,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-02-15 11:34:55,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:55,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,456 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:34:55,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 113 [2019-02-15 11:34:55,457 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:55,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 66 [2019-02-15 11:34:55,583 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:55,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-02-15 11:34:55,664 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:227, output treesize:161 [2019-02-15 11:34:55,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 78 [2019-02-15 11:34:55,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:55,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-02-15 11:34:55,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:55,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:55,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 108 [2019-02-15 11:34:55,999 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:56,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,115 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 100 [2019-02-15 11:34:56,124 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:56,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-02-15 11:34:56,219 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:209, output treesize:153 [2019-02-15 11:34:56,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,320 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:34:56,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 123 [2019-02-15 11:34:56,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:56,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 118 [2019-02-15 11:34:56,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:56,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,579 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,586 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:34:56,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 125 [2019-02-15 11:34:56,588 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:56,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:56,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-02-15 11:34:56,708 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:56,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2019-02-15 11:34:56,786 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 20 variables, input treesize:201, output treesize:141 [2019-02-15 11:34:56,885 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:34:56,885 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:34:57,031 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:34:57,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:34:57,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-02-15 11:34:57,050 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:34:57,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 11:34:57,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 11:34:57,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2019-02-15 11:34:57,051 INFO L87 Difference]: Start difference. First operand 9927 states and 70376 transitions. Second operand 13 states. [2019-02-15 11:34:57,248 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-02-15 11:34:57,511 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 36 [2019-02-15 11:34:57,797 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 72 [2019-02-15 11:34:58,964 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2019-02-15 11:35:00,406 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 88 [2019-02-15 11:35:12,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:35:12,039 INFO L93 Difference]: Finished difference Result 12394 states and 87417 transitions. [2019-02-15 11:35:12,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-15 11:35:12,040 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-02-15 11:35:12,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:35:12,081 INFO L225 Difference]: With dead ends: 12394 [2019-02-15 11:35:12,081 INFO L226 Difference]: Without dead ends: 12392 [2019-02-15 11:35:12,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2019-02-15 11:35:12,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12392 states. [2019-02-15 11:35:20,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12392 to 7195. [2019-02-15 11:35:20,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7195 states. [2019-02-15 11:35:20,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7195 states to 7195 states and 51194 transitions. [2019-02-15 11:35:20,772 INFO L78 Accepts]: Start accepts. Automaton has 7195 states and 51194 transitions. Word has length 7 [2019-02-15 11:35:20,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:35:20,772 INFO L480 AbstractCegarLoop]: Abstraction has 7195 states and 51194 transitions. [2019-02-15 11:35:20,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 11:35:20,773 INFO L276 IsEmpty]: Start isEmpty. Operand 7195 states and 51194 transitions. [2019-02-15 11:35:20,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:35:20,779 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:35:20,779 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:35:20,779 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:35:20,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:35:20,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1937075524, now seen corresponding path program 1 times [2019-02-15 11:35:20,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:35:20,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:35:20,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:35:20,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:35:20,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:35:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:35:20,847 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:35:20,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:35:20,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:35:20,848 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:35:20,848 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [28], [30], [31] [2019-02-15 11:35:20,849 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:35:20,849 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:35:21,136 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:35:21,137 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:35:21,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:35:21,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:35:21,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:35:21,137 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 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:35:21,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:35:21,147 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:35:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:35:21,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:35:21,156 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:35:21,160 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:35:21,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:35:21,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:35:21,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,182 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:35:21,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-15 11:35:21,193 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:35:21,230 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:35:21,250 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:35:21,266 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:35:21,278 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:35:21,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:35:21,318 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-02-15 11:35:21,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-02-15 11:35:21,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 11:35:21,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 11:35:21,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:35:21,496 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:35:21,517 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:35:21,540 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:35:21,563 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:35:21,588 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:35:21,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:35:21,629 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-02-15 11:35:21,786 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-02-15 11:35:21,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:21,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 11:35:21,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:35:21,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:35:21,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:138 [2019-02-15 11:35:22,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 90 [2019-02-15 11:35:22,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:35:22,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 127 [2019-02-15 11:35:22,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:35:22,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:35:22,212 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:150, output treesize:94 [2019-02-15 11:35:22,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,266 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:35:22,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 88 [2019-02-15 11:35:22,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:35:22,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,353 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:35:22,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:22,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 138 [2019-02-15 11:35:22,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:35:22,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-02-15 11:35:22,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:118, output treesize:100 [2019-02-15 11:35:22,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:35:22,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:35:22,548 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:35:22,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:35:22,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:35:22,566 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:35:22,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:35:22,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:35:22,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:35:22,567 INFO L87 Difference]: Start difference. First operand 7195 states and 51194 transitions. Second operand 10 states. [2019-02-15 11:35:22,735 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-02-15 11:35:24,262 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-02-15 11:35:31,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:35:31,871 INFO L93 Difference]: Finished difference Result 7367 states and 52064 transitions. [2019-02-15 11:35:31,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:35:31,871 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 11:35:31,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:35:31,894 INFO L225 Difference]: With dead ends: 7367 [2019-02-15 11:35:31,894 INFO L226 Difference]: Without dead ends: 7366 [2019-02-15 11:35:31,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:35:31,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7366 states. [2019-02-15 11:35:40,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7366 to 7259. [2019-02-15 11:35:40,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7259 states. [2019-02-15 11:35:40,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7259 states to 7259 states and 51642 transitions. [2019-02-15 11:35:40,964 INFO L78 Accepts]: Start accepts. Automaton has 7259 states and 51642 transitions. Word has length 7 [2019-02-15 11:35:40,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:35:40,964 INFO L480 AbstractCegarLoop]: Abstraction has 7259 states and 51642 transitions. [2019-02-15 11:35:40,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:35:40,965 INFO L276 IsEmpty]: Start isEmpty. Operand 7259 states and 51642 transitions. [2019-02-15 11:35:40,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:35:40,970 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:35:40,971 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:35:40,971 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:35:40,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:35:40,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1924490204, now seen corresponding path program 2 times [2019-02-15 11:35:40,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:35:40,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:35:40,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:35:40,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:35:40,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:35:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:35:41,111 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:35:41,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:35:41,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:35:41,112 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:35:41,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:35:41,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:35:41,112 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 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:35:41,120 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:35:41,120 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:35:41,126 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:35:41,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:35:41,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:35:41,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:35:41,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:35:41,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:35:41,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:35:41,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:35:41,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:35:41,182 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:35:41,221 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:35:41,242 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:35:41,259 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:35:41,274 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:35:41,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:35:41,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 68 treesize of output 71 [2019-02-15 11:35:41,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:35:41,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:35:41,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:35:41,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-15 11:35:41,526 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:35:41,551 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:35:41,575 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:35:41,600 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:35:41,625 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:35:41,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:35:41,670 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-15 11:35:41,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 11:35:41,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:35:41,749 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-02-15 11:35:41,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 11:35:41,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-02-15 11:35:41,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:35:41,836 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-02-15 11:35:41,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-02-15 11:35:41,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,877 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:35:41,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-02-15 11:35:41,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:35:41,924 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-02-15 11:35:41,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-02-15 11:35:41,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:41,965 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:35:41,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-02-15 11:35:41,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:35:42,012 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-02-15 11:35:42,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:49 [2019-02-15 11:35:42,064 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:35:42,064 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:35:42,108 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:35:42,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:35:42,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-15 11:35:42,128 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:35:42,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:35:42,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:35:42,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:35:42,128 INFO L87 Difference]: Start difference. First operand 7259 states and 51642 transitions. Second operand 11 states. [2019-02-15 11:35:57,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:35:57,440 INFO L93 Difference]: Finished difference Result 9936 states and 70364 transitions. [2019-02-15 11:35:57,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:35:57,441 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-15 11:35:57,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:35:57,474 INFO L225 Difference]: With dead ends: 9936 [2019-02-15 11:35:57,475 INFO L226 Difference]: Without dead ends: 9935 [2019-02-15 11:35:57,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2019-02-15 11:35:57,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9935 states. [2019-02-15 11:36:11,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9935 to 8951. [2019-02-15 11:36:11,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8951 states. [2019-02-15 11:36:11,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8951 states to 8951 states and 63743 transitions. [2019-02-15 11:36:11,149 INFO L78 Accepts]: Start accepts. Automaton has 8951 states and 63743 transitions. Word has length 7 [2019-02-15 11:36:11,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:36:11,149 INFO L480 AbstractCegarLoop]: Abstraction has 8951 states and 63743 transitions. [2019-02-15 11:36:11,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:36:11,150 INFO L276 IsEmpty]: Start isEmpty. Operand 8951 states and 63743 transitions. [2019-02-15 11:36:11,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:36:11,157 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:36:11,157 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:36:11,157 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:36:11,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:36:11,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1928257388, now seen corresponding path program 1 times [2019-02-15 11:36:11,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:36:11,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:36:11,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:36:11,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:36:11,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:36:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:36:11,249 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:36:11,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:36:11,249 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:36:11,250 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:36:11,250 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [28], [30], [31] [2019-02-15 11:36:11,251 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:36:11,251 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:36:11,539 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:36:11,540 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:36:11,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:36:11,540 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:36:11,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:36:11,540 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 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:36:11,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:36:11,550 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:36:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:36:11,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:36:11,559 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-02-15 11:36:11,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:11,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:11,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-02-15 11:36:11,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:11,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:11,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:11,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:11,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 11:36:11,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:11,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:11,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:11,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:11,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:11,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:11,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 11:36:11,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:11,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:11,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:11,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:11,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:11,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:11,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:11,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:11,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:36:11,734 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:36:11,761 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:11,784 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:11,809 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:11,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:11,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:36:11,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:36:11,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:36:11,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:36:11,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:36:11,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-15 11:36:11,883 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:36:11,916 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:11,934 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:11,948 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:11,957 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:11,968 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:12,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:36:12,009 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-02-15 11:36:12,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:12,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 11:36:12,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:36:12,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:36:12,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:138 [2019-02-15 11:36:12,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:12,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:12,236 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:36:12,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 11:36:12,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:36:12,265 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-02-15 11:36:12,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:42 [2019-02-15 11:36:12,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:12,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:12,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:12,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:12,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:12,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:12,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:12,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:12,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:12,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 11:36:12,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:36:12,325 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-02-15 11:36:12,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:34 [2019-02-15 11:36:12,347 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:36:12,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:36:12,374 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:36:12,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:36:12,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:36:12,392 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:36:12,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:36:12,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:36:12,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:36:12,392 INFO L87 Difference]: Start difference. First operand 8951 states and 63743 transitions. Second operand 10 states. [2019-02-15 11:36:26,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:36:26,291 INFO L93 Difference]: Finished difference Result 9235 states and 65371 transitions. [2019-02-15 11:36:26,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:36:26,291 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 11:36:26,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:36:26,320 INFO L225 Difference]: With dead ends: 9235 [2019-02-15 11:36:26,321 INFO L226 Difference]: Without dead ends: 9232 [2019-02-15 11:36:26,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:36:26,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9232 states. [2019-02-15 11:36:40,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9232 to 9044. [2019-02-15 11:36:40,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9044 states. [2019-02-15 11:36:40,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9044 states to 9044 states and 64394 transitions. [2019-02-15 11:36:40,662 INFO L78 Accepts]: Start accepts. Automaton has 9044 states and 64394 transitions. Word has length 7 [2019-02-15 11:36:40,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:36:40,662 INFO L480 AbstractCegarLoop]: Abstraction has 9044 states and 64394 transitions. [2019-02-15 11:36:40,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:36:40,662 INFO L276 IsEmpty]: Start isEmpty. Operand 9044 states and 64394 transitions. [2019-02-15 11:36:40,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:36:40,670 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:36:40,670 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:36:40,670 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:36:40,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:36:40,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1928378538, now seen corresponding path program 1 times [2019-02-15 11:36:40,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:36:40,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:36:40,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:36:40,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:36:40,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:36:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:36:40,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:36:40,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:36:40,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:36:40,740 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:36:40,740 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [28], [30], [32], [33] [2019-02-15 11:36:40,742 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:36:40,742 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:36:40,949 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:36:40,949 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:36:40,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:36:40,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:36:40,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:36:40,950 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 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:36:40,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:36:40,957 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:36:40,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:36:40,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:36:40,985 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:36:40,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:40,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:41,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:36:41,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:41,030 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:41,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:41,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:41,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:36:41,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:41,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:41,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:41,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:41,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:41,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:41,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:36:41,076 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:36:41,091 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:41,106 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:41,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:41,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:36:41,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:36:41,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:36:41,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:36:41,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:36:41,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-15 11:36:41,165 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:36:41,189 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:41,205 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:41,219 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:41,230 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:41,241 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:41,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:36:41,270 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-15 11:36:41,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:41,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:36:41,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:36:41,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:36:41,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:88 [2019-02-15 11:36:41,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:41,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:41,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:41,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:41,446 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:36:41,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-15 11:36:41,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:36:41,467 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-02-15 11:36:41,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:29 [2019-02-15 11:36:41,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:36:41,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:36:41,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:36:41,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:36:41,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:36:41,525 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:36:41,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:36:41,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:36:41,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:36:41,526 INFO L87 Difference]: Start difference. First operand 9044 states and 64394 transitions. Second operand 8 states. [2019-02-15 11:36:54,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:36:54,635 INFO L93 Difference]: Finished difference Result 9065 states and 64420 transitions. [2019-02-15 11:36:54,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:36:54,635 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-15 11:36:54,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:36:54,666 INFO L225 Difference]: With dead ends: 9065 [2019-02-15 11:36:54,666 INFO L226 Difference]: Without dead ends: 9064 [2019-02-15 11:36:54,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:36:54,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9064 states. [2019-02-15 11:37:08,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9064 to 9045. [2019-02-15 11:37:08,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9045 states. [2019-02-15 11:37:08,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9045 states to 9045 states and 64401 transitions. [2019-02-15 11:37:08,959 INFO L78 Accepts]: Start accepts. Automaton has 9045 states and 64401 transitions. Word has length 7 [2019-02-15 11:37:08,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:37:08,960 INFO L480 AbstractCegarLoop]: Abstraction has 9045 states and 64401 transitions. [2019-02-15 11:37:08,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:37:08,960 INFO L276 IsEmpty]: Start isEmpty. Operand 9045 states and 64401 transitions. [2019-02-15 11:37:08,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:37:08,969 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:37:08,970 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:37:08,970 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:37:08,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:37:08,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1904967206, now seen corresponding path program 1 times [2019-02-15 11:37:08,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:37:08,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:37:08,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:37:08,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:37:08,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:37:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:37:09,052 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:37:09,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:37:09,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:37:09,053 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:37:09,053 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [24], [27] [2019-02-15 11:37:09,054 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:37:09,054 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:37:09,472 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:37:09,473 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 1 different actions 1 times. Never widened. Found 10 fixpoints after 6 different actions. Largest state had 0 variables. [2019-02-15 11:37:09,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:37:09,473 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:37:09,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:37:09,473 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 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:37:09,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:37:09,482 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:37:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:37:09,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:37:09,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:09,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 68 treesize of output 71 [2019-02-15 11:37:09,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:09,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:09,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:37:09,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:09,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:09,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:09,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:09,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:37:09,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:09,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:09,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:09,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:09,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:09,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:09,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:37:09,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:09,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:09,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:09,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:09,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:09,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:09,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:09,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:09,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-15 11:37:09,732 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:37:09,762 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:37:09,793 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:37:09,824 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:37:09,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:37:09,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:37:09,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:37:09,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:37:09,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:37:09,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:37:09,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:37:09,914 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:37:09,948 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:37:09,968 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:37:09,983 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:37:09,996 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:37:10,007 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:37:10,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:37:10,050 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 2 variables, input treesize:92, output treesize:91 [2019-02-15 11:37:10,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 11:37:10,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:37:10,145 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-02-15 11:37:10,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:101, output treesize:71 [2019-02-15 11:37:10,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-02-15 11:37:10,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:37:10,278 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-02-15 11:37:10,278 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:55 [2019-02-15 11:37:10,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,325 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:37:10,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-02-15 11:37:10,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:37:10,375 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-02-15 11:37:10,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:47 [2019-02-15 11:37:10,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,419 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:37:10,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 124 [2019-02-15 11:37:10,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:37:10,470 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-02-15 11:37:10,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:61, output treesize:49 [2019-02-15 11:37:10,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:10,578 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:37:10,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 127 [2019-02-15 11:37:10,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:37:10,626 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-02-15 11:37:10,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:53 [2019-02-15 11:37:10,657 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:37:10,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:37:10,752 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:37:10,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:37:10,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-02-15 11:37:10,772 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:37:10,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-15 11:37:10,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-15 11:37:10,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-02-15 11:37:10,772 INFO L87 Difference]: Start difference. First operand 9045 states and 64401 transitions. Second operand 14 states. [2019-02-15 11:37:28,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:37:28,019 INFO L93 Difference]: Finished difference Result 9411 states and 66754 transitions. [2019-02-15 11:37:28,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:37:28,019 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-02-15 11:37:28,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:37:28,051 INFO L225 Difference]: With dead ends: 9411 [2019-02-15 11:37:28,051 INFO L226 Difference]: Without dead ends: 9409 [2019-02-15 11:37:28,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=202, Invalid=398, Unknown=0, NotChecked=0, Total=600 [2019-02-15 11:37:28,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9409 states. [2019-02-15 11:37:42,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9409 to 8693. [2019-02-15 11:37:42,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8693 states. [2019-02-15 11:37:42,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8693 states to 8693 states and 61400 transitions. [2019-02-15 11:37:42,134 INFO L78 Accepts]: Start accepts. Automaton has 8693 states and 61400 transitions. Word has length 7 [2019-02-15 11:37:42,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:37:42,134 INFO L480 AbstractCegarLoop]: Abstraction has 8693 states and 61400 transitions. [2019-02-15 11:37:42,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-15 11:37:42,135 INFO L276 IsEmpty]: Start isEmpty. Operand 8693 states and 61400 transitions. [2019-02-15 11:37:42,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:37:42,143 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:37:42,143 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:37:42,143 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:37:42,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:37:42,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1916458534, now seen corresponding path program 1 times [2019-02-15 11:37:42,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:37:42,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:37:42,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:37:42,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:37:42,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:37:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:37:42,282 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:37:42,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:37:42,283 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:37:42,283 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:37:42,283 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [22], [24], [27] [2019-02-15 11:37:42,284 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:37:42,284 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:37:42,705 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:37:42,705 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 1 different actions 1 times. Never widened. Found 10 fixpoints after 6 different actions. Largest state had 0 variables. [2019-02-15 11:37:42,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:37:42,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:37:42,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:37:42,706 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 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:37:42,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:37:42,714 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:37:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:37:42,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:37:42,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:42,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 68 treesize of output 71 [2019-02-15 11:37:42,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:42,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:42,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:37:42,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:42,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:42,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:42,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:42,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:37:42,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:42,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:42,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:42,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:42,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:42,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:42,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:37:42,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:42,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:42,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:42,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:42,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:42,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:42,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:42,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:42,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-15 11:37:42,951 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:37:42,977 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:37:43,002 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:37:43,028 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:37:43,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:37:43,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:37:43,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 11:37:43,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:37:43,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:37:43,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:37:43,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:37:43,103 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:37:43,137 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:37:43,157 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:37:43,172 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:37:43,185 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:37:43,196 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:37:43,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:37:43,240 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-02-15 11:37:43,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 11:37:43,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:37:43,329 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-02-15 11:37:43,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-15 11:37:43,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,375 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:37:43,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 105 [2019-02-15 11:37:43,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:37:43,421 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-02-15 11:37:43,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:59 [2019-02-15 11:37:43,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-02-15 11:37:43,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:37:43,510 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-02-15 11:37:43,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:69, output treesize:47 [2019-02-15 11:37:43,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,556 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:37:43,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 124 [2019-02-15 11:37:43,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:37:43,606 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-02-15 11:37:43,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:45 [2019-02-15 11:37:43,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,648 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:37:43,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:37:43,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 120 [2019-02-15 11:37:43,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:37:43,695 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-02-15 11:37:43,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:57, output treesize:49 [2019-02-15 11:37:43,725 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:37:43,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:37:43,808 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:37:43,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:37:43,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-02-15 11:37:43,827 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:37:43,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-15 11:37:43,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-15 11:37:43,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-02-15 11:37:43,828 INFO L87 Difference]: Start difference. First operand 8693 states and 61400 transitions. Second operand 14 states. [2019-02-15 11:37:58,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:37:58,968 INFO L93 Difference]: Finished difference Result 8797 states and 61626 transitions. [2019-02-15 11:37:58,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:37:58,968 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-02-15 11:37:58,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:37:58,996 INFO L225 Difference]: With dead ends: 8797 [2019-02-15 11:37:58,996 INFO L226 Difference]: Without dead ends: 8791 [2019-02-15 11:37:58,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=367, Unknown=0, NotChecked=0, Total=552 [2019-02-15 11:37:59,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8791 states. [2019-02-15 11:38:06,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8791 to 1900. [2019-02-15 11:38:06,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1900 states. [2019-02-15 11:38:06,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 13072 transitions. [2019-02-15 11:38:06,770 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 13072 transitions. Word has length 7 [2019-02-15 11:38:06,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:38:06,770 INFO L480 AbstractCegarLoop]: Abstraction has 1900 states and 13072 transitions. [2019-02-15 11:38:06,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-15 11:38:06,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 13072 transitions. [2019-02-15 11:38:06,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:38:06,773 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:38:06,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:38:06,773 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:38:06,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:38:06,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1899825356, now seen corresponding path program 1 times [2019-02-15 11:38:06,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:38:06,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:38:06,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:38:06,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:38:06,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:38:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:38:06,818 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:38:06,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:38:06,818 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:38:06,818 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:38:06,818 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [28], [30], [31] [2019-02-15 11:38:06,819 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:38:06,819 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:38:07,116 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:38:07,116 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:38:07,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:38:07,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:38:07,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:38:07,116 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 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:38:07,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:38:07,125 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:38:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:38:07,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:38:07,133 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-02-15 11:38:07,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-02-15 11:38:07,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 11:38:07,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,240 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 11:38:07,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:38:07,312 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:38:07,336 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:38:07,360 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:38:07,384 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:38:07,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:38:07,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:38:07,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:38:07,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:38:07,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:38:07,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:38:07,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-15 11:38:07,461 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:38:07,494 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:38:07,512 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:38:07,526 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:38:07,537 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:38:07,549 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:38:07,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:38:07,590 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-02-15 11:38:07,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-02-15 11:38:07,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:38:07,662 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-02-15 11:38:07,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-02-15 11:38:07,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 107 [2019-02-15 11:38:07,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:38:07,744 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-02-15 11:38:07,744 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:51 [2019-02-15 11:38:07,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:07,783 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:38:07,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 134 [2019-02-15 11:38:07,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:38:08,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-02-15 11:38:08,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:90 [2019-02-15 11:38:08,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:38:08,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:38:08,110 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:38:08,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:38:08,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:38:08,130 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:38:08,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:38:08,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:38:08,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:38:08,130 INFO L87 Difference]: Start difference. First operand 1900 states and 13072 transitions. Second operand 10 states. [2019-02-15 11:38:17,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:38:17,683 INFO L93 Difference]: Finished difference Result 1963 states and 13288 transitions. [2019-02-15 11:38:17,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:38:17,684 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 11:38:17,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:38:17,689 INFO L225 Difference]: With dead ends: 1963 [2019-02-15 11:38:17,689 INFO L226 Difference]: Without dead ends: 1962 [2019-02-15 11:38:17,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:38:17,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2019-02-15 11:38:25,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1925. [2019-02-15 11:38:25,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1925 states. [2019-02-15 11:38:25,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 13247 transitions. [2019-02-15 11:38:25,367 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 13247 transitions. Word has length 7 [2019-02-15 11:38:25,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:38:25,367 INFO L480 AbstractCegarLoop]: Abstraction has 1925 states and 13247 transitions. [2019-02-15 11:38:25,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:38:25,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 13247 transitions. [2019-02-15 11:38:25,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:38:25,371 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:38:25,371 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:38:25,371 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:38:25,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:38:25,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1912516322, now seen corresponding path program 1 times [2019-02-15 11:38:25,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:38:25,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:38:25,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:38:25,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:38:25,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:38:25,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:38:25,521 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:38:25,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:38:25,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:38:25,522 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:38:25,522 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [28], [30], [31] [2019-02-15 11:38:25,522 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:38:25,523 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:38:25,796 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:38:25,796 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:38:25,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:38:25,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:38:25,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:38:25,797 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 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:38:25,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:38:25,807 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:38:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:38:25,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:38:25,815 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:38:25,820 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:38:25,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:25,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:25,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:38:25,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:25,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:25,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:25,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:38:25,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:25,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:25,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:25,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:25,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:38:25,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-15 11:38:25,854 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:38:25,880 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:38:25,899 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:38:25,914 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:38:25,927 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:38:25,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:38:25,962 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:38:25,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:25,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:25,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:38:26,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:26,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:26,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:26,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:26,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:38:26,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:26,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:26,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:26,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:26,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:26,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:26,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:38:26,057 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:38:26,071 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:38:26,085 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:38:26,101 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:38:26,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:38:26,130 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-02-15 11:38:26,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:26,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 11:38:26,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:38:26,194 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-02-15 11:38:26,194 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:38:26,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:26,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:26,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:26,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:26,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:26,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:26,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-02-15 11:38:26,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:38:26,240 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-02-15 11:38:26,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-02-15 11:38:26,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:26,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:26,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:26,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:26,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:26,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:26,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:26,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:26,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:26,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:26,269 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:38:26,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-02-15 11:38:26,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:38:26,294 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-02-15 11:38:26,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-15 11:38:26,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:38:26,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:38:26,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:38:26,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:38:26,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2019-02-15 11:38:26,372 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:38:26,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:38:26,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:38:26,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:38:26,373 INFO L87 Difference]: Start difference. First operand 1925 states and 13247 transitions. Second operand 11 states. [2019-02-15 11:38:34,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:38:34,012 INFO L93 Difference]: Finished difference Result 2000 states and 13456 transitions. [2019-02-15 11:38:34,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:38:34,013 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-15 11:38:34,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:38:34,018 INFO L225 Difference]: With dead ends: 2000 [2019-02-15 11:38:34,018 INFO L226 Difference]: Without dead ends: 1999 [2019-02-15 11:38:34,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:38:34,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2019-02-15 11:38:41,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1945. [2019-02-15 11:38:41,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1945 states. [2019-02-15 11:38:41,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 13387 transitions. [2019-02-15 11:38:41,806 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 13387 transitions. Word has length 7 [2019-02-15 11:38:41,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:38:41,806 INFO L480 AbstractCegarLoop]: Abstraction has 1945 states and 13387 transitions. [2019-02-15 11:38:41,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:38:41,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 13387 transitions. [2019-02-15 11:38:41,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:38:41,809 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:38:41,809 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:38:41,809 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:38:41,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:38:41,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1895531480, now seen corresponding path program 1 times [2019-02-15 11:38:41,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:38:41,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:38:41,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:38:41,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:38:41,810 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:38:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:38:41,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:38:41,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:38:41,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:38:41,822 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:38:41,822 INFO L207 CegarAbsIntRunner]: [0], [22], [28], [30], [32], [34], [35] [2019-02-15 11:38:41,823 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:38:41,823 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:38:41,972 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:38:41,973 INFO L272 AbstractInterpreter]: Visited 7 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:38:41,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:38:41,973 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:38:41,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:38:41,973 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 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:38:41,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:38:41,982 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:38:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:38:41,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:38:41,994 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:38:41,998 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:38:42,006 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-15 11:38:42,019 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-02-15 11:38:42,031 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-02-15 11:38:42,050 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-02-15 11:38:42,050 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:38:42,061 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:38:42,071 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:38:42,081 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:38:42,092 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:38:42,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:38:42,114 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-02-15 11:38:42,114 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:21, output treesize:31 [2019-02-15 11:38:42,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:38:42,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-02-15 11:38:42,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:38:42,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:38:42,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-15 11:38:42,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:38:42,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:38:42,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:38:42,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 11:38:42,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 4 [2019-02-15 11:38:42,149 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:38:42,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:38:42,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:38:42,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-02-15 11:38:42,149 INFO L87 Difference]: Start difference. First operand 1945 states and 13387 transitions. Second operand 4 states. [2019-02-15 11:38:52,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:38:52,978 INFO L93 Difference]: Finished difference Result 3175 states and 21705 transitions. [2019-02-15 11:38:52,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 11:38:52,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-02-15 11:38:52,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:38:52,987 INFO L225 Difference]: With dead ends: 3175 [2019-02-15 11:38:52,987 INFO L226 Difference]: Without dead ends: 3170 [2019-02-15 11:38:52,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-02-15 11:38:52,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2019-02-15 11:39:04,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 3133. [2019-02-15 11:39:04,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2019-02-15 11:39:04,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 21649 transitions. [2019-02-15 11:39:04,964 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 21649 transitions. Word has length 7 [2019-02-15 11:39:04,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:39:04,964 INFO L480 AbstractCegarLoop]: Abstraction has 3133 states and 21649 transitions. [2019-02-15 11:39:04,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:39:04,964 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 21649 transitions. [2019-02-15 11:39:04,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:39:04,968 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:39:04,968 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:39:04,969 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:39:04,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:39:04,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1908522342, now seen corresponding path program 1 times [2019-02-15 11:39:04,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:39:04,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:39:04,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:39:04,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:39:04,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:39:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:39:05,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:39:05,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:39:05,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:39:05,032 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:39:05,032 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [28], [30], [32], [33] [2019-02-15 11:39:05,032 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:39:05,033 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:39:05,243 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:39:05,243 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:39:05,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:39:05,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:39:05,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:39:05,244 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 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:39:05,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:39:05,252 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:39:05,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:39:05,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:39:05,259 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:39:05,263 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-15 11:39:05,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:39:05,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:39:05,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:39:05,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:39:05,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:39:05,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:39:05,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:39:05,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:39:05,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:39:05,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:39:05,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:39:05,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-15 11:39:05,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-15 11:39:05,296 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:39:05,322 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:39:05,340 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:39:05,356 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:39:05,368 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:39:05,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:39:05,401 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:39:05,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:39:05,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:39:05,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:39:05,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:39:05,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:39:05,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:39:05,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:39:05,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:39:05,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:39:05,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:39:05,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:39:05,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:39:05,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:39:05,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:39:05,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:39:05,495 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:39:05,509 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:39:05,523 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:39:05,538 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:39:05,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:39:05,567 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-15 11:39:05,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:39:05,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 11:39:05,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:39:05,618 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-02-15 11:39:05,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 11:39:05,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:39:05,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:39:05,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:39:05,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:39:05,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:39:05,640 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:39:05,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-15 11:39:05,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:39:05,659 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-02-15 11:39:05,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-02-15 11:39:05,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:39:05,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:39:05,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:39:05,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:39:05,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:39:05,714 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:39:05,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:39:05,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:39:05,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:39:05,714 INFO L87 Difference]: Start difference. First operand 3133 states and 21649 transitions. Second operand 8 states.