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_compound_oct_cong.epf -i ../../../trunk/examples/programs/real-life/threadpooling_product.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:14:03,168 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:14:03,173 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:14:03,187 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:14:03,188 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:14:03,189 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:14:03,190 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:14:03,192 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:14:03,193 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:14:03,194 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:14:03,195 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:14:03,195 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:14:03,196 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:14:03,197 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:14:03,198 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:14:03,199 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:14:03,200 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:14:03,201 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:14:03,204 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:14:03,205 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:14:03,206 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:14:03,207 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:14:03,210 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:14:03,210 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:14:03,210 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:14:03,211 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:14:03,212 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:14:03,213 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:14:03,214 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:14:03,215 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:14:03,215 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:14:03,216 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:14:03,216 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:14:03,216 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:14:03,217 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:14:03,218 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:14:03,218 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 17:14:03,238 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:14:03,238 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:14:03,239 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:14:03,239 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:14:03,240 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:14:03,240 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:14:03,240 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:14:03,240 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:14:03,240 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:14:03,241 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:14:03,241 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:14:03,241 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:14:03,241 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:14:03,242 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:14:03,242 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:14:03,242 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:14:03,242 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:14:03,243 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:14:03,243 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:14:03,243 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:14:03,243 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:14:03,243 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:14:03,243 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:14:03,244 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:14:03,244 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:14:03,244 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:14:03,244 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:14:03,244 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:14:03,245 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:14:03,245 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:14:03,245 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:14:03,245 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:14:03,245 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:14:03,246 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:14:03,246 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:14:03,246 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:14:03,246 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:14:03,246 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:14:03,246 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:14:03,290 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:14:03,302 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:14:03,306 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:14:03,307 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:14:03,308 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:14:03,309 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product.bpl [2018-12-03 17:14:03,309 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product.bpl' [2018-12-03 17:14:03,344 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:14:03,346 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:14:03,346 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:14:03,346 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:14:03,347 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:14:03,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:14:03" (1/1) ... [2018-12-03 17:14:03,372 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:14:03" (1/1) ... [2018-12-03 17:14:03,378 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 17:14:03,378 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 17:14:03,378 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 17:14:03,380 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:14:03,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:14:03,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:14:03,382 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:14:03,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:14:03" (1/1) ... [2018-12-03 17:14:03,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:14:03" (1/1) ... [2018-12-03 17:14:03,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:14:03" (1/1) ... [2018-12-03 17:14:03,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:14:03" (1/1) ... [2018-12-03 17:14:03,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:14:03" (1/1) ... [2018-12-03 17:14:03,402 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:14:03" (1/1) ... [2018-12-03 17:14:03,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:14:03" (1/1) ... [2018-12-03 17:14:03,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:14:03,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:14:03,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:14:03,405 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:14:03,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:14:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:14:03,475 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-12-03 17:14:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-12-03 17:14:03,475 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-12-03 17:14:04,077 INFO L272 CfgBuilder]: Using library mode [2018-12-03 17:14:04,078 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 17:14:04,078 INFO L202 PluginConnector]: Adding new model threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:14:04 BoogieIcfgContainer [2018-12-03 17:14:04,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:14:04,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:14:04,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:14:04,082 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:14:04,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:14:03" (1/2) ... [2018-12-03 17:14:04,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@210f88ad and model type threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:14:04, skipping insertion in model container [2018-12-03 17:14:04,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:14:04" (2/2) ... [2018-12-03 17:14:04,085 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product.bpl [2018-12-03 17:14:04,093 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:14:04,100 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-12-03 17:14:04,116 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-12-03 17:14:04,149 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:14:04,149 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:14:04,150 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:14:04,150 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:14:04,150 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:14:04,150 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:14:04,150 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:14:04,151 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:14:04,167 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-12-03 17:14:04,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 17:14:04,174 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:04,175 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 17:14:04,178 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:04,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:04,184 INFO L82 PathProgramCache]: Analyzing trace with hash 28755683, now seen corresponding path program 1 times [2018-12-03 17:14:04,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:04,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:04,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:04,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:04,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:04,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:04,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:04,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:14:04,374 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:04,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 17:14:04,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 17:14:04,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:14:04,392 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2018-12-03 17:14:05,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:05,016 INFO L93 Difference]: Finished difference Result 49 states and 85 transitions. [2018-12-03 17:14:05,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 17:14:05,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 17:14:05,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:05,031 INFO L225 Difference]: With dead ends: 49 [2018-12-03 17:14:05,032 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 17:14:05,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:14:05,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 17:14:05,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2018-12-03 17:14:05,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 17:14:05,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2018-12-03 17:14:05,074 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 5 [2018-12-03 17:14:05,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:05,074 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2018-12-03 17:14:05,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 17:14:05,075 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2018-12-03 17:14:05,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 17:14:05,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:05,076 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 17:14:05,076 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:05,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:05,077 INFO L82 PathProgramCache]: Analyzing trace with hash 28971747, now seen corresponding path program 1 times [2018-12-03 17:14:05,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:05,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:05,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:05,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:05,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:05,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:05,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:05,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:14:05,199 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:05,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 17:14:05,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 17:14:05,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:14:05,202 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 5 states. [2018-12-03 17:14:05,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:05,606 INFO L93 Difference]: Finished difference Result 57 states and 99 transitions. [2018-12-03 17:14:05,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 17:14:05,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 17:14:05,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:05,609 INFO L225 Difference]: With dead ends: 57 [2018-12-03 17:14:05,609 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 17:14:05,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:14:05,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 17:14:05,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2018-12-03 17:14:05,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 17:14:05,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 63 transitions. [2018-12-03 17:14:05,620 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 63 transitions. Word has length 5 [2018-12-03 17:14:05,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:05,621 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 63 transitions. [2018-12-03 17:14:05,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 17:14:05,621 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 63 transitions. [2018-12-03 17:14:05,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 17:14:05,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:05,622 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:05,623 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:05,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:05,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1864688358, now seen corresponding path program 1 times [2018-12-03 17:14:05,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:05,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:05,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:05,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:05,625 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:05,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:05,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:05,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 17:14:05,889 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:05,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:14:05,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:14:05,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:14:05,890 INFO L87 Difference]: Start difference. First operand 38 states and 63 transitions. Second operand 7 states. [2018-12-03 17:14:07,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:07,014 INFO L93 Difference]: Finished difference Result 84 states and 147 transitions. [2018-12-03 17:14:07,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:14:07,015 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 17:14:07,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:07,016 INFO L225 Difference]: With dead ends: 84 [2018-12-03 17:14:07,016 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 17:14:07,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-03 17:14:07,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 17:14:07,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 51. [2018-12-03 17:14:07,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 17:14:07,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 86 transitions. [2018-12-03 17:14:07,031 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 86 transitions. Word has length 7 [2018-12-03 17:14:07,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:07,031 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 86 transitions. [2018-12-03 17:14:07,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:14:07,032 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 86 transitions. [2018-12-03 17:14:07,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 17:14:07,033 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:07,033 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-12-03 17:14:07,033 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:07,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:07,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1865765160, now seen corresponding path program 1 times [2018-12-03 17:14:07,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:07,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:07,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:07,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:07,035 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:07,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:07,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:07,167 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:07,169 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-03 17:14:07,171 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [9], [20], [21] [2018-12-03 17:14:07,227 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:07,227 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:07,321 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:14:07,322 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:14:07,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:07,337 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:14:07,398 INFO L227 lantSequenceWeakener]: Weakened 6 states. On average, predicates are now at 41.67% of their original sizes. [2018-12-03 17:14:07,398 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:14:07,646 INFO L418 sIntCurrentIteration]: We unified 6 AI predicates to 6 [2018-12-03 17:14:07,647 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:14:07,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:14:07,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 10 [2018-12-03 17:14:07,648 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:07,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:14:07,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:14:07,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:14:07,649 INFO L87 Difference]: Start difference. First operand 51 states and 86 transitions. Second operand 7 states. [2018-12-03 17:14:09,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:09,395 INFO L93 Difference]: Finished difference Result 107 states and 193 transitions. [2018-12-03 17:14:09,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 17:14:09,396 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 17:14:09,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:09,397 INFO L225 Difference]: With dead ends: 107 [2018-12-03 17:14:09,398 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 17:14:09,398 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:14:09,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 17:14:09,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 64. [2018-12-03 17:14:09,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 17:14:09,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 112 transitions. [2018-12-03 17:14:09,416 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 112 transitions. Word has length 7 [2018-12-03 17:14:09,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:09,416 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 112 transitions. [2018-12-03 17:14:09,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:14:09,416 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 112 transitions. [2018-12-03 17:14:09,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:14:09,417 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:09,417 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:09,418 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:09,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:09,418 INFO L82 PathProgramCache]: Analyzing trace with hash 964893579, now seen corresponding path program 1 times [2018-12-03 17:14:09,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:09,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:09,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:09,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:09,420 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:09,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:09,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:09,616 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:09,616 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2018-12-03 17:14:09,616 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [29], [32], [34], [65], [66] [2018-12-03 17:14:09,617 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:09,618 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:09,645 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:14:09,646 INFO L272 AbstractInterpreter]: Visited 8 different actions 14 times. Merged at 4 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:14:09,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:09,664 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:14:09,682 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 48.96% of their original sizes. [2018-12-03 17:14:09,683 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:14:09,807 INFO L418 sIntCurrentIteration]: We unified 8 AI predicates to 8 [2018-12-03 17:14:09,808 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:14:09,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:14:09,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 14 [2018-12-03 17:14:09,809 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:09,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:14:09,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:14:09,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:14:09,810 INFO L87 Difference]: Start difference. First operand 64 states and 112 transitions. Second operand 9 states. [2018-12-03 17:14:12,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:12,443 INFO L93 Difference]: Finished difference Result 122 states and 222 transitions. [2018-12-03 17:14:12,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 17:14:12,443 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 17:14:12,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:12,445 INFO L225 Difference]: With dead ends: 122 [2018-12-03 17:14:12,445 INFO L226 Difference]: Without dead ends: 120 [2018-12-03 17:14:12,446 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-12-03 17:14:12,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-03 17:14:12,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 53. [2018-12-03 17:14:12,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 17:14:12,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 93 transitions. [2018-12-03 17:14:12,472 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 93 transitions. Word has length 9 [2018-12-03 17:14:12,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:12,472 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 93 transitions. [2018-12-03 17:14:12,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:14:12,472 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 93 transitions. [2018-12-03 17:14:12,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 17:14:12,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:12,473 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:12,474 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:12,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:12,474 INFO L82 PathProgramCache]: Analyzing trace with hash 101966393, now seen corresponding path program 1 times [2018-12-03 17:14:12,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:12,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:12,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:12,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:12,477 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:12,785 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 11 [2018-12-03 17:14:12,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:12,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:12,843 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:12,843 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2018-12-03 17:14:12,844 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [20], [22], [25], [29], [32], [65], [66] [2018-12-03 17:14:12,846 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:12,846 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:12,854 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:14:12,855 INFO L272 AbstractInterpreter]: Visited 10 different actions 15 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:14:12,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:12,856 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:14:12,877 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 42.19% of their original sizes. [2018-12-03 17:14:12,878 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:14:13,243 INFO L418 sIntCurrentIteration]: We unified 9 AI predicates to 9 [2018-12-03 17:14:13,244 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:14:13,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:14:13,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 16 [2018-12-03 17:14:13,245 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:13,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:14:13,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:14:13,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-12-03 17:14:13,247 INFO L87 Difference]: Start difference. First operand 53 states and 93 transitions. Second operand 11 states. [2018-12-03 17:14:17,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:17,552 INFO L93 Difference]: Finished difference Result 177 states and 319 transitions. [2018-12-03 17:14:17,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:14:17,552 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-12-03 17:14:17,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:17,558 INFO L225 Difference]: With dead ends: 177 [2018-12-03 17:14:17,558 INFO L226 Difference]: Without dead ends: 125 [2018-12-03 17:14:17,559 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:14:17,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-03 17:14:17,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 79. [2018-12-03 17:14:17,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 17:14:17,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 138 transitions. [2018-12-03 17:14:17,610 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 138 transitions. Word has length 10 [2018-12-03 17:14:17,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:17,610 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 138 transitions. [2018-12-03 17:14:17,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:14:17,610 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 138 transitions. [2018-12-03 17:14:17,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 17:14:17,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:17,611 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:17,611 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:17,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:17,612 INFO L82 PathProgramCache]: Analyzing trace with hash 103259259, now seen corresponding path program 1 times [2018-12-03 17:14:17,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:17,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:17,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:17,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:17,614 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:18,172 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 7 [2018-12-03 17:14:18,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:18,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:18,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:14:18,498 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:18,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:14:18,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:14:18,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:14:18,499 INFO L87 Difference]: Start difference. First operand 79 states and 138 transitions. Second operand 8 states. [2018-12-03 17:14:19,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:19,198 INFO L93 Difference]: Finished difference Result 183 states and 319 transitions. [2018-12-03 17:14:19,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 17:14:19,199 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-12-03 17:14:19,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:19,201 INFO L225 Difference]: With dead ends: 183 [2018-12-03 17:14:19,201 INFO L226 Difference]: Without dead ends: 181 [2018-12-03 17:14:19,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:14:19,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-03 17:14:19,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 115. [2018-12-03 17:14:19,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 17:14:19,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 203 transitions. [2018-12-03 17:14:19,235 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 203 transitions. Word has length 10 [2018-12-03 17:14:19,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:19,236 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 203 transitions. [2018-12-03 17:14:19,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:14:19,236 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 203 transitions. [2018-12-03 17:14:19,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 17:14:19,237 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:19,237 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:19,237 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:19,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:19,238 INFO L82 PathProgramCache]: Analyzing trace with hash -176034432, now seen corresponding path program 1 times [2018-12-03 17:14:19,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:19,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:19,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:19,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:19,239 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:19,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:19,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:19,455 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:19,455 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2018-12-03 17:14:19,455 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [29], [32], [56], [57], [65], [67], [70] [2018-12-03 17:14:19,456 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:19,457 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:19,491 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:14:19,492 INFO L272 AbstractInterpreter]: Visited 10 different actions 28 times. Merged at 5 different actions 16 times. Widened at 1 different actions 2 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 17:14:19,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:19,519 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:14:19,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:19,519 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:14:19,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:19,529 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:19,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:20,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:20,524 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:20,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:20,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:20,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 17 [2018-12-03 17:14:20,706 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:20,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:14:20,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:14:20,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:14:20,708 INFO L87 Difference]: Start difference. First operand 115 states and 203 transitions. Second operand 13 states. [2018-12-03 17:14:23,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:23,415 INFO L93 Difference]: Finished difference Result 306 states and 516 transitions. [2018-12-03 17:14:23,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 17:14:23,416 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2018-12-03 17:14:23,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:23,418 INFO L225 Difference]: With dead ends: 306 [2018-12-03 17:14:23,418 INFO L226 Difference]: Without dead ends: 304 [2018-12-03 17:14:23,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=495, Invalid=2157, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:14:23,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-12-03 17:14:23,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 182. [2018-12-03 17:14:23,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-03 17:14:23,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 331 transitions. [2018-12-03 17:14:23,475 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 331 transitions. Word has length 10 [2018-12-03 17:14:23,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:23,475 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 331 transitions. [2018-12-03 17:14:23,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:14:23,476 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 331 transitions. [2018-12-03 17:14:23,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 17:14:23,477 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:23,477 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:23,477 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:23,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:23,478 INFO L82 PathProgramCache]: Analyzing trace with hash -184622601, now seen corresponding path program 1 times [2018-12-03 17:14:23,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:23,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:23,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:23,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:23,479 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:23,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:23,604 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:23,604 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2018-12-03 17:14:23,604 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [29], [32], [56], [58], [61], [65], [66] [2018-12-03 17:14:23,605 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:23,605 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:23,611 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:14:23,611 INFO L272 AbstractInterpreter]: Visited 10 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:14:23,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:23,651 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:14:23,666 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 42.59% of their original sizes. [2018-12-03 17:14:23,666 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:14:23,811 INFO L418 sIntCurrentIteration]: We unified 9 AI predicates to 9 [2018-12-03 17:14:23,811 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:14:23,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:14:23,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 16 [2018-12-03 17:14:23,812 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:23,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:14:23,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:14:23,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-12-03 17:14:23,814 INFO L87 Difference]: Start difference. First operand 182 states and 331 transitions. Second operand 11 states. [2018-12-03 17:14:28,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:28,138 INFO L93 Difference]: Finished difference Result 233 states and 423 transitions. [2018-12-03 17:14:28,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:14:28,138 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-12-03 17:14:28,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:28,140 INFO L225 Difference]: With dead ends: 233 [2018-12-03 17:14:28,140 INFO L226 Difference]: Without dead ends: 231 [2018-12-03 17:14:28,141 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:14:28,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-12-03 17:14:28,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 197. [2018-12-03 17:14:28,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-03 17:14:28,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 357 transitions. [2018-12-03 17:14:28,236 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 357 transitions. Word has length 10 [2018-12-03 17:14:28,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:28,237 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 357 transitions. [2018-12-03 17:14:28,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:14:28,237 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 357 transitions. [2018-12-03 17:14:28,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 17:14:28,238 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:28,238 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:28,239 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:28,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:28,243 INFO L82 PathProgramCache]: Analyzing trace with hash -184621319, now seen corresponding path program 1 times [2018-12-03 17:14:28,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:28,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:28,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:28,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:28,244 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:28,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:28,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:28,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:14:28,406 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:28,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:14:28,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:14:28,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:14:28,407 INFO L87 Difference]: Start difference. First operand 197 states and 357 transitions. Second operand 8 states. [2018-12-03 17:14:29,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:29,260 INFO L93 Difference]: Finished difference Result 269 states and 471 transitions. [2018-12-03 17:14:29,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 17:14:29,261 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-12-03 17:14:29,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:29,264 INFO L225 Difference]: With dead ends: 269 [2018-12-03 17:14:29,264 INFO L226 Difference]: Without dead ends: 267 [2018-12-03 17:14:29,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:14:29,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-12-03 17:14:29,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 202. [2018-12-03 17:14:29,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-03 17:14:29,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 365 transitions. [2018-12-03 17:14:29,314 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 365 transitions. Word has length 10 [2018-12-03 17:14:29,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:29,314 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 365 transitions. [2018-12-03 17:14:29,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:14:29,314 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 365 transitions. [2018-12-03 17:14:29,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 17:14:29,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:29,315 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:29,316 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:29,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:29,316 INFO L82 PathProgramCache]: Analyzing trace with hash -973282432, now seen corresponding path program 1 times [2018-12-03 17:14:29,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:29,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:29,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:29,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:29,317 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:29,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:29,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:29,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:29,459 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:29,460 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2018-12-03 17:14:29,460 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [38], [41], [56], [57], [65], [67], [70] [2018-12-03 17:14:29,462 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:29,462 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:29,466 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:14:29,467 INFO L272 AbstractInterpreter]: Visited 10 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:14:29,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:29,471 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:14:29,485 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 42.59% of their original sizes. [2018-12-03 17:14:29,486 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:14:29,674 INFO L418 sIntCurrentIteration]: We unified 9 AI predicates to 9 [2018-12-03 17:14:29,674 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:14:29,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:14:29,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 16 [2018-12-03 17:14:29,675 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:29,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:14:29,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:14:29,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-12-03 17:14:29,676 INFO L87 Difference]: Start difference. First operand 202 states and 365 transitions. Second operand 11 states. [2018-12-03 17:14:35,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:35,230 INFO L93 Difference]: Finished difference Result 524 states and 957 transitions. [2018-12-03 17:14:35,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:14:35,231 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-12-03 17:14:35,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:35,234 INFO L225 Difference]: With dead ends: 524 [2018-12-03 17:14:35,234 INFO L226 Difference]: Without dead ends: 323 [2018-12-03 17:14:35,236 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:14:35,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-12-03 17:14:35,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 272. [2018-12-03 17:14:35,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-12-03 17:14:35,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 484 transitions. [2018-12-03 17:14:35,309 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 484 transitions. Word has length 10 [2018-12-03 17:14:35,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:35,309 INFO L480 AbstractCegarLoop]: Abstraction has 272 states and 484 transitions. [2018-12-03 17:14:35,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:14:35,309 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 484 transitions. [2018-12-03 17:14:35,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 17:14:35,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:35,310 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:35,310 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:35,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:35,310 INFO L82 PathProgramCache]: Analyzing trace with hash -973281662, now seen corresponding path program 1 times [2018-12-03 17:14:35,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:35,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:35,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:35,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:35,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:35,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:35,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:35,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:35,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:14:35,409 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:35,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:14:35,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:14:35,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:14:35,410 INFO L87 Difference]: Start difference. First operand 272 states and 484 transitions. Second operand 8 states. [2018-12-03 17:14:35,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:35,924 INFO L93 Difference]: Finished difference Result 389 states and 683 transitions. [2018-12-03 17:14:35,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 17:14:35,925 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-12-03 17:14:35,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:35,927 INFO L225 Difference]: With dead ends: 389 [2018-12-03 17:14:35,927 INFO L226 Difference]: Without dead ends: 387 [2018-12-03 17:14:35,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:14:35,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-12-03 17:14:36,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 324. [2018-12-03 17:14:36,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-12-03 17:14:36,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 576 transitions. [2018-12-03 17:14:36,009 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 576 transitions. Word has length 10 [2018-12-03 17:14:36,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:36,009 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 576 transitions. [2018-12-03 17:14:36,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:14:36,010 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 576 transitions. [2018-12-03 17:14:36,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 17:14:36,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:36,010 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:36,011 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:36,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:36,011 INFO L82 PathProgramCache]: Analyzing trace with hash -981870601, now seen corresponding path program 1 times [2018-12-03 17:14:36,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:36,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:36,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:36,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:36,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:36,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:36,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:36,082 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:36,083 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2018-12-03 17:14:36,083 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [38], [41], [56], [58], [61], [65], [66] [2018-12-03 17:14:36,084 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:36,084 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:36,102 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:14:36,102 INFO L272 AbstractInterpreter]: Visited 10 different actions 28 times. Merged at 5 different actions 15 times. Widened at 1 different actions 2 times. Found 3 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 17:14:36,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:36,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:14:36,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:36,138 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:14:36,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:36,154 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:36,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:36,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:36,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:36,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:36,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:36,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 17 [2018-12-03 17:14:36,400 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:36,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:14:36,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:14:36,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:14:36,401 INFO L87 Difference]: Start difference. First operand 324 states and 576 transitions. Second operand 13 states. [2018-12-03 17:14:37,926 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 17:14:38,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:38,995 INFO L93 Difference]: Finished difference Result 562 states and 959 transitions. [2018-12-03 17:14:38,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 17:14:38,996 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2018-12-03 17:14:38,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:39,001 INFO L225 Difference]: With dead ends: 562 [2018-12-03 17:14:39,001 INFO L226 Difference]: Without dead ends: 560 [2018-12-03 17:14:39,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=495, Invalid=2157, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:14:39,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2018-12-03 17:14:39,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 395. [2018-12-03 17:14:39,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-12-03 17:14:39,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 707 transitions. [2018-12-03 17:14:39,131 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 707 transitions. Word has length 10 [2018-12-03 17:14:39,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:39,131 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 707 transitions. [2018-12-03 17:14:39,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:14:39,131 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 707 transitions. [2018-12-03 17:14:39,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 17:14:39,132 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:39,132 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:39,132 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:39,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:39,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1101306322, now seen corresponding path program 1 times [2018-12-03 17:14:39,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:39,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:39,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:39,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:39,134 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:39,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:39,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:39,324 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:39,324 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2018-12-03 17:14:39,324 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [38], [41], [45], [47], [50], [56], [57] [2018-12-03 17:14:39,326 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:39,326 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:39,332 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:14:39,332 INFO L272 AbstractInterpreter]: Visited 10 different actions 15 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:14:39,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:39,361 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:14:39,373 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 42.19% of their original sizes. [2018-12-03 17:14:39,373 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:14:39,473 INFO L418 sIntCurrentIteration]: We unified 9 AI predicates to 9 [2018-12-03 17:14:39,474 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:14:39,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:14:39,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 16 [2018-12-03 17:14:39,474 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:39,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:14:39,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:14:39,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-12-03 17:14:39,475 INFO L87 Difference]: Start difference. First operand 395 states and 707 transitions. Second operand 11 states. [2018-12-03 17:14:42,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:42,429 INFO L93 Difference]: Finished difference Result 556 states and 1009 transitions. [2018-12-03 17:14:42,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:14:42,429 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-12-03 17:14:42,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:42,432 INFO L225 Difference]: With dead ends: 556 [2018-12-03 17:14:42,432 INFO L226 Difference]: Without dead ends: 554 [2018-12-03 17:14:42,433 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:14:42,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-12-03 17:14:42,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 512. [2018-12-03 17:14:42,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2018-12-03 17:14:42,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 926 transitions. [2018-12-03 17:14:42,629 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 926 transitions. Word has length 10 [2018-12-03 17:14:42,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:42,630 INFO L480 AbstractCegarLoop]: Abstraction has 512 states and 926 transitions. [2018-12-03 17:14:42,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:14:42,630 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 926 transitions. [2018-12-03 17:14:42,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 17:14:42,630 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:42,630 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:42,631 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:42,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:42,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1102106644, now seen corresponding path program 1 times [2018-12-03 17:14:42,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:42,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:42,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:42,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:42,632 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:43,122 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 7 [2018-12-03 17:14:43,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:43,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:43,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:14:43,140 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:43,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:14:43,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:14:43,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:14:43,141 INFO L87 Difference]: Start difference. First operand 512 states and 926 transitions. Second operand 8 states. [2018-12-03 17:14:43,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:43,911 INFO L93 Difference]: Finished difference Result 591 states and 1063 transitions. [2018-12-03 17:14:43,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 17:14:43,911 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-12-03 17:14:43,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:43,914 INFO L225 Difference]: With dead ends: 591 [2018-12-03 17:14:43,914 INFO L226 Difference]: Without dead ends: 589 [2018-12-03 17:14:43,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:14:43,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-12-03 17:14:44,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 535. [2018-12-03 17:14:44,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-12-03 17:14:44,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 967 transitions. [2018-12-03 17:14:44,075 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 967 transitions. Word has length 10 [2018-12-03 17:14:44,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:44,076 INFO L480 AbstractCegarLoop]: Abstraction has 535 states and 967 transitions. [2018-12-03 17:14:44,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:14:44,076 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 967 transitions. [2018-12-03 17:14:44,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 17:14:44,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:44,077 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:44,077 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:44,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:44,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1000080215, now seen corresponding path program 1 times [2018-12-03 17:14:44,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:44,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:44,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:44,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:44,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:44,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:44,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:44,174 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:44,174 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 17:14:44,174 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [11], [14], [20], [22], [27], [45], [46], [47], [50] [2018-12-03 17:14:44,176 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:44,176 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:44,186 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:14:44,186 INFO L272 AbstractInterpreter]: Visited 12 different actions 23 times. Merged at 8 different actions 9 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 17:14:44,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:44,212 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:14:44,225 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 45.45% of their original sizes. [2018-12-03 17:14:44,225 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:14:44,410 INFO L418 sIntCurrentIteration]: We unified 12 AI predicates to 12 [2018-12-03 17:14:44,410 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:14:44,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:14:44,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 20 [2018-12-03 17:14:44,411 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:44,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 17:14:44,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 17:14:44,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-12-03 17:14:44,412 INFO L87 Difference]: Start difference. First operand 535 states and 967 transitions. Second operand 14 states. [2018-12-03 17:14:46,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:46,468 INFO L93 Difference]: Finished difference Result 984 states and 1780 transitions. [2018-12-03 17:14:46,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 17:14:46,468 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-12-03 17:14:46,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:46,471 INFO L225 Difference]: With dead ends: 984 [2018-12-03 17:14:46,471 INFO L226 Difference]: Without dead ends: 654 [2018-12-03 17:14:46,473 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2018-12-03 17:14:46,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2018-12-03 17:14:46,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 482. [2018-12-03 17:14:46,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-12-03 17:14:46,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 863 transitions. [2018-12-03 17:14:46,624 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 863 transitions. Word has length 13 [2018-12-03 17:14:46,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:46,625 INFO L480 AbstractCegarLoop]: Abstraction has 482 states and 863 transitions. [2018-12-03 17:14:46,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 17:14:46,625 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 863 transitions. [2018-12-03 17:14:46,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 17:14:46,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:46,626 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:46,626 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:46,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:46,626 INFO L82 PathProgramCache]: Analyzing trace with hash -86604803, now seen corresponding path program 1 times [2018-12-03 17:14:46,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:46,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:46,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:46,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:46,627 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:46,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:46,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:46,723 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:46,723 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 17:14:46,723 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [29], [32], [56], [58], [61], [65], [66], [67], [70] [2018-12-03 17:14:46,724 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:46,724 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:46,745 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:14:46,746 INFO L272 AbstractInterpreter]: Visited 12 different actions 44 times. Merged at 6 different actions 23 times. Widened at 1 different actions 3 times. Found 7 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 17:14:46,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:46,747 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:14:46,757 INFO L227 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 40.28% of their original sizes. [2018-12-03 17:14:46,757 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:14:46,934 INFO L418 sIntCurrentIteration]: We unified 12 AI predicates to 12 [2018-12-03 17:14:46,934 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:14:46,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:14:46,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 20 [2018-12-03 17:14:46,935 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:46,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 17:14:46,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 17:14:46,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-12-03 17:14:46,936 INFO L87 Difference]: Start difference. First operand 482 states and 863 transitions. Second operand 14 states. [2018-12-03 17:14:48,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:48,719 INFO L93 Difference]: Finished difference Result 864 states and 1567 transitions. [2018-12-03 17:14:48,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:14:48,720 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-12-03 17:14:48,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:48,722 INFO L225 Difference]: With dead ends: 864 [2018-12-03 17:14:48,722 INFO L226 Difference]: Without dead ends: 534 [2018-12-03 17:14:48,723 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:14:48,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-12-03 17:14:48,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 469. [2018-12-03 17:14:48,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-12-03 17:14:48,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 836 transitions. [2018-12-03 17:14:48,904 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 836 transitions. Word has length 13 [2018-12-03 17:14:48,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:48,904 INFO L480 AbstractCegarLoop]: Abstraction has 469 states and 836 transitions. [2018-12-03 17:14:48,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 17:14:48,905 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 836 transitions. [2018-12-03 17:14:48,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 17:14:48,905 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:48,906 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:48,906 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:48,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:48,906 INFO L82 PathProgramCache]: Analyzing trace with hash -63701769, now seen corresponding path program 1 times [2018-12-03 17:14:48,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:48,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:48,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:48,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:48,908 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:49,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:49,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:49,220 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:49,220 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 17:14:49,221 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [20], [21], [22], [25], [29], [32], [65], [67], [72] [2018-12-03 17:14:49,222 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:49,223 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:49,252 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:14:49,252 INFO L272 AbstractInterpreter]: Visited 12 different actions 55 times. Merged at 9 different actions 35 times. Widened at 2 different actions 5 times. Found 9 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 17:14:49,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:49,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:14:49,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:49,259 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:14:49,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:49,270 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:49,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:49,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:49,375 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:49,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:49,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 17:14:49,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 7] total 15 [2018-12-03 17:14:49,462 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:49,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:14:49,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:14:49,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:14:49,463 INFO L87 Difference]: Start difference. First operand 469 states and 836 transitions. Second operand 7 states. [2018-12-03 17:14:49,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:49,999 INFO L93 Difference]: Finished difference Result 833 states and 1481 transitions. [2018-12-03 17:14:49,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 17:14:49,999 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-12-03 17:14:50,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:50,002 INFO L225 Difference]: With dead ends: 833 [2018-12-03 17:14:50,003 INFO L226 Difference]: Without dead ends: 588 [2018-12-03 17:14:50,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:14:50,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2018-12-03 17:14:50,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 537. [2018-12-03 17:14:50,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-12-03 17:14:50,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 947 transitions. [2018-12-03 17:14:50,214 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 947 transitions. Word has length 13 [2018-12-03 17:14:50,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:50,214 INFO L480 AbstractCegarLoop]: Abstraction has 537 states and 947 transitions. [2018-12-03 17:14:50,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:14:50,214 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 947 transitions. [2018-12-03 17:14:50,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 17:14:50,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:50,215 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:50,216 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:50,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:50,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1761298639, now seen corresponding path program 1 times [2018-12-03 17:14:50,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:50,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:50,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:50,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:50,217 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:50,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:50,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:50,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:50,379 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:50,379 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 17:14:50,380 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [29], [32], [56], [57], [58], [61], [65], [67], [70] [2018-12-03 17:14:50,380 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:50,381 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:50,398 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:14:50,399 INFO L272 AbstractInterpreter]: Visited 12 different actions 44 times. Merged at 7 different actions 24 times. Widened at 1 different actions 3 times. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 17:14:50,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:50,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:14:50,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:50,403 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:14:50,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:50,412 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:50,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:50,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:50,554 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:50,586 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:50,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:50,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2018-12-03 17:14:50,605 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:50,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:14:50,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:14:50,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:14:50,608 INFO L87 Difference]: Start difference. First operand 537 states and 947 transitions. Second operand 10 states. [2018-12-03 17:14:51,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:51,700 INFO L93 Difference]: Finished difference Result 697 states and 1207 transitions. [2018-12-03 17:14:51,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 17:14:51,700 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-12-03 17:14:51,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:51,703 INFO L225 Difference]: With dead ends: 697 [2018-12-03 17:14:51,703 INFO L226 Difference]: Without dead ends: 695 [2018-12-03 17:14:51,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2018-12-03 17:14:51,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2018-12-03 17:14:51,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 553. [2018-12-03 17:14:51,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2018-12-03 17:14:51,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 977 transitions. [2018-12-03 17:14:51,883 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 977 transitions. Word has length 13 [2018-12-03 17:14:51,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:51,883 INFO L480 AbstractCegarLoop]: Abstraction has 553 states and 977 transitions. [2018-12-03 17:14:51,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:14:51,883 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 977 transitions. [2018-12-03 17:14:51,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 17:14:51,884 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:51,884 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:51,884 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:51,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:51,885 INFO L82 PathProgramCache]: Analyzing trace with hash 267374077, now seen corresponding path program 1 times [2018-12-03 17:14:51,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:51,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:51,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:51,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:51,886 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:51,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:51,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:51,950 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:51,950 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 17:14:51,951 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [38], [41], [56], [58], [61], [65], [66], [67], [70] [2018-12-03 17:14:51,952 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:51,952 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:51,975 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:14:51,975 INFO L272 AbstractInterpreter]: Visited 12 different actions 46 times. Merged at 7 different actions 25 times. Widened at 1 different actions 4 times. Found 9 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 17:14:51,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:51,981 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:14:51,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:51,981 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:14:51,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:51,990 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:52,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:52,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:52,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:52,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:52,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:52,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2018-12-03 17:14:52,113 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:52,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:14:52,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:14:52,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:14:52,114 INFO L87 Difference]: Start difference. First operand 553 states and 977 transitions. Second operand 10 states. [2018-12-03 17:14:52,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:52,994 INFO L93 Difference]: Finished difference Result 711 states and 1233 transitions. [2018-12-03 17:14:52,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 17:14:52,994 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-12-03 17:14:52,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:52,997 INFO L225 Difference]: With dead ends: 711 [2018-12-03 17:14:52,997 INFO L226 Difference]: Without dead ends: 709 [2018-12-03 17:14:52,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2018-12-03 17:14:52,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-12-03 17:14:53,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 573. [2018-12-03 17:14:53,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-12-03 17:14:53,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1013 transitions. [2018-12-03 17:14:53,148 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1013 transitions. Word has length 13 [2018-12-03 17:14:53,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:53,149 INFO L480 AbstractCegarLoop]: Abstraction has 573 states and 1013 transitions. [2018-12-03 17:14:53,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:14:53,149 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1013 transitions. [2018-12-03 17:14:53,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 17:14:53,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:53,149 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:53,150 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:53,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:53,150 INFO L82 PathProgramCache]: Analyzing trace with hash 2115277519, now seen corresponding path program 1 times [2018-12-03 17:14:53,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:53,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:53,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:53,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:53,151 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:53,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:53,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:53,254 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:53,254 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 17:14:53,255 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [38], [41], [56], [57], [58], [61], [65], [67], [70] [2018-12-03 17:14:53,256 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:53,257 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:53,278 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:14:53,279 INFO L272 AbstractInterpreter]: Visited 12 different actions 42 times. Merged at 6 different actions 21 times. Widened at 1 different actions 3 times. Found 7 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 17:14:53,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:53,315 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:14:53,328 INFO L227 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 40.28% of their original sizes. [2018-12-03 17:14:53,328 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:14:53,560 INFO L418 sIntCurrentIteration]: We unified 12 AI predicates to 12 [2018-12-03 17:14:53,560 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:14:53,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:14:53,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 20 [2018-12-03 17:14:53,560 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:53,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 17:14:53,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 17:14:53,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-12-03 17:14:53,561 INFO L87 Difference]: Start difference. First operand 573 states and 1013 transitions. Second operand 14 states. [2018-12-03 17:14:56,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:56,385 INFO L93 Difference]: Finished difference Result 642 states and 1141 transitions. [2018-12-03 17:14:56,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:14:56,385 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-12-03 17:14:56,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:56,388 INFO L225 Difference]: With dead ends: 642 [2018-12-03 17:14:56,388 INFO L226 Difference]: Without dead ends: 640 [2018-12-03 17:14:56,389 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:14:56,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-12-03 17:14:56,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 579. [2018-12-03 17:14:56,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-12-03 17:14:56,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1023 transitions. [2018-12-03 17:14:56,574 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1023 transitions. Word has length 13 [2018-12-03 17:14:56,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:56,574 INFO L480 AbstractCegarLoop]: Abstraction has 579 states and 1023 transitions. [2018-12-03 17:14:56,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 17:14:56,574 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1023 transitions. [2018-12-03 17:14:56,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 17:14:56,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:56,575 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:56,576 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:56,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:56,576 INFO L82 PathProgramCache]: Analyzing trace with hash -2141517287, now seen corresponding path program 1 times [2018-12-03 17:14:56,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:56,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:56,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:56,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:56,579 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:57,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:57,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:57,048 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:57,048 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 17:14:57,048 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [38], [41], [45], [46], [47], [50], [56], [58], [63] [2018-12-03 17:14:57,049 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:57,049 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:57,075 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:14:57,075 INFO L272 AbstractInterpreter]: Visited 12 different actions 54 times. Merged at 9 different actions 34 times. Widened at 3 different actions 5 times. Found 9 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 17:14:57,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:57,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:14:57,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:57,110 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:14:57,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:57,127 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:57,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:57,662 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-12-03 17:14:58,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:58,602 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:59,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:59,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 17:14:59,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 8] total 16 [2018-12-03 17:14:59,546 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:59,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:14:59,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:14:59,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:14:59,547 INFO L87 Difference]: Start difference. First operand 579 states and 1023 transitions. Second operand 7 states. [2018-12-03 17:15:00,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:00,113 INFO L93 Difference]: Finished difference Result 1002 states and 1771 transitions. [2018-12-03 17:15:00,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 17:15:00,116 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-12-03 17:15:00,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:00,120 INFO L225 Difference]: With dead ends: 1002 [2018-12-03 17:15:00,120 INFO L226 Difference]: Without dead ends: 700 [2018-12-03 17:15:00,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:15:00,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2018-12-03 17:15:00,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 653. [2018-12-03 17:15:00,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2018-12-03 17:15:00,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 1143 transitions. [2018-12-03 17:15:00,298 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 1143 transitions. Word has length 13 [2018-12-03 17:15:00,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:00,298 INFO L480 AbstractCegarLoop]: Abstraction has 653 states and 1143 transitions. [2018-12-03 17:15:00,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:15:00,298 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 1143 transitions. [2018-12-03 17:15:00,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 17:15:00,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:00,299 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:00,299 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:00,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:00,299 INFO L82 PathProgramCache]: Analyzing trace with hash 2129075237, now seen corresponding path program 1 times [2018-12-03 17:15:00,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:00,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:00,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:00,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:00,300 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:00,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:00,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:00,393 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:00,393 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 17:15:00,393 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [11], [14], [20], [21], [22], [25], [45], [47], [52] [2018-12-03 17:15:00,394 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:00,394 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:00,400 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:15:00,401 INFO L272 AbstractInterpreter]: Visited 12 different actions 23 times. Merged at 8 different actions 9 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 17:15:00,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:00,402 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:15:00,413 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 42.42% of their original sizes. [2018-12-03 17:15:00,413 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:15:00,584 INFO L418 sIntCurrentIteration]: We unified 12 AI predicates to 12 [2018-12-03 17:15:00,584 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:15:00,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:15:00,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 20 [2018-12-03 17:15:00,584 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:00,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 17:15:00,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 17:15:00,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-12-03 17:15:00,585 INFO L87 Difference]: Start difference. First operand 653 states and 1143 transitions. Second operand 14 states. [2018-12-03 17:15:02,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:02,271 INFO L93 Difference]: Finished difference Result 1070 states and 1888 transitions. [2018-12-03 17:15:02,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 17:15:02,271 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-12-03 17:15:02,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:02,274 INFO L225 Difference]: With dead ends: 1070 [2018-12-03 17:15:02,274 INFO L226 Difference]: Without dead ends: 768 [2018-12-03 17:15:02,275 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:15:02,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2018-12-03 17:15:02,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 641. [2018-12-03 17:15:02,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2018-12-03 17:15:02,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1115 transitions. [2018-12-03 17:15:02,448 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1115 transitions. Word has length 13 [2018-12-03 17:15:02,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:02,448 INFO L480 AbstractCegarLoop]: Abstraction has 641 states and 1115 transitions. [2018-12-03 17:15:02,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 17:15:02,449 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1115 transitions. [2018-12-03 17:15:02,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 17:15:02,449 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:02,449 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:02,450 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:02,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:02,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1086284228, now seen corresponding path program 1 times [2018-12-03 17:15:02,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:02,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:02,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:02,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:02,451 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:02,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:02,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:02,565 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:02,565 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 17:15:02,565 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [11], [14], [20], [22], [27], [29], [32], [45], [46], [65], [67], [72] [2018-12-03 17:15:02,566 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:02,566 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:02,601 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:15:02,602 INFO L272 AbstractInterpreter]: Visited 15 different actions 82 times. Merged at 13 different actions 56 times. Widened at 3 different actions 9 times. Found 12 fixpoints after 8 different actions. Largest state had 0 variables. [2018-12-03 17:15:02,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:02,606 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:15:02,618 INFO L227 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 28.12% of their original sizes. [2018-12-03 17:15:02,618 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:15:02,923 INFO L418 sIntCurrentIteration]: We unified 14 AI predicates to 14 [2018-12-03 17:15:02,923 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:15:02,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:15:02,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [10] total 23 [2018-12-03 17:15:02,924 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:02,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:15:02,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:15:02,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:15:02,925 INFO L87 Difference]: Start difference. First operand 641 states and 1115 transitions. Second operand 15 states. [2018-12-03 17:15:06,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:06,665 INFO L93 Difference]: Finished difference Result 1666 states and 2973 transitions. [2018-12-03 17:15:06,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 17:15:06,666 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-12-03 17:15:06,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:06,670 INFO L225 Difference]: With dead ends: 1666 [2018-12-03 17:15:06,670 INFO L226 Difference]: Without dead ends: 1270 [2018-12-03 17:15:06,672 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 17:15:06,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2018-12-03 17:15:06,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 962. [2018-12-03 17:15:06,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2018-12-03 17:15:06,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1659 transitions. [2018-12-03 17:15:06,973 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1659 transitions. Word has length 15 [2018-12-03 17:15:06,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:06,974 INFO L480 AbstractCegarLoop]: Abstraction has 962 states and 1659 transitions. [2018-12-03 17:15:06,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:15:06,974 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1659 transitions. [2018-12-03 17:15:06,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 17:15:06,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:06,975 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:06,975 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:06,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:06,975 INFO L82 PathProgramCache]: Analyzing trace with hash -750529310, now seen corresponding path program 1 times [2018-12-03 17:15:06,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:06,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:06,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:06,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:06,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:07,143 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:07,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:07,143 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:07,144 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 17:15:07,144 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [38], [41], [56], [57], [58], [63], [65], [67], [70] [2018-12-03 17:15:07,145 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:07,145 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:07,165 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:15:07,165 INFO L272 AbstractInterpreter]: Visited 12 different actions 54 times. Merged at 8 different actions 32 times. Widened at 2 different actions 5 times. Found 8 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 17:15:07,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:07,166 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:15:07,177 INFO L227 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 35.26% of their original sizes. [2018-12-03 17:15:07,177 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:15:07,444 INFO L418 sIntCurrentIteration]: We unified 14 AI predicates to 14 [2018-12-03 17:15:07,445 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:15:07,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:15:07,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [9] total 23 [2018-12-03 17:15:07,445 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:07,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 17:15:07,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 17:15:07,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:15:07,446 INFO L87 Difference]: Start difference. First operand 962 states and 1659 transitions. Second operand 16 states. [2018-12-03 17:15:11,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:11,053 INFO L93 Difference]: Finished difference Result 1558 states and 2741 transitions. [2018-12-03 17:15:11,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 17:15:11,053 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-12-03 17:15:11,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:11,058 INFO L225 Difference]: With dead ends: 1558 [2018-12-03 17:15:11,058 INFO L226 Difference]: Without dead ends: 1333 [2018-12-03 17:15:11,059 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 17:15:11,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2018-12-03 17:15:11,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1196. [2018-12-03 17:15:11,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1196 states. [2018-12-03 17:15:11,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 2064 transitions. [2018-12-03 17:15:11,411 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 2064 transitions. Word has length 15 [2018-12-03 17:15:11,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:11,412 INFO L480 AbstractCegarLoop]: Abstraction has 1196 states and 2064 transitions. [2018-12-03 17:15:11,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 17:15:11,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 2064 transitions. [2018-12-03 17:15:11,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 17:15:11,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:11,413 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:11,413 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:11,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:11,414 INFO L82 PathProgramCache]: Analyzing trace with hash -502879080, now seen corresponding path program 1 times [2018-12-03 17:15:11,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:11,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:11,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:11,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:11,414 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:11,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:11,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:11,500 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:11,501 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 17:15:11,501 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [29], [32], [38], [41], [56], [57], [58], [61], [65], [67], [72] [2018-12-03 17:15:11,501 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:11,502 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:11,531 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:15:11,531 INFO L272 AbstractInterpreter]: Visited 14 different actions 70 times. Merged at 8 different actions 43 times. Widened at 3 different actions 6 times. Found 10 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 17:15:11,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:11,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:15:11,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:11,535 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:15:11,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:11,544 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:11,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:11,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:11,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:11,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:11,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 17:15:11,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 17 [2018-12-03 17:15:11,745 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:11,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:15:11,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:15:11,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:15:11,746 INFO L87 Difference]: Start difference. First operand 1196 states and 2064 transitions. Second operand 7 states. [2018-12-03 17:15:14,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:14,132 INFO L93 Difference]: Finished difference Result 2572 states and 4421 transitions. [2018-12-03 17:15:14,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:15:14,132 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-03 17:15:14,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:14,138 INFO L225 Difference]: With dead ends: 2572 [2018-12-03 17:15:14,139 INFO L226 Difference]: Without dead ends: 1818 [2018-12-03 17:15:14,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:15:14,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2018-12-03 17:15:14,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 1444. [2018-12-03 17:15:14,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1444 states. [2018-12-03 17:15:14,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 2493 transitions. [2018-12-03 17:15:14,599 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 2493 transitions. Word has length 15 [2018-12-03 17:15:14,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:14,599 INFO L480 AbstractCegarLoop]: Abstraction has 1444 states and 2493 transitions. [2018-12-03 17:15:14,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:15:14,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 2493 transitions. [2018-12-03 17:15:14,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 17:15:14,601 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:14,601 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:14,601 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:14,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:14,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1511389740, now seen corresponding path program 1 times [2018-12-03 17:15:14,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:14,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:14,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:14,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:14,602 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:14,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:14,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:14,702 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:14,702 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 17:15:14,703 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [20], [21], [38], [41], [56], [58], [63], [65], [67], [72] [2018-12-03 17:15:14,704 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:14,704 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:14,728 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:15:14,729 INFO L272 AbstractInterpreter]: Visited 13 different actions 50 times. Merged at 9 different actions 33 times. Widened at 1 different actions 2 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 17:15:14,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:14,734 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:15:14,750 INFO L227 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 36.86% of their original sizes. [2018-12-03 17:15:14,750 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:15:15,072 INFO L418 sIntCurrentIteration]: We unified 14 AI predicates to 14 [2018-12-03 17:15:15,073 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:15:15,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:15:15,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [9] total 23 [2018-12-03 17:15:15,073 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:15,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 17:15:15,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 17:15:15,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:15:15,074 INFO L87 Difference]: Start difference. First operand 1444 states and 2493 transitions. Second operand 16 states. [2018-12-03 17:15:18,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:18,344 INFO L93 Difference]: Finished difference Result 1738 states and 3013 transitions. [2018-12-03 17:15:18,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:15:18,345 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-12-03 17:15:18,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:18,352 INFO L225 Difference]: With dead ends: 1738 [2018-12-03 17:15:18,352 INFO L226 Difference]: Without dead ends: 1734 [2018-12-03 17:15:18,354 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:15:18,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2018-12-03 17:15:18,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1453. [2018-12-03 17:15:18,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1453 states. [2018-12-03 17:15:18,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2504 transitions. [2018-12-03 17:15:18,823 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2504 transitions. Word has length 15 [2018-12-03 17:15:18,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:18,823 INFO L480 AbstractCegarLoop]: Abstraction has 1453 states and 2504 transitions. [2018-12-03 17:15:18,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 17:15:18,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2504 transitions. [2018-12-03 17:15:18,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 17:15:18,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:18,824 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:18,825 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:18,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:18,825 INFO L82 PathProgramCache]: Analyzing trace with hash -708189250, now seen corresponding path program 1 times [2018-12-03 17:15:18,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:18,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:18,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:18,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:18,826 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:18,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:18,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:18,993 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:18,993 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 17:15:18,993 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [11], [14], [20], [21], [38], [41], [45], [47], [52], [56], [58], [63] [2018-12-03 17:15:18,995 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:18,995 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:19,019 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:15:19,019 INFO L272 AbstractInterpreter]: Visited 15 different actions 72 times. Merged at 13 different actions 48 times. Widened at 3 different actions 6 times. Found 10 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 17:15:19,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:19,023 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:15:19,035 INFO L227 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 28.12% of their original sizes. [2018-12-03 17:15:19,036 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:15:19,316 INFO L418 sIntCurrentIteration]: We unified 14 AI predicates to 14 [2018-12-03 17:15:19,316 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:15:19,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:15:19,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [9] total 22 [2018-12-03 17:15:19,316 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:19,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:15:19,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:15:19,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:15:19,317 INFO L87 Difference]: Start difference. First operand 1453 states and 2504 transitions. Second operand 15 states. [2018-12-03 17:15:23,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:23,458 INFO L93 Difference]: Finished difference Result 3431 states and 5974 transitions. [2018-12-03 17:15:23,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 17:15:23,458 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-12-03 17:15:23,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:23,466 INFO L225 Difference]: With dead ends: 3431 [2018-12-03 17:15:23,466 INFO L226 Difference]: Without dead ends: 2538 [2018-12-03 17:15:23,468 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 17:15:23,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2018-12-03 17:15:24,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 1913. [2018-12-03 17:15:24,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1913 states. [2018-12-03 17:15:24,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1913 states and 3272 transitions. [2018-12-03 17:15:24,060 INFO L78 Accepts]: Start accepts. Automaton has 1913 states and 3272 transitions. Word has length 15 [2018-12-03 17:15:24,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:24,060 INFO L480 AbstractCegarLoop]: Abstraction has 1913 states and 3272 transitions. [2018-12-03 17:15:24,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:15:24,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 3272 transitions. [2018-12-03 17:15:24,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:15:24,061 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:24,061 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:24,061 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:24,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:24,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1561364208, now seen corresponding path program 1 times [2018-12-03 17:15:24,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:24,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:24,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:24,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:24,062 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:24,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:24,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:24,134 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:24,134 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:15:24,134 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [20], [22], [25], [29], [32], [56], [58], [61], [65], [66], [67], [70] [2018-12-03 17:15:24,135 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:24,135 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:24,157 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:15:24,157 INFO L272 AbstractInterpreter]: Visited 15 different actions 50 times. Merged at 8 different actions 24 times. Widened at 1 different actions 4 times. Found 10 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 17:15:24,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:24,190 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:15:24,204 INFO L227 lantSequenceWeakener]: Weakened 14 states. On average, predicates are now at 36.9% of their original sizes. [2018-12-03 17:15:24,204 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:15:24,579 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 17:15:24,580 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:15:24,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:15:24,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 23 [2018-12-03 17:15:24,580 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:24,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 17:15:24,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 17:15:24,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:15:24,581 INFO L87 Difference]: Start difference. First operand 1913 states and 3272 transitions. Second operand 17 states. [2018-12-03 17:15:28,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:28,006 INFO L93 Difference]: Finished difference Result 2210 states and 3802 transitions. [2018-12-03 17:15:28,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 17:15:28,006 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 17:15:28,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:28,013 INFO L225 Difference]: With dead ends: 2210 [2018-12-03 17:15:28,013 INFO L226 Difference]: Without dead ends: 2208 [2018-12-03 17:15:28,014 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=172, Invalid=950, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:15:28,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2018-12-03 17:15:28,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 1952. [2018-12-03 17:15:28,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1952 states. [2018-12-03 17:15:28,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 3332 transitions. [2018-12-03 17:15:28,615 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 3332 transitions. Word has length 16 [2018-12-03 17:15:28,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:28,616 INFO L480 AbstractCegarLoop]: Abstraction has 1952 states and 3332 transitions. [2018-12-03 17:15:28,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 17:15:28,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 3332 transitions. [2018-12-03 17:15:28,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:15:28,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:28,617 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:28,617 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:28,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:28,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1561364496, now seen corresponding path program 1 times [2018-12-03 17:15:28,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:28,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:28,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:28,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:28,618 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:28,940 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:28,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:28,940 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:28,940 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:15:28,941 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [20], [22], [25], [29], [32], [56], [57], [58], [61], [65], [67], [70] [2018-12-03 17:15:28,942 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:28,942 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:28,960 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:15:28,960 INFO L272 AbstractInterpreter]: Visited 15 different actions 50 times. Merged at 9 different actions 26 times. Widened at 1 different actions 4 times. Found 11 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 17:15:28,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:28,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:15:28,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:28,962 INFO L192 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 [2018-12-03 17:15:28,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:28,970 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:28,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:29,026 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:29,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:29,125 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:29,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:29,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-12-03 17:15:29,146 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:29,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:15:29,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:15:29,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-03 17:15:29,147 INFO L87 Difference]: Start difference. First operand 1952 states and 3332 transitions. Second operand 11 states. [2018-12-03 17:15:31,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:31,275 INFO L93 Difference]: Finished difference Result 2499 states and 4264 transitions. [2018-12-03 17:15:31,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 17:15:31,275 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-12-03 17:15:31,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:31,285 INFO L225 Difference]: With dead ends: 2499 [2018-12-03 17:15:31,285 INFO L226 Difference]: Without dead ends: 2495 [2018-12-03 17:15:31,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=211, Invalid=781, Unknown=0, NotChecked=0, Total=992 [2018-12-03 17:15:31,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2018-12-03 17:15:31,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2002. [2018-12-03 17:15:31,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2002 states. [2018-12-03 17:15:31,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 3413 transitions. [2018-12-03 17:15:31,999 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 3413 transitions. Word has length 16 [2018-12-03 17:15:31,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:32,000 INFO L480 AbstractCegarLoop]: Abstraction has 2002 states and 3413 transitions. [2018-12-03 17:15:32,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:15:32,000 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 3413 transitions. [2018-12-03 17:15:32,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:15:32,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:32,001 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:32,001 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:32,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:32,002 INFO L82 PathProgramCache]: Analyzing trace with hash -767610290, now seen corresponding path program 2 times [2018-12-03 17:15:32,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:32,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:32,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:32,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:32,003 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:32,249 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:32,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:32,250 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:32,250 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:32,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:15:32,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:32,251 INFO L192 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 [2018-12-03 17:15:32,260 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:15:32,260 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:15:32,268 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 17:15:32,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:15:32,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:32,363 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:32,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:32,445 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:32,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:32,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2018-12-03 17:15:32,465 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:32,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:15:32,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:15:32,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:15:32,466 INFO L87 Difference]: Start difference. First operand 2002 states and 3413 transitions. Second operand 13 states. [2018-12-03 17:15:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:34,119 INFO L93 Difference]: Finished difference Result 2167 states and 3672 transitions. [2018-12-03 17:15:34,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 17:15:34,119 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-12-03 17:15:34,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:34,125 INFO L225 Difference]: With dead ends: 2167 [2018-12-03 17:15:34,125 INFO L226 Difference]: Without dead ends: 2166 [2018-12-03 17:15:34,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:15:34,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2018-12-03 17:15:34,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 1993. [2018-12-03 17:15:34,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1993 states. [2018-12-03 17:15:34,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 3397 transitions. [2018-12-03 17:15:34,772 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 3397 transitions. Word has length 16 [2018-12-03 17:15:34,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:34,772 INFO L480 AbstractCegarLoop]: Abstraction has 1993 states and 3397 transitions. [2018-12-03 17:15:34,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:15:34,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 3397 transitions. [2018-12-03 17:15:34,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:15:34,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:34,773 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:34,773 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:34,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:34,774 INFO L82 PathProgramCache]: Analyzing trace with hash -767609008, now seen corresponding path program 1 times [2018-12-03 17:15:34,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:34,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:34,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:15:34,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:34,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:34,867 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:34,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:34,867 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:34,867 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:15:34,868 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [29], [32], [45], [46], [56], [58], [61], [63], [65], [67], [70] [2018-12-03 17:15:34,869 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:34,869 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:34,885 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:15:34,885 INFO L272 AbstractInterpreter]: Visited 14 different actions 51 times. Merged at 8 different actions 28 times. Widened at 1 different actions 3 times. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 17:15:34,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:34,888 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:15:34,899 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 38.89% of their original sizes. [2018-12-03 17:15:34,899 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:15:35,187 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 17:15:35,188 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:15:35,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:15:35,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [7] total 22 [2018-12-03 17:15:35,188 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:35,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 17:15:35,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 17:15:35,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:15:35,189 INFO L87 Difference]: Start difference. First operand 1993 states and 3397 transitions. Second operand 17 states. [2018-12-03 17:15:38,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:38,211 INFO L93 Difference]: Finished difference Result 2212 states and 3788 transitions. [2018-12-03 17:15:38,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 17:15:38,211 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 17:15:38,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:38,216 INFO L225 Difference]: With dead ends: 2212 [2018-12-03 17:15:38,216 INFO L226 Difference]: Without dead ends: 2210 [2018-12-03 17:15:38,217 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=177, Invalid=815, Unknown=0, NotChecked=0, Total=992 [2018-12-03 17:15:38,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2210 states. [2018-12-03 17:15:38,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2210 to 2011. [2018-12-03 17:15:38,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2011 states. [2018-12-03 17:15:38,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 2011 states and 3427 transitions. [2018-12-03 17:15:38,912 INFO L78 Accepts]: Start accepts. Automaton has 2011 states and 3427 transitions. Word has length 16 [2018-12-03 17:15:38,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:38,912 INFO L480 AbstractCegarLoop]: Abstraction has 2011 states and 3427 transitions. [2018-12-03 17:15:38,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 17:15:38,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 3427 transitions. [2018-12-03 17:15:38,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:15:38,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:38,914 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:38,914 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:38,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:38,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1823107031, now seen corresponding path program 2 times [2018-12-03 17:15:38,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:38,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:38,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:38,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:38,915 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:38,996 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:38,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:38,996 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:38,996 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:38,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:15:38,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:38,996 INFO L192 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 [2018-12-03 17:15:39,005 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:15:39,005 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:15:39,012 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 17:15:39,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:15:39,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:39,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:39,097 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:39,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:39,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-12-03 17:15:39,118 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:39,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:15:39,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:15:39,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-03 17:15:39,119 INFO L87 Difference]: Start difference. First operand 2011 states and 3427 transitions. Second operand 11 states. [2018-12-03 17:15:41,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:41,234 INFO L93 Difference]: Finished difference Result 2648 states and 4535 transitions. [2018-12-03 17:15:41,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 17:15:41,235 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-12-03 17:15:41,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:41,239 INFO L225 Difference]: With dead ends: 2648 [2018-12-03 17:15:41,239 INFO L226 Difference]: Without dead ends: 2644 [2018-12-03 17:15:41,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=781, Unknown=0, NotChecked=0, Total=992 [2018-12-03 17:15:41,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2644 states. [2018-12-03 17:15:42,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2644 to 2109. [2018-12-03 17:15:42,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2109 states. [2018-12-03 17:15:42,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 3587 transitions. [2018-12-03 17:15:42,052 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 3587 transitions. Word has length 16 [2018-12-03 17:15:42,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:42,052 INFO L480 AbstractCegarLoop]: Abstraction has 2109 states and 3587 transitions. [2018-12-03 17:15:42,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:15:42,052 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 3587 transitions. [2018-12-03 17:15:42,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:15:42,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:42,053 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:42,054 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:42,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:42,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1823106549, now seen corresponding path program 1 times [2018-12-03 17:15:42,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:42,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:42,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:15:42,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:42,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:42,145 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:42,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:42,146 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:42,146 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:15:42,146 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [20], [21], [38], [41], [56], [58], [61], [65], [67], [70], [72] [2018-12-03 17:15:42,147 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:42,147 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:42,163 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:15:42,163 INFO L272 AbstractInterpreter]: Visited 14 different actions 53 times. Merged at 8 different actions 29 times. Widened at 1 different actions 4 times. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 17:15:42,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:42,173 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:15:42,185 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 38.89% of their original sizes. [2018-12-03 17:15:42,186 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:15:42,505 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 17:15:42,505 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:15:42,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:15:42,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [7] total 22 [2018-12-03 17:15:42,505 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:42,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 17:15:42,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 17:15:42,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:15:42,506 INFO L87 Difference]: Start difference. First operand 2109 states and 3587 transitions. Second operand 17 states. [2018-12-03 17:15:45,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:45,474 INFO L93 Difference]: Finished difference Result 2311 states and 3957 transitions. [2018-12-03 17:15:45,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 17:15:45,474 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 17:15:45,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:45,478 INFO L225 Difference]: With dead ends: 2311 [2018-12-03 17:15:45,478 INFO L226 Difference]: Without dead ends: 2309 [2018-12-03 17:15:45,479 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=177, Invalid=815, Unknown=0, NotChecked=0, Total=992 [2018-12-03 17:15:45,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2018-12-03 17:15:46,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 2115. [2018-12-03 17:15:46,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2115 states. [2018-12-03 17:15:46,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 3595 transitions. [2018-12-03 17:15:46,283 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 3595 transitions. Word has length 16 [2018-12-03 17:15:46,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:46,283 INFO L480 AbstractCegarLoop]: Abstraction has 2115 states and 3595 transitions. [2018-12-03 17:15:46,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 17:15:46,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 3595 transitions. [2018-12-03 17:15:46,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:15:46,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:46,285 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:46,285 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:46,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:46,286 INFO L82 PathProgramCache]: Analyzing trace with hash 362530779, now seen corresponding path program 1 times [2018-12-03 17:15:46,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:46,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:46,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:46,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:46,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:46,510 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:46,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:46,510 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:46,510 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:15:46,511 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [38], [41], [45], [47], [50], [56], [57], [58], [61], [65], [67], [70] [2018-12-03 17:15:46,511 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:46,511 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:46,527 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:15:46,527 INFO L272 AbstractInterpreter]: Visited 15 different actions 50 times. Merged at 9 different actions 24 times. Widened at 1 different actions 3 times. Found 10 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 17:15:46,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:46,529 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:15:46,540 INFO L227 lantSequenceWeakener]: Weakened 14 states. On average, predicates are now at 36.9% of their original sizes. [2018-12-03 17:15:46,540 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:15:46,851 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 17:15:46,851 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:15:46,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:15:46,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 23 [2018-12-03 17:15:46,851 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:46,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 17:15:46,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 17:15:46,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:15:46,852 INFO L87 Difference]: Start difference. First operand 2115 states and 3595 transitions. Second operand 17 states. [2018-12-03 17:15:50,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:50,763 INFO L93 Difference]: Finished difference Result 2438 states and 4180 transitions. [2018-12-03 17:15:50,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 17:15:50,763 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 17:15:50,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:50,767 INFO L225 Difference]: With dead ends: 2438 [2018-12-03 17:15:50,768 INFO L226 Difference]: Without dead ends: 2436 [2018-12-03 17:15:50,769 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=950, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:15:50,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2018-12-03 17:15:51,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 2142. [2018-12-03 17:15:51,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2142 states. [2018-12-03 17:15:51,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 3640 transitions. [2018-12-03 17:15:51,679 INFO L78 Accepts]: Start accepts. Automaton has 2142 states and 3640 transitions. Word has length 16 [2018-12-03 17:15:51,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:51,680 INFO L480 AbstractCegarLoop]: Abstraction has 2142 states and 3640 transitions. [2018-12-03 17:15:51,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 17:15:51,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 3640 transitions. [2018-12-03 17:15:51,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:15:51,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:51,681 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:51,681 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:51,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:51,681 INFO L82 PathProgramCache]: Analyzing trace with hash -990864753, now seen corresponding path program 1 times [2018-12-03 17:15:51,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:51,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:51,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:51,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:51,682 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:52,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:52,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:52,381 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:52,381 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 17:15:52,381 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [11], [14], [20], [22], [25], [27], [29], [32], [45], [46], [65], [67], [72] [2018-12-03 17:15:52,382 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:52,382 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:52,409 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:15:52,410 INFO L272 AbstractInterpreter]: Visited 16 different actions 74 times. Merged at 14 different actions 45 times. Widened at 3 different actions 4 times. Found 15 fixpoints after 8 different actions. Largest state had 0 variables. [2018-12-03 17:15:52,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:52,411 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:15:52,425 INFO L227 lantSequenceWeakener]: Weakened 14 states. On average, predicates are now at 26.49% of their original sizes. [2018-12-03 17:15:52,426 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:15:52,754 INFO L418 sIntCurrentIteration]: We unified 17 AI predicates to 17 [2018-12-03 17:15:52,755 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:15:52,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:15:52,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [10] total 24 [2018-12-03 17:15:52,755 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:52,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 17:15:52,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 17:15:52,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:15:52,756 INFO L87 Difference]: Start difference. First operand 2142 states and 3640 transitions. Second operand 16 states. [2018-12-03 17:15:58,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:58,412 INFO L93 Difference]: Finished difference Result 5270 states and 9090 transitions. [2018-12-03 17:15:58,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 17:15:58,412 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-12-03 17:15:58,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:58,417 INFO L225 Difference]: With dead ends: 5270 [2018-12-03 17:15:58,417 INFO L226 Difference]: Without dead ends: 4283 [2018-12-03 17:15:58,420 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=571, Invalid=1879, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 17:15:58,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4283 states. [2018-12-03 17:15:59,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4283 to 2504. [2018-12-03 17:15:59,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2018-12-03 17:15:59,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 4237 transitions. [2018-12-03 17:15:59,523 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 4237 transitions. Word has length 18 [2018-12-03 17:15:59,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:59,523 INFO L480 AbstractCegarLoop]: Abstraction has 2504 states and 4237 transitions. [2018-12-03 17:15:59,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 17:15:59,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 4237 transitions. [2018-12-03 17:15:59,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:15:59,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:59,524 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:59,524 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:59,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:59,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1354217275, now seen corresponding path program 1 times [2018-12-03 17:15:59,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:59,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:59,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:59,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:59,526 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:59,590 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:59,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:59,590 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:59,590 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 17:15:59,591 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [29], [32], [38], [41], [56], [58], [61], [63], [65], [66], [67], [70] [2018-12-03 17:15:59,591 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:59,591 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:59,626 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:15:59,627 INFO L272 AbstractInterpreter]: Visited 15 different actions 101 times. Merged at 10 different actions 59 times. Widened at 4 different actions 11 times. Found 24 fixpoints after 7 different actions. Largest state had 0 variables. [2018-12-03 17:15:59,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:59,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:15:59,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:59,631 INFO L192 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 [2018-12-03 17:15:59,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:59,640 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:59,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:59,744 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:59,745 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:59,848 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:59,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:59,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 17 [2018-12-03 17:15:59,868 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:59,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:15:59,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:15:59,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:15:59,869 INFO L87 Difference]: Start difference. First operand 2504 states and 4237 transitions. Second operand 12 states. [2018-12-03 17:16:03,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:03,413 INFO L93 Difference]: Finished difference Result 3235 states and 5405 transitions. [2018-12-03 17:16:03,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 17:16:03,413 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-12-03 17:16:03,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:03,416 INFO L225 Difference]: With dead ends: 3235 [2018-12-03 17:16:03,416 INFO L226 Difference]: Without dead ends: 3233 [2018-12-03 17:16:03,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=292, Invalid=1190, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 17:16:03,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3233 states. [2018-12-03 17:16:04,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3233 to 2463. [2018-12-03 17:16:04,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2463 states. [2018-12-03 17:16:04,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 4165 transitions. [2018-12-03 17:16:04,441 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 4165 transitions. Word has length 18 [2018-12-03 17:16:04,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:04,441 INFO L480 AbstractCegarLoop]: Abstraction has 2463 states and 4165 transitions. [2018-12-03 17:16:04,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:16:04,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 4165 transitions. [2018-12-03 17:16:04,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:16:04,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:04,443 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:04,443 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:04,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:04,444 INFO L82 PathProgramCache]: Analyzing trace with hash 589748198, now seen corresponding path program 1 times [2018-12-03 17:16:04,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:04,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:04,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:04,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:04,445 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:04,542 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:04,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:04,543 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:04,543 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 17:16:04,543 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [20], [21], [38], [41], [56], [58], [63], [65], [67], [70], [72] [2018-12-03 17:16:04,544 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:16:04,544 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:16:04,569 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:16:04,569 INFO L272 AbstractInterpreter]: Visited 14 different actions 63 times. Merged at 10 different actions 39 times. Widened at 2 different actions 5 times. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 17:16:04,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:04,599 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:16:04,613 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 30.83% of their original sizes. [2018-12-03 17:16:04,613 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:16:04,995 INFO L418 sIntCurrentIteration]: We unified 17 AI predicates to 17 [2018-12-03 17:16:04,995 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:16:04,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:16:04,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [9] total 25 [2018-12-03 17:16:04,996 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:16:04,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 17:16:04,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 17:16:04,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:16:04,996 INFO L87 Difference]: Start difference. First operand 2463 states and 4165 transitions. Second operand 18 states. [2018-12-03 17:16:09,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:09,211 INFO L93 Difference]: Finished difference Result 3331 states and 5709 transitions. [2018-12-03 17:16:09,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 17:16:09,212 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-12-03 17:16:09,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:09,214 INFO L225 Difference]: With dead ends: 3331 [2018-12-03 17:16:09,215 INFO L226 Difference]: Without dead ends: 2999 [2018-12-03 17:16:09,216 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=235, Invalid=955, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 17:16:09,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2018-12-03 17:16:10,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 2511. [2018-12-03 17:16:10,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2511 states. [2018-12-03 17:16:10,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2511 states and 4234 transitions. [2018-12-03 17:16:10,294 INFO L78 Accepts]: Start accepts. Automaton has 2511 states and 4234 transitions. Word has length 18 [2018-12-03 17:16:10,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:10,294 INFO L480 AbstractCegarLoop]: Abstraction has 2511 states and 4234 transitions. [2018-12-03 17:16:10,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 17:16:10,295 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 4234 transitions. [2018-12-03 17:16:10,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:16:10,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:10,296 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:10,296 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:10,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:10,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1629830792, now seen corresponding path program 1 times [2018-12-03 17:16:10,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:10,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:10,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:10,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:10,297 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:10,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:10,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:10,444 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:10,444 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 17:16:10,444 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [11], [14], [20], [21], [38], [41], [45], [47], [52], [56], [58], [63], [65], [67], [70] [2018-12-03 17:16:10,446 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:16:10,446 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:16:10,478 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:16:10,479 INFO L272 AbstractInterpreter]: Visited 18 different actions 93 times. Merged at 16 different actions 59 times. Widened at 4 different actions 9 times. Found 17 fixpoints after 8 different actions. Largest state had 0 variables. [2018-12-03 17:16:10,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:10,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:16:10,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:10,492 INFO L192 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 [2018-12-03 17:16:10,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:10,500 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:16:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:10,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:10,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:10,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:10,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:10,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 17:16:10,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 7] total 18 [2018-12-03 17:16:10,783 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:16:10,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:16:10,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:16:10,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:16:10,784 INFO L87 Difference]: Start difference. First operand 2511 states and 4234 transitions. Second operand 7 states. [2018-12-03 17:16:12,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:12,507 INFO L93 Difference]: Finished difference Result 4988 states and 8402 transitions. [2018-12-03 17:16:12,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 17:16:12,508 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-12-03 17:16:12,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:12,511 INFO L225 Difference]: With dead ends: 4988 [2018-12-03 17:16:12,511 INFO L226 Difference]: Without dead ends: 2965 [2018-12-03 17:16:12,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:16:12,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2018-12-03 17:16:13,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2789. [2018-12-03 17:16:13,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2789 states. [2018-12-03 17:16:13,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 4634 transitions. [2018-12-03 17:16:13,729 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 4634 transitions. Word has length 18 [2018-12-03 17:16:13,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:13,730 INFO L480 AbstractCegarLoop]: Abstraction has 2789 states and 4634 transitions. [2018-12-03 17:16:13,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:16:13,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 4634 transitions. [2018-12-03 17:16:13,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:16:13,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:13,731 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:13,731 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:13,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:13,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1537299396, now seen corresponding path program 1 times [2018-12-03 17:16:13,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:13,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:13,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:13,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:13,732 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:14,149 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:14,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:14,150 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:14,150 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 17:16:14,150 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [29], [32], [38], [41], [56], [57], [58], [61], [65], [67], [70], [72] [2018-12-03 17:16:14,151 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:16:14,151 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:16:14,186 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:16:14,186 INFO L272 AbstractInterpreter]: Visited 15 different actions 97 times. Merged at 10 different actions 57 times. Widened at 4 different actions 11 times. Found 23 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 17:16:14,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:14,190 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:16:14,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:14,190 INFO L192 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 [2018-12-03 17:16:14,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:14,199 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:16:14,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:14,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:14,280 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:14,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:14,407 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:14,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:16:14,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 17 [2018-12-03 17:16:14,426 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:16:14,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:16:14,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:16:14,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:16:14,427 INFO L87 Difference]: Start difference. First operand 2789 states and 4634 transitions. Second operand 12 states. [2018-12-03 17:16:18,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:18,092 INFO L93 Difference]: Finished difference Result 3481 states and 5798 transitions. [2018-12-03 17:16:18,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 17:16:18,093 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-12-03 17:16:18,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:18,096 INFO L225 Difference]: With dead ends: 3481 [2018-12-03 17:16:18,097 INFO L226 Difference]: Without dead ends: 3479 [2018-12-03 17:16:18,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=292, Invalid=1190, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 17:16:18,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3479 states. [2018-12-03 17:16:19,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3479 to 2726. [2018-12-03 17:16:19,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2726 states. [2018-12-03 17:16:19,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2726 states and 4526 transitions. [2018-12-03 17:16:19,341 INFO L78 Accepts]: Start accepts. Automaton has 2726 states and 4526 transitions. Word has length 18 [2018-12-03 17:16:19,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:19,341 INFO L480 AbstractCegarLoop]: Abstraction has 2726 states and 4526 transitions. [2018-12-03 17:16:19,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:16:19,341 INFO L276 IsEmpty]: Start isEmpty. Operand 2726 states and 4526 transitions. [2018-12-03 17:16:19,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:16:19,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:19,342 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:19,342 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:19,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:19,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1470626358, now seen corresponding path program 1 times [2018-12-03 17:16:19,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:19,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:19,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:19,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:19,343 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:19,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:19,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:19,587 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:19,587 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 17:16:19,588 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [11], [14], [20], [21], [38], [41], [45], [47], [50], [52], [56], [58], [63] [2018-12-03 17:16:19,589 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:16:19,589 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:16:19,615 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:16:19,615 INFO L272 AbstractInterpreter]: Visited 16 different actions 81 times. Merged at 14 different actions 51 times. Widened at 4 different actions 6 times. Found 15 fixpoints after 8 different actions. Largest state had 0 variables. [2018-12-03 17:16:19,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:19,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:16:19,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:19,620 INFO L192 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 [2018-12-03 17:16:19,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:19,629 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:16:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:19,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:19,702 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:19,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:19,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:19,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 17:16:19,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 7] total 17 [2018-12-03 17:16:19,781 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:16:19,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:16:19,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:16:19,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:16:19,782 INFO L87 Difference]: Start difference. First operand 2726 states and 4526 transitions. Second operand 7 states. [2018-12-03 17:16:21,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:21,393 INFO L93 Difference]: Finished difference Result 5522 states and 9101 transitions. [2018-12-03 17:16:21,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 17:16:21,394 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-12-03 17:16:21,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:21,397 INFO L225 Difference]: With dead ends: 5522 [2018-12-03 17:16:21,397 INFO L226 Difference]: Without dead ends: 3311 [2018-12-03 17:16:21,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:16:21,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3311 states. [2018-12-03 17:16:22,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3311 to 2615. [2018-12-03 17:16:22,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2615 states. [2018-12-03 17:16:22,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2615 states to 2615 states and 4230 transitions. [2018-12-03 17:16:22,581 INFO L78 Accepts]: Start accepts. Automaton has 2615 states and 4230 transitions. Word has length 18 [2018-12-03 17:16:22,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:22,581 INFO L480 AbstractCegarLoop]: Abstraction has 2615 states and 4230 transitions. [2018-12-03 17:16:22,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:16:22,581 INFO L276 IsEmpty]: Start isEmpty. Operand 2615 states and 4230 transitions. [2018-12-03 17:16:22,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 17:16:22,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:22,582 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:22,582 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:22,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:22,583 INFO L82 PathProgramCache]: Analyzing trace with hash -398538747, now seen corresponding path program 1 times [2018-12-03 17:16:22,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:22,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:22,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:22,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:22,584 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:22,690 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:16:22,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:22,690 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:22,690 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 17:16:22,690 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [11], [14], [16], [20], [21], [22], [27], [45], [47], [50], [52] [2018-12-03 17:16:22,691 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:16:22,691 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:16:22,705 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:16:22,705 INFO L272 AbstractInterpreter]: Visited 14 different actions 54 times. Merged at 12 different actions 28 times. Widened at 1 different actions 2 times. Found 14 fixpoints after 7 different actions. Largest state had 0 variables. [2018-12-03 17:16:22,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:22,707 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:16:22,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:22,707 INFO L192 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 [2018-12-03 17:16:22,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:22,716 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:16:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:22,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:22,807 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:16:22,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:22,858 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:16:22,878 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:16:22,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [9] total 18 [2018-12-03 17:16:22,878 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:16:22,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:16:22,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:16:22,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:16:22,879 INFO L87 Difference]: Start difference. First operand 2615 states and 4230 transitions. Second operand 7 states. [2018-12-03 17:16:25,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:25,121 INFO L93 Difference]: Finished difference Result 5139 states and 8297 transitions. [2018-12-03 17:16:25,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:16:25,121 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-12-03 17:16:25,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:25,124 INFO L225 Difference]: With dead ends: 5139 [2018-12-03 17:16:25,124 INFO L226 Difference]: Without dead ends: 3503 [2018-12-03 17:16:25,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:16:25,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3503 states. [2018-12-03 17:16:26,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3503 to 2819. [2018-12-03 17:16:26,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2819 states. [2018-12-03 17:16:26,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2819 states to 2819 states and 4537 transitions. [2018-12-03 17:16:26,530 INFO L78 Accepts]: Start accepts. Automaton has 2819 states and 4537 transitions. Word has length 20 [2018-12-03 17:16:26,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:26,530 INFO L480 AbstractCegarLoop]: Abstraction has 2819 states and 4537 transitions. [2018-12-03 17:16:26,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:16:26,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2819 states and 4537 transitions. [2018-12-03 17:16:26,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 17:16:26,531 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:26,531 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:26,531 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:26,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:26,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1680206499, now seen corresponding path program 1 times [2018-12-03 17:16:26,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:26,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:26,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:26,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:26,533 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:26,649 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:26,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:26,649 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:26,649 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 17:16:26,650 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [11], [16], [20], [21], [29], [32], [45], [47], [52], [56], [58], [63], [65], [67], [70] [2018-12-03 17:16:26,651 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:16:26,651 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:16:26,685 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:16:26,686 INFO L272 AbstractInterpreter]: Visited 18 different actions 96 times. Merged at 16 different actions 62 times. Widened at 5 different actions 8 times. Found 17 fixpoints after 10 different actions. Largest state had 0 variables. [2018-12-03 17:16:26,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:26,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:16:26,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:26,692 INFO L192 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 [2018-12-03 17:16:26,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:26,702 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:16:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:26,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:26,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:16:26,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:26,899 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:16:26,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 17:16:26,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 7] total 19 [2018-12-03 17:16:26,918 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:16:26,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:16:26,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:16:26,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:16:26,919 INFO L87 Difference]: Start difference. First operand 2819 states and 4537 transitions. Second operand 7 states. [2018-12-03 17:16:29,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:29,067 INFO L93 Difference]: Finished difference Result 4306 states and 6962 transitions. [2018-12-03 17:16:29,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:16:29,068 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-12-03 17:16:29,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:29,071 INFO L225 Difference]: With dead ends: 4306 [2018-12-03 17:16:29,071 INFO L226 Difference]: Without dead ends: 3191 [2018-12-03 17:16:29,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:16:29,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3191 states. [2018-12-03 17:16:30,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3191 to 2769. [2018-12-03 17:16:30,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2769 states. [2018-12-03 17:16:30,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2769 states to 2769 states and 4460 transitions. [2018-12-03 17:16:30,512 INFO L78 Accepts]: Start accepts. Automaton has 2769 states and 4460 transitions. Word has length 20 [2018-12-03 17:16:30,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:30,513 INFO L480 AbstractCegarLoop]: Abstraction has 2769 states and 4460 transitions. [2018-12-03 17:16:30,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:16:30,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2769 states and 4460 transitions. [2018-12-03 17:16:30,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 17:16:30,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:30,514 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:30,514 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:30,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:30,514 INFO L82 PathProgramCache]: Analyzing trace with hash -276638985, now seen corresponding path program 1 times [2018-12-03 17:16:30,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:30,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:30,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:30,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:30,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:30,603 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:30,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:30,604 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:30,604 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 17:16:30,605 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [29], [32], [56], [57], [58], [61], [65], [67], [72] [2018-12-03 17:16:30,606 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:16:30,606 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:16:30,633 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:16:30,633 INFO L272 AbstractInterpreter]: Visited 12 different actions 55 times. Merged at 9 different actions 35 times. Widened at 3 different actions 5 times. Found 9 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 17:16:30,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:30,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:16:30,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:30,643 INFO L192 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 [2018-12-03 17:16:30,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:30,653 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:16:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:30,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:30,895 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:16:30,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:31,112 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:16:31,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 17:16:31,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 7] total 18 [2018-12-03 17:16:31,135 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:16:31,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:16:31,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:16:31,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:16:31,135 INFO L87 Difference]: Start difference. First operand 2769 states and 4460 transitions. Second operand 7 states. [2018-12-03 17:16:33,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:33,363 INFO L93 Difference]: Finished difference Result 5471 states and 8809 transitions. [2018-12-03 17:16:33,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 17:16:33,363 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-12-03 17:16:33,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:33,366 INFO L225 Difference]: With dead ends: 5471 [2018-12-03 17:16:33,366 INFO L226 Difference]: Without dead ends: 3298 [2018-12-03 17:16:33,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:16:33,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3298 states. [2018-12-03 17:16:34,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3298 to 3096. [2018-12-03 17:16:34,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3096 states. [2018-12-03 17:16:34,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 3096 states and 4921 transitions. [2018-12-03 17:16:34,878 INFO L78 Accepts]: Start accepts. Automaton has 3096 states and 4921 transitions. Word has length 20 [2018-12-03 17:16:34,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:34,878 INFO L480 AbstractCegarLoop]: Abstraction has 3096 states and 4921 transitions. [2018-12-03 17:16:34,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:16:34,879 INFO L276 IsEmpty]: Start isEmpty. Operand 3096 states and 4921 transitions. [2018-12-03 17:16:34,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 17:16:34,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:34,880 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:34,881 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:34,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:34,881 INFO L82 PathProgramCache]: Analyzing trace with hash -627995389, now seen corresponding path program 1 times [2018-12-03 17:16:34,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:34,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:34,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:34,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:34,882 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:34,996 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:34,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:34,996 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:34,996 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 17:16:34,997 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [11], [16], [20], [21], [29], [32], [45], [47], [50], [52], [56], [58], [63] [2018-12-03 17:16:34,997 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:16:34,997 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:16:35,021 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:16:35,021 INFO L272 AbstractInterpreter]: Visited 16 different actions 78 times. Merged at 14 different actions 48 times. Widened at 4 different actions 4 times. Found 15 fixpoints after 8 different actions. Largest state had 0 variables. [2018-12-03 17:16:35,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:35,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:16:35,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:35,026 INFO L192 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 [2018-12-03 17:16:35,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:35,034 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:16:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:35,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:35,138 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:16:35,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:35,210 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:16:35,230 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:16:35,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [9] total 19 [2018-12-03 17:16:35,230 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:16:35,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:16:35,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:16:35,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:16:35,231 INFO L87 Difference]: Start difference. First operand 3096 states and 4921 transitions. Second operand 7 states. [2018-12-03 17:16:37,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:37,443 INFO L93 Difference]: Finished difference Result 5347 states and 8479 transitions. [2018-12-03 17:16:37,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:16:37,443 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-12-03 17:16:37,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:37,446 INFO L225 Difference]: With dead ends: 5347 [2018-12-03 17:16:37,446 INFO L226 Difference]: Without dead ends: 3536 [2018-12-03 17:16:37,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:16:37,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3536 states. [2018-12-03 17:16:38,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3536 to 3199. [2018-12-03 17:16:38,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3199 states. [2018-12-03 17:16:39,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3199 states to 3199 states and 5073 transitions. [2018-12-03 17:16:39,003 INFO L78 Accepts]: Start accepts. Automaton has 3199 states and 5073 transitions. Word has length 20 [2018-12-03 17:16:39,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:39,003 INFO L480 AbstractCegarLoop]: Abstraction has 3199 states and 5073 transitions. [2018-12-03 17:16:39,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:16:39,003 INFO L276 IsEmpty]: Start isEmpty. Operand 3199 states and 5073 transitions. [2018-12-03 17:16:39,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 17:16:39,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:39,004 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:39,004 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:39,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:39,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1958649716, now seen corresponding path program 1 times [2018-12-03 17:16:39,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:39,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:39,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:39,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:39,006 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:39,102 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:39,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:39,103 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:39,103 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-03 17:16:39,103 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [29], [32], [56], [57], [58], [61], [65], [67], [70], [72] [2018-12-03 17:16:39,103 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:16:39,104 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:16:39,124 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:16:39,124 INFO L272 AbstractInterpreter]: Visited 13 different actions 57 times. Merged at 9 different actions 33 times. Widened at 2 different actions 4 times. Found 13 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 17:16:39,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:39,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:16:39,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:39,130 INFO L192 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 [2018-12-03 17:16:39,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:39,138 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:16:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:39,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:39,289 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:39,289 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:39,417 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:39,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:16:39,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2018-12-03 17:16:39,437 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:16:39,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 17:16:39,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 17:16:39,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:16:39,438 INFO L87 Difference]: Start difference. First operand 3199 states and 5073 transitions. Second operand 17 states. [2018-12-03 17:16:43,167 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2018-12-03 17:16:48,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:48,550 INFO L93 Difference]: Finished difference Result 4574 states and 7305 transitions. [2018-12-03 17:16:48,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 17:16:48,550 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2018-12-03 17:16:48,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:48,554 INFO L225 Difference]: With dead ends: 4574 [2018-12-03 17:16:48,555 INFO L226 Difference]: Without dead ends: 4540 [2018-12-03 17:16:48,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4620 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2307, Invalid=11499, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 17:16:48,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4540 states. [2018-12-03 17:16:50,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4540 to 3377. [2018-12-03 17:16:50,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3377 states. [2018-12-03 17:16:50,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3377 states to 3377 states and 5379 transitions. [2018-12-03 17:16:50,321 INFO L78 Accepts]: Start accepts. Automaton has 3377 states and 5379 transitions. Word has length 21 [2018-12-03 17:16:50,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:50,322 INFO L480 AbstractCegarLoop]: Abstraction has 3377 states and 5379 transitions. [2018-12-03 17:16:50,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 17:16:50,322 INFO L276 IsEmpty]: Start isEmpty. Operand 3377 states and 5379 transitions. [2018-12-03 17:16:50,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 17:16:50,323 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:50,323 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:50,323 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:50,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:50,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1950061547, now seen corresponding path program 1 times [2018-12-03 17:16:50,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:50,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:50,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:50,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:50,324 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:50,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:50,469 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:16:50,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:50,469 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:50,469 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-03 17:16:50,469 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [29], [32], [56], [58], [61], [65], [66], [67], [70], [72] [2018-12-03 17:16:50,470 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:16:50,470 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:16:50,493 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:16:50,493 INFO L272 AbstractInterpreter]: Visited 13 different actions 59 times. Merged at 9 different actions 32 times. Widened at 3 different actions 5 times. Found 13 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 17:16:50,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:50,495 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:16:50,510 INFO L227 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 33.33% of their original sizes. [2018-12-03 17:16:50,511 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:16:50,856 INFO L418 sIntCurrentIteration]: We unified 20 AI predicates to 20 [2018-12-03 17:16:50,856 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:16:50,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:16:50,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [11] total 27 [2018-12-03 17:16:50,857 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:16:50,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 17:16:50,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 17:16:50,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:16:50,858 INFO L87 Difference]: Start difference. First operand 3377 states and 5379 transitions. Second operand 18 states. [2018-12-03 17:16:55,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:55,215 INFO L93 Difference]: Finished difference Result 3586 states and 5702 transitions. [2018-12-03 17:16:55,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 17:16:55,215 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-12-03 17:16:55,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:55,218 INFO L225 Difference]: With dead ends: 3586 [2018-12-03 17:16:55,218 INFO L226 Difference]: Without dead ends: 3584 [2018-12-03 17:16:55,219 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=191, Invalid=931, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:16:55,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3584 states. [2018-12-03 17:16:56,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3584 to 3396. [2018-12-03 17:16:56,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3396 states. [2018-12-03 17:16:56,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 3396 states and 5411 transitions. [2018-12-03 17:16:56,956 INFO L78 Accepts]: Start accepts. Automaton has 3396 states and 5411 transitions. Word has length 21 [2018-12-03 17:16:56,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:56,956 INFO L480 AbstractCegarLoop]: Abstraction has 3396 states and 5411 transitions. [2018-12-03 17:16:56,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 17:16:56,956 INFO L276 IsEmpty]: Start isEmpty. Operand 3396 states and 5411 transitions. [2018-12-03 17:16:56,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 17:16:56,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:56,957 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:56,957 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:56,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:56,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1950062829, now seen corresponding path program 1 times [2018-12-03 17:16:56,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:56,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:56,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:56,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:56,958 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:57,060 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:57,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:57,061 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:57,061 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-03 17:16:57,061 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [29], [32], [45], [46], [56], [58], [61], [63], [65], [67], [70], [72] [2018-12-03 17:16:57,062 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:16:57,062 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:16:57,081 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:16:57,082 INFO L272 AbstractInterpreter]: Visited 15 different actions 66 times. Merged at 10 different actions 38 times. Widened at 2 different actions 4 times. Found 13 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 17:16:57,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:57,083 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:16:57,095 INFO L227 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 33.33% of their original sizes. [2018-12-03 17:16:57,096 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:16:57,440 INFO L418 sIntCurrentIteration]: We unified 20 AI predicates to 20 [2018-12-03 17:16:57,441 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:16:57,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:16:57,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [10] total 26 [2018-12-03 17:16:57,441 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:16:57,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 17:16:57,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 17:16:57,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:16:57,442 INFO L87 Difference]: Start difference. First operand 3396 states and 5411 transitions. Second operand 18 states. [2018-12-03 17:17:02,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:02,487 INFO L93 Difference]: Finished difference Result 3616 states and 5742 transitions. [2018-12-03 17:17:02,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:17:02,488 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-12-03 17:17:02,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:02,491 INFO L225 Difference]: With dead ends: 3616 [2018-12-03 17:17:02,491 INFO L226 Difference]: Without dead ends: 3614 [2018-12-03 17:17:02,492 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=940, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:17:02,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3614 states. [2018-12-03 17:17:04,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3614 to 3396. [2018-12-03 17:17:04,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3396 states. [2018-12-03 17:17:04,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 3396 states and 5408 transitions. [2018-12-03 17:17:04,229 INFO L78 Accepts]: Start accepts. Automaton has 3396 states and 5408 transitions. Word has length 21 [2018-12-03 17:17:04,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:04,229 INFO L480 AbstractCegarLoop]: Abstraction has 3396 states and 5408 transitions. [2018-12-03 17:17:04,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 17:17:04,229 INFO L276 IsEmpty]: Start isEmpty. Operand 3396 states and 5408 transitions. [2018-12-03 17:17:04,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 17:17:04,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:04,231 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:17:04,231 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:04,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:04,231 INFO L82 PathProgramCache]: Analyzing trace with hash -56309869, now seen corresponding path program 1 times [2018-12-03 17:17:04,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:04,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:04,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:04,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:04,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:04,583 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:17:04,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:04,583 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:17:04,583 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-03 17:17:04,584 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [38], [41], [45], [47], [50], [56], [57], [58], [61], [63], [65], [67], [70] [2018-12-03 17:17:04,584 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:17:04,585 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:17:04,613 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:17:04,613 INFO L272 AbstractInterpreter]: Visited 16 different actions 83 times. Merged at 12 different actions 44 times. Widened at 3 different actions 8 times. Found 22 fixpoints after 9 different actions. Largest state had 0 variables. [2018-12-03 17:17:04,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:04,617 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:17:04,632 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 27.6% of their original sizes. [2018-12-03 17:17:04,632 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:17:05,080 INFO L418 sIntCurrentIteration]: We unified 20 AI predicates to 20 [2018-12-03 17:17:05,080 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:17:05,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:17:05,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [10] total 27 [2018-12-03 17:17:05,080 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:17:05,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 17:17:05,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 17:17:05,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:17:05,081 INFO L87 Difference]: Start difference. First operand 3396 states and 5408 transitions. Second operand 19 states. [2018-12-03 17:17:12,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:12,781 INFO L93 Difference]: Finished difference Result 5038 states and 8052 transitions. [2018-12-03 17:17:12,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 17:17:12,781 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2018-12-03 17:17:12,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:12,786 INFO L225 Difference]: With dead ends: 5038 [2018-12-03 17:17:12,786 INFO L226 Difference]: Without dead ends: 4929 [2018-12-03 17:17:12,788 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=391, Invalid=1771, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 17:17:12,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4929 states. [2018-12-03 17:17:14,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4929 to 3639. [2018-12-03 17:17:14,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3639 states. [2018-12-03 17:17:14,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3639 states to 3639 states and 5809 transitions. [2018-12-03 17:17:14,918 INFO L78 Accepts]: Start accepts. Automaton has 3639 states and 5809 transitions. Word has length 21 [2018-12-03 17:17:14,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:14,918 INFO L480 AbstractCegarLoop]: Abstraction has 3639 states and 5809 transitions. [2018-12-03 17:17:14,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 17:17:14,918 INFO L276 IsEmpty]: Start isEmpty. Operand 3639 states and 5809 transitions. [2018-12-03 17:17:14,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 17:17:14,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:14,919 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 17:17:14,919 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:14,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:14,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1665065493, now seen corresponding path program 1 times [2018-12-03 17:17:14,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:14,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:14,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:14,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:14,920 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:15,038 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:17:15,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:15,038 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:17:15,039 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-03 17:17:15,039 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [38], [41], [56], [57], [58], [61], [63], [65], [67], [70] [2018-12-03 17:17:15,040 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:17:15,040 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:17:15,060 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:17:15,060 INFO L272 AbstractInterpreter]: Visited 13 different actions 59 times. Merged at 9 different actions 32 times. Widened at 3 different actions 5 times. Found 13 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 17:17:15,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:15,062 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:17:15,075 INFO L227 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 33.33% of their original sizes. [2018-12-03 17:17:15,075 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:17:15,412 INFO L418 sIntCurrentIteration]: We unified 20 AI predicates to 20 [2018-12-03 17:17:15,412 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:17:15,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:17:15,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [10] total 26 [2018-12-03 17:17:15,412 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:17:15,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 17:17:15,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 17:17:15,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:17:15,413 INFO L87 Difference]: Start difference. First operand 3639 states and 5809 transitions. Second operand 18 states. [2018-12-03 17:17:20,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:20,712 INFO L93 Difference]: Finished difference Result 4100 states and 6557 transitions. [2018-12-03 17:17:20,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 17:17:20,712 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-12-03 17:17:20,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:20,717 INFO L225 Difference]: With dead ends: 4100 [2018-12-03 17:17:20,717 INFO L226 Difference]: Without dead ends: 4098 [2018-12-03 17:17:20,719 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=191, Invalid=931, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:17:20,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2018-12-03 17:17:22,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 3703. [2018-12-03 17:17:22,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3703 states. [2018-12-03 17:17:22,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3703 states to 3703 states and 5913 transitions. [2018-12-03 17:17:22,692 INFO L78 Accepts]: Start accepts. Automaton has 3703 states and 5913 transitions. Word has length 21 [2018-12-03 17:17:22,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:22,693 INFO L480 AbstractCegarLoop]: Abstraction has 3703 states and 5913 transitions. [2018-12-03 17:17:22,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 17:17:22,693 INFO L276 IsEmpty]: Start isEmpty. Operand 3703 states and 5913 transitions. [2018-12-03 17:17:22,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 17:17:22,694 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:22,694 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:17:22,695 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:22,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:22,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1665064723, now seen corresponding path program 1 times [2018-12-03 17:17:22,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:22,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:22,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:22,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:22,696 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:22,788 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:22,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:22,788 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:17:22,789 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-03 17:17:22,789 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [20], [21], [38], [41], [56], [58], [61], [63], [65], [67], [70], [72] [2018-12-03 17:17:22,789 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:17:22,789 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:17:22,812 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:17:22,812 INFO L272 AbstractInterpreter]: Visited 15 different actions 69 times. Merged at 10 different actions 40 times. Widened at 2 different actions 5 times. Found 14 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 17:17:22,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:22,816 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:17:22,830 INFO L227 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 33.33% of their original sizes. [2018-12-03 17:17:22,830 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:17:23,432 INFO L418 sIntCurrentIteration]: We unified 20 AI predicates to 20 [2018-12-03 17:17:23,432 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:17:23,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:17:23,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [9] total 25 [2018-12-03 17:17:23,432 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:17:23,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 17:17:23,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 17:17:23,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:17:23,433 INFO L87 Difference]: Start difference. First operand 3703 states and 5913 transitions. Second operand 18 states. [2018-12-03 17:17:29,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:29,524 INFO L93 Difference]: Finished difference Result 4169 states and 6643 transitions. [2018-12-03 17:17:29,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:17:29,524 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-12-03 17:17:29,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:29,529 INFO L225 Difference]: With dead ends: 4169 [2018-12-03 17:17:29,529 INFO L226 Difference]: Without dead ends: 4167 [2018-12-03 17:17:29,530 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=182, Invalid=940, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:17:29,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4167 states. [2018-12-03 17:17:31,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4167 to 3701. [2018-12-03 17:17:31,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3701 states. [2018-12-03 17:17:31,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3701 states to 3701 states and 5905 transitions. [2018-12-03 17:17:31,459 INFO L78 Accepts]: Start accepts. Automaton has 3701 states and 5905 transitions. Word has length 21 [2018-12-03 17:17:31,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:31,459 INFO L480 AbstractCegarLoop]: Abstraction has 3701 states and 5905 transitions. [2018-12-03 17:17:31,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 17:17:31,459 INFO L276 IsEmpty]: Start isEmpty. Operand 3701 states and 5905 transitions. [2018-12-03 17:17:31,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 17:17:31,462 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:31,462 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:17:31,462 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:31,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:31,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1673653662, now seen corresponding path program 1 times [2018-12-03 17:17:31,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:31,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:31,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:31,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:31,463 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:31,579 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:31,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:31,580 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:17:31,580 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-03 17:17:31,580 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [38], [41], [56], [58], [61], [63], [65], [66], [67], [70] [2018-12-03 17:17:31,580 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:17:31,581 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:17:31,605 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:17:31,605 INFO L272 AbstractInterpreter]: Visited 13 different actions 65 times. Merged at 10 different actions 39 times. Widened at 3 different actions 5 times. Found 15 fixpoints after 7 different actions. Largest state had 0 variables. [2018-12-03 17:17:31,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:31,606 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:17:31,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:31,606 INFO L192 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 [2018-12-03 17:17:31,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:31,616 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:17:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:31,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:17:31,724 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:31,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:17:31,847 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:31,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:17:31,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2018-12-03 17:17:31,868 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:17:31,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:17:31,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:17:31,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:17:31,869 INFO L87 Difference]: Start difference. First operand 3701 states and 5905 transitions. Second operand 15 states. [2018-12-03 17:17:40,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:40,307 INFO L93 Difference]: Finished difference Result 5949 states and 9474 transitions. [2018-12-03 17:17:40,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 17:17:40,308 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-12-03 17:17:40,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:40,314 INFO L225 Difference]: With dead ends: 5949 [2018-12-03 17:17:40,314 INFO L226 Difference]: Without dead ends: 5945 [2018-12-03 17:17:40,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1337 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1054, Invalid=4496, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 17:17:40,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5945 states. [2018-12-03 17:17:42,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5945 to 4111. [2018-12-03 17:17:42,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4111 states. [2018-12-03 17:17:42,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4111 states to 4111 states and 6543 transitions. [2018-12-03 17:17:42,608 INFO L78 Accepts]: Start accepts. Automaton has 4111 states and 6543 transitions. Word has length 21 [2018-12-03 17:17:42,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:42,608 INFO L480 AbstractCegarLoop]: Abstraction has 4111 states and 6543 transitions. [2018-12-03 17:17:42,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:17:42,609 INFO L276 IsEmpty]: Start isEmpty. Operand 4111 states and 6543 transitions. [2018-12-03 17:17:42,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 17:17:42,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:42,610 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:17:42,610 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:42,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:42,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1775646079, now seen corresponding path program 1 times [2018-12-03 17:17:42,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:42,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:42,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:42,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:42,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:42,706 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:17:42,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:42,707 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:17:42,707 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-03 17:17:42,707 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [11], [14], [29], [32], [45], [46], [47], [52], [56], [58], [61], [63], [65], [67], [70] [2018-12-03 17:17:42,708 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:17:42,708 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:17:42,735 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:17:42,735 INFO L272 AbstractInterpreter]: Visited 18 different actions 73 times. Merged at 16 different actions 41 times. Widened at 2 different actions 4 times. Found 16 fixpoints after 8 different actions. Largest state had 0 variables. [2018-12-03 17:17:42,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:42,737 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:17:42,749 INFO L227 lantSequenceWeakener]: Weakened 19 states. On average, predicates are now at 33.77% of their original sizes. [2018-12-03 17:17:42,749 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:17:43,239 INFO L418 sIntCurrentIteration]: We unified 20 AI predicates to 20 [2018-12-03 17:17:43,239 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:17:43,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:17:43,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [7] total 27 [2018-12-03 17:17:43,239 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:17:43,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 17:17:43,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 17:17:43,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:17:43,240 INFO L87 Difference]: Start difference. First operand 4111 states and 6543 transitions. Second operand 22 states. [2018-12-03 17:17:54,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:54,188 INFO L93 Difference]: Finished difference Result 8683 states and 13994 transitions. [2018-12-03 17:17:54,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 17:17:54,188 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-12-03 17:17:54,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:54,195 INFO L225 Difference]: With dead ends: 8683 [2018-12-03 17:17:54,195 INFO L226 Difference]: Without dead ends: 7118 [2018-12-03 17:17:54,198 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 73 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1685 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=932, Invalid=4618, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 17:17:54,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7118 states. [2018-12-03 17:17:57,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7118 to 6353. [2018-12-03 17:17:57,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6353 states. [2018-12-03 17:17:57,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6353 states to 6353 states and 10088 transitions. [2018-12-03 17:17:57,913 INFO L78 Accepts]: Start accepts. Automaton has 6353 states and 10088 transitions. Word has length 21 [2018-12-03 17:17:57,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:57,913 INFO L480 AbstractCegarLoop]: Abstraction has 6353 states and 10088 transitions. [2018-12-03 17:17:57,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 17:17:57,913 INFO L276 IsEmpty]: Start isEmpty. Operand 6353 states and 10088 transitions. [2018-12-03 17:17:57,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 17:17:57,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:57,915 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 17:17:57,916 INFO L423 AbstractCegarLoop]: === Iteration 54 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:57,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:57,916 INFO L82 PathProgramCache]: Analyzing trace with hash 778201157, now seen corresponding path program 1 times [2018-12-03 17:17:57,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:57,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:57,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:57,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:57,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:57,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:58,092 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:58,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:58,092 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:17:58,092 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-12-03 17:17:58,092 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [29], [32], [56], [57], [65], [67], [72] [2018-12-03 17:17:58,093 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:17:58,093 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:17:58,105 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:17:58,105 INFO L272 AbstractInterpreter]: Visited 10 different actions 36 times. Merged at 7 different actions 24 times. Widened at 1 different actions 2 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 17:17:58,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:58,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:17:58,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:58,110 INFO L192 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 [2018-12-03 17:17:58,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:58,120 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:17:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:58,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:17:58,192 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:58,192 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:17:58,258 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:58,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:17:58,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 21 [2018-12-03 17:17:58,278 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:17:58,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 17:17:58,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 17:17:58,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:17:58,278 INFO L87 Difference]: Start difference. First operand 6353 states and 10088 transitions. Second operand 17 states. [2018-12-03 17:18:10,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:18:10,533 INFO L93 Difference]: Finished difference Result 12323 states and 19877 transitions. [2018-12-03 17:18:10,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 17:18:10,533 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 22 [2018-12-03 17:18:10,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:18:10,549 INFO L225 Difference]: With dead ends: 12323 [2018-12-03 17:18:10,550 INFO L226 Difference]: Without dead ends: 12138 [2018-12-03 17:18:10,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2305 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1800, Invalid=5340, Unknown=0, NotChecked=0, Total=7140 [2018-12-03 17:18:10,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12138 states. [2018-12-03 17:18:15,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12138 to 7452. [2018-12-03 17:18:15,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7452 states. [2018-12-03 17:18:15,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7452 states to 7452 states and 11991 transitions. [2018-12-03 17:18:15,078 INFO L78 Accepts]: Start accepts. Automaton has 7452 states and 11991 transitions. Word has length 22 [2018-12-03 17:18:15,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:18:15,078 INFO L480 AbstractCegarLoop]: Abstraction has 7452 states and 11991 transitions. [2018-12-03 17:18:15,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 17:18:15,079 INFO L276 IsEmpty]: Start isEmpty. Operand 7452 states and 11991 transitions. [2018-12-03 17:18:15,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 17:18:15,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:18:15,081 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:18:15,081 INFO L423 AbstractCegarLoop]: === Iteration 55 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:18:15,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:15,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1430105776, now seen corresponding path program 1 times [2018-12-03 17:18:15,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:18:15,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:15,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:18:15,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:15,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:18:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:15,196 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 17:18:15,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:15,196 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:18:15,196 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-12-03 17:18:15,197 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [11], [14], [20], [22], [25], [27], [38], [41], [45], [47], [50], [52], [56], [57] [2018-12-03 17:18:15,197 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:18:15,197 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:18:15,213 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:18:15,213 INFO L272 AbstractInterpreter]: Visited 17 different actions 48 times. Merged at 15 different actions 23 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 9 different actions. Largest state had 0 variables. [2018-12-03 17:18:15,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:15,215 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:18:15,228 INFO L227 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 28.94% of their original sizes. [2018-12-03 17:18:15,229 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:18:15,522 INFO L418 sIntCurrentIteration]: We unified 22 AI predicates to 22 [2018-12-03 17:18:15,522 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:18:15,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:18:15,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [9] total 26 [2018-12-03 17:18:15,523 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:18:15,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 17:18:15,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 17:18:15,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:18:15,524 INFO L87 Difference]: Start difference. First operand 7452 states and 11991 transitions. Second operand 19 states. [2018-12-03 17:18:26,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:18:26,457 INFO L93 Difference]: Finished difference Result 12922 states and 21029 transitions. [2018-12-03 17:18:26,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 17:18:26,457 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-12-03 17:18:26,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:18:26,469 INFO L225 Difference]: With dead ends: 12922 [2018-12-03 17:18:26,469 INFO L226 Difference]: Without dead ends: 11040 [2018-12-03 17:18:26,473 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=427, Invalid=1829, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 17:18:26,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11040 states. [2018-12-03 17:18:32,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11040 to 10349. [2018-12-03 17:18:32,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10349 states. [2018-12-03 17:18:32,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10349 states to 10349 states and 16640 transitions. [2018-12-03 17:18:32,791 INFO L78 Accepts]: Start accepts. Automaton has 10349 states and 16640 transitions. Word has length 23 [2018-12-03 17:18:32,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:18:32,791 INFO L480 AbstractCegarLoop]: Abstraction has 10349 states and 16640 transitions. [2018-12-03 17:18:32,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 17:18:32,792 INFO L276 IsEmpty]: Start isEmpty. Operand 10349 states and 16640 transitions. [2018-12-03 17:18:32,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 17:18:32,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:18:32,795 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:18:32,795 INFO L423 AbstractCegarLoop]: === Iteration 56 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:18:32,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:32,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1659562418, now seen corresponding path program 1 times [2018-12-03 17:18:32,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:18:32,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:32,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:18:32,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:32,796 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:18:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:32,958 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:18:32,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:32,959 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:18:32,959 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-12-03 17:18:32,959 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [11], [14], [20], [22], [25], [29], [32], [38], [41], [45], [47], [50], [52], [56], [57], [58], [63] [2018-12-03 17:18:32,960 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:18:32,961 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:18:32,985 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:18:32,985 INFO L272 AbstractInterpreter]: Visited 20 different actions 85 times. Merged at 18 different actions 47 times. Widened at 3 different actions 3 times. Found 20 fixpoints after 9 different actions. Largest state had 0 variables. [2018-12-03 17:18:32,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:32,986 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:18:33,007 INFO L227 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 27.78% of their original sizes. [2018-12-03 17:18:33,007 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:18:33,473 INFO L418 sIntCurrentIteration]: We unified 22 AI predicates to 22 [2018-12-03 17:18:33,474 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:18:33,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:18:33,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [9] total 27 [2018-12-03 17:18:33,474 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:18:33,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 17:18:33,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 17:18:33,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:18:33,475 INFO L87 Difference]: Start difference. First operand 10349 states and 16640 transitions. Second operand 20 states. [2018-12-03 17:18:57,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:18:57,856 INFO L93 Difference]: Finished difference Result 25026 states and 40422 transitions. [2018-12-03 17:18:57,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 17:18:57,856 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2018-12-03 17:18:57,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:18:57,876 INFO L225 Difference]: With dead ends: 25026 [2018-12-03 17:18:57,877 INFO L226 Difference]: Without dead ends: 23156 [2018-12-03 17:18:57,881 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2013 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1089, Invalid=5391, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 17:18:57,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23156 states. [2018-12-03 17:19:10,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23156 to 18833. [2018-12-03 17:19:10,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18833 states. [2018-12-03 17:19:10,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18833 states to 18833 states and 30165 transitions. [2018-12-03 17:19:10,173 INFO L78 Accepts]: Start accepts. Automaton has 18833 states and 30165 transitions. Word has length 23 [2018-12-03 17:19:10,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:19:10,174 INFO L480 AbstractCegarLoop]: Abstraction has 18833 states and 30165 transitions. [2018-12-03 17:19:10,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 17:19:10,174 INFO L276 IsEmpty]: Start isEmpty. Operand 18833 states and 30165 transitions. [2018-12-03 17:19:10,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 17:19:10,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:19:10,177 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:19:10,177 INFO L423 AbstractCegarLoop]: === Iteration 57 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:19:10,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:10,178 INFO L82 PathProgramCache]: Analyzing trace with hash 72285591, now seen corresponding path program 1 times [2018-12-03 17:19:10,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:19:10,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:10,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:19:10,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:10,179 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:19:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:10,292 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:19:10,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:10,293 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:19:10,293 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-12-03 17:19:10,293 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [20], [22], [25], [29], [32], [56], [57], [65], [67], [70], [72] [2018-12-03 17:19:10,294 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:19:10,294 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:19:10,319 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:19:10,319 INFO L272 AbstractInterpreter]: Visited 14 different actions 65 times. Merged at 11 different actions 38 times. Widened at 3 different actions 7 times. Found 15 fixpoints after 8 different actions. Largest state had 0 variables. [2018-12-03 17:19:10,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:10,350 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:19:10,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:10,351 INFO L192 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 [2018-12-03 17:19:10,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:19:10,359 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:19:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:10,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:19:10,499 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-12-03 17:19:10,572 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:19:10,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:19:10,637 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:19:10,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:19:10,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 18 [2018-12-03 17:19:10,658 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:19:10,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 17:19:10,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 17:19:10,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:19:10,658 INFO L87 Difference]: Start difference. First operand 18833 states and 30165 transitions. Second operand 16 states. [2018-12-03 17:19:17,108 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2018-12-03 17:19:30,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:19:30,082 INFO L93 Difference]: Finished difference Result 36957 states and 59294 transitions. [2018-12-03 17:19:30,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 17:19:30,082 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-12-03 17:19:30,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:19:30,105 INFO L225 Difference]: With dead ends: 36957 [2018-12-03 17:19:30,105 INFO L226 Difference]: Without dead ends: 22643 [2018-12-03 17:19:30,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=781, Invalid=3775, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 17:19:30,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22643 states. [2018-12-03 17:19:41,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22643 to 16521. [2018-12-03 17:19:41,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16521 states. [2018-12-03 17:19:41,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16521 states to 16521 states and 25686 transitions. [2018-12-03 17:19:41,666 INFO L78 Accepts]: Start accepts. Automaton has 16521 states and 25686 transitions. Word has length 23 [2018-12-03 17:19:41,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:19:41,666 INFO L480 AbstractCegarLoop]: Abstraction has 16521 states and 25686 transitions. [2018-12-03 17:19:41,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 17:19:41,667 INFO L276 IsEmpty]: Start isEmpty. Operand 16521 states and 25686 transitions. [2018-12-03 17:19:41,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 17:19:41,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:19:41,671 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:19:41,671 INFO L423 AbstractCegarLoop]: === Iteration 58 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:19:41,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:41,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1023806098, now seen corresponding path program 1 times [2018-12-03 17:19:41,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:19:41,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:41,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:19:41,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:41,672 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:19:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:41,848 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 17:19:41,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:41,849 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:19:41,849 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 17:19:41,849 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [11], [14], [20], [22], [25], [27], [38], [41], [56], [57], [58], [61], [65], [67], [70] [2018-12-03 17:19:41,850 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:19:41,850 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:19:41,869 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:19:41,869 INFO L272 AbstractInterpreter]: Visited 18 different actions 58 times. Merged at 14 different actions 29 times. Widened at 2 different actions 4 times. Found 11 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 17:19:41,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:41,872 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:19:41,888 INFO L227 lantSequenceWeakener]: Weakened 21 states. On average, predicates are now at 38.1% of their original sizes. [2018-12-03 17:19:41,888 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:19:42,338 INFO L418 sIntCurrentIteration]: We unified 23 AI predicates to 23 [2018-12-03 17:19:42,339 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:19:42,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:19:42,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [8] total 27 [2018-12-03 17:19:42,339 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:19:42,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 17:19:42,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 17:19:42,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:19:42,340 INFO L87 Difference]: Start difference. First operand 16521 states and 25686 transitions. Second operand 21 states. [2018-12-03 17:19:59,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:19:59,213 INFO L93 Difference]: Finished difference Result 16979 states and 26394 transitions. [2018-12-03 17:19:59,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 17:19:59,213 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 24 [2018-12-03 17:19:59,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:19:59,228 INFO L225 Difference]: With dead ends: 16979 [2018-12-03 17:19:59,228 INFO L226 Difference]: Without dead ends: 16977 [2018-12-03 17:19:59,231 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 56 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=361, Invalid=2501, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 17:19:59,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16977 states. [2018-12-03 17:20:10,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16977 to 16633. [2018-12-03 17:20:10,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16633 states. [2018-12-03 17:20:10,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16633 states to 16633 states and 25862 transitions. [2018-12-03 17:20:10,769 INFO L78 Accepts]: Start accepts. Automaton has 16633 states and 25862 transitions. Word has length 24 [2018-12-03 17:20:10,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:20:10,769 INFO L480 AbstractCegarLoop]: Abstraction has 16633 states and 25862 transitions. [2018-12-03 17:20:10,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 17:20:10,769 INFO L276 IsEmpty]: Start isEmpty. Operand 16633 states and 25862 transitions. [2018-12-03 17:20:10,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 17:20:10,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:20:10,773 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:20:10,774 INFO L423 AbstractCegarLoop]: === Iteration 59 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:20:10,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:20:10,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1423257468, now seen corresponding path program 2 times [2018-12-03 17:20:10,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:20:10,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:10,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:20:10,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:10,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:20:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:20:11,522 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 17:20:11,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:20:11,523 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:20:11,523 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:20:11,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:20:11,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:20:11,524 INFO L192 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 [2018-12-03 17:20:11,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:20:11,541 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:20:11,592 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 17:20:11,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:20:11,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:20:12,179 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:20:12,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:20:12,259 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:20:12,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:20:12,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2018-12-03 17:20:12,279 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:20:12,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 17:20:12,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 17:20:12,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:20:12,280 INFO L87 Difference]: Start difference. First operand 16633 states and 25862 transitions. Second operand 16 states. [2018-12-03 17:20:17,128 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2018-12-03 17:20:54,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:20:54,592 INFO L93 Difference]: Finished difference Result 70332 states and 110601 transitions. [2018-12-03 17:20:54,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 17:20:54,593 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2018-12-03 17:20:54,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:20:54,667 INFO L225 Difference]: With dead ends: 70332 [2018-12-03 17:20:54,667 INFO L226 Difference]: Without dead ends: 57749 [2018-12-03 17:20:54,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3679 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1726, Invalid=8986, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 17:20:54,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57749 states. [2018-12-03 17:21:21,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57749 to 39548. [2018-12-03 17:21:21,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39548 states. [2018-12-03 17:21:21,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39548 states to 39548 states and 61219 transitions. [2018-12-03 17:21:21,566 INFO L78 Accepts]: Start accepts. Automaton has 39548 states and 61219 transitions. Word has length 24 [2018-12-03 17:21:21,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:21:21,566 INFO L480 AbstractCegarLoop]: Abstraction has 39548 states and 61219 transitions. [2018-12-03 17:21:21,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 17:21:21,566 INFO L276 IsEmpty]: Start isEmpty. Operand 39548 states and 61219 transitions. [2018-12-03 17:21:21,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 17:21:21,571 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:21:21,572 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:21:21,572 INFO L423 AbstractCegarLoop]: === Iteration 60 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:21:21,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:21:21,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1423256698, now seen corresponding path program 1 times [2018-12-03 17:21:21,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:21:21,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:21,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:21:21,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:21,573 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:21:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:21:21,644 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 17:21:21,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:21:21,644 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:21:21,644 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 17:21:21,644 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [11], [14], [20], [21], [22], [25], [27], [38], [41], [56], [58], [61], [65], [67], [70], [72] [2018-12-03 17:21:21,645 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:21:21,645 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:21:21,665 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:21:21,665 INFO L272 AbstractInterpreter]: Visited 19 different actions 70 times. Merged at 17 different actions 37 times. Widened at 2 different actions 4 times. Found 18 fixpoints after 9 different actions. Largest state had 0 variables. [2018-12-03 17:21:21,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:21:21,666 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:21:21,683 INFO L227 lantSequenceWeakener]: Weakened 21 states. On average, predicates are now at 36.51% of their original sizes. [2018-12-03 17:21:21,683 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:21:23,729 INFO L418 sIntCurrentIteration]: We unified 23 AI predicates to 23 [2018-12-03 17:21:23,729 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:21:23,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:21:23,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [7] total 28 [2018-12-03 17:21:23,730 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:21:23,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 17:21:23,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 17:21:23,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:21:23,731 INFO L87 Difference]: Start difference. First operand 39548 states and 61219 transitions. Second operand 23 states. [2018-12-03 17:22:02,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:22:02,065 INFO L93 Difference]: Finished difference Result 51356 states and 80251 transitions. [2018-12-03 17:22:02,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 17:22:02,065 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 24 [2018-12-03 17:22:02,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:22:02,115 INFO L225 Difference]: With dead ends: 51356 [2018-12-03 17:22:02,115 INFO L226 Difference]: Without dead ends: 46978 [2018-12-03 17:22:02,124 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1525 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=800, Invalid=4602, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 17:22:02,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46978 states. [2018-12-03 17:22:30,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46978 to 42327. [2018-12-03 17:22:30,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42327 states. [2018-12-03 17:22:30,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42327 states to 42327 states and 65469 transitions. [2018-12-03 17:22:30,059 INFO L78 Accepts]: Start accepts. Automaton has 42327 states and 65469 transitions. Word has length 24 [2018-12-03 17:22:30,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:22:30,060 INFO L480 AbstractCegarLoop]: Abstraction has 42327 states and 65469 transitions. [2018-12-03 17:22:30,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 17:22:30,060 INFO L276 IsEmpty]: Start isEmpty. Operand 42327 states and 65469 transitions. [2018-12-03 17:22:30,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 17:22:30,065 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:22:30,066 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:22:30,066 INFO L423 AbstractCegarLoop]: === Iteration 61 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:22:30,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:22:30,066 INFO L82 PathProgramCache]: Analyzing trace with hash 762381400, now seen corresponding path program 1 times [2018-12-03 17:22:30,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:22:30,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:30,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:22:30,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:30,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:22:30,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:22:30,142 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 17:22:30,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:22:30,142 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:22:30,142 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 17:22:30,142 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [11], [14], [20], [21], [22], [25], [27], [38], [41], [45], [47], [50], [56], [58], [61], [65], [67], [72] [2018-12-03 17:22:30,143 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:22:30,143 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:22:30,166 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:22:30,167 INFO L272 AbstractInterpreter]: Visited 21 different actions 80 times. Merged at 19 different actions 45 times. Widened at 4 different actions 6 times. Found 18 fixpoints after 9 different actions. Largest state had 0 variables. [2018-12-03 17:22:30,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:22:30,172 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:22:30,193 INFO L227 lantSequenceWeakener]: Weakened 20 states. On average, predicates are now at 32.92% of their original sizes. [2018-12-03 17:22:30,193 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:22:30,796 INFO L418 sIntCurrentIteration]: We unified 23 AI predicates to 23 [2018-12-03 17:22:30,796 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:22:30,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:22:30,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [7] total 28 [2018-12-03 17:22:30,796 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:22:30,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 17:22:30,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 17:22:30,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:22:30,797 INFO L87 Difference]: Start difference. First operand 42327 states and 65469 transitions. Second operand 23 states. [2018-12-03 17:23:24,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:23:24,566 INFO L93 Difference]: Finished difference Result 92726 states and 143851 transitions. [2018-12-03 17:23:24,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 17:23:24,566 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 24 [2018-12-03 17:23:24,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:23:24,652 INFO L225 Difference]: With dead ends: 92726 [2018-12-03 17:23:24,652 INFO L226 Difference]: Without dead ends: 66154 [2018-12-03 17:23:24,675 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=688, Invalid=4282, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 17:23:24,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66154 states. [2018-12-03 17:24:07,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66154 to 59539. [2018-12-03 17:24:07,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59539 states. [2018-12-03 17:24:07,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59539 states to 59539 states and 91664 transitions. [2018-12-03 17:24:07,376 INFO L78 Accepts]: Start accepts. Automaton has 59539 states and 91664 transitions. Word has length 24 [2018-12-03 17:24:07,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:24:07,377 INFO L480 AbstractCegarLoop]: Abstraction has 59539 states and 91664 transitions. [2018-12-03 17:24:07,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 17:24:07,377 INFO L276 IsEmpty]: Start isEmpty. Operand 59539 states and 91664 transitions. [2018-12-03 17:24:07,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 17:24:07,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:24:07,383 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:24:07,384 INFO L423 AbstractCegarLoop]: === Iteration 62 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:24:07,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:24:07,384 INFO L82 PathProgramCache]: Analyzing trace with hash 61064702, now seen corresponding path program 1 times [2018-12-03 17:24:07,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:24:07,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:24:07,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:24:07,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:24:07,385 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:24:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:24:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:24:07,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:24:07,506 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:24:07,506 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 17:24:07,506 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [20], [22], [25], [29], [32], [56], [58], [61], [65], [66], [67], [70], [72] [2018-12-03 17:24:07,507 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:24:07,507 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:24:07,541 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:24:07,541 INFO L272 AbstractInterpreter]: Visited 16 different actions 77 times. Merged at 11 different actions 41 times. Widened at 3 different actions 8 times. Found 20 fixpoints after 8 different actions. Largest state had 0 variables. [2018-12-03 17:24:07,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:24:07,577 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:24:07,599 INFO L227 lantSequenceWeakener]: Weakened 20 states. On average, predicates are now at 31.67% of their original sizes. [2018-12-03 17:24:07,599 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:24:08,102 INFO L418 sIntCurrentIteration]: We unified 23 AI predicates to 23 [2018-12-03 17:24:08,102 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:24:08,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:24:08,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [11] total 29 [2018-12-03 17:24:08,102 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:24:08,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 17:24:08,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 17:24:08,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:24:08,103 INFO L87 Difference]: Start difference. First operand 59539 states and 91664 transitions. Second operand 20 states. [2018-12-03 17:25:02,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:25:02,617 INFO L93 Difference]: Finished difference Result 64240 states and 98805 transitions. [2018-12-03 17:25:02,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 17:25:02,617 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2018-12-03 17:25:02,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:25:02,705 INFO L225 Difference]: With dead ends: 64240 [2018-12-03 17:25:02,705 INFO L226 Difference]: Without dead ends: 64238 [2018-12-03 17:25:02,719 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 71 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1452 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=676, Invalid=3880, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 17:25:02,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64238 states. [2018-12-03 17:25:49,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64238 to 62979. [2018-12-03 17:25:49,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62979 states. [2018-12-03 17:25:49,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62979 states to 62979 states and 96799 transitions. [2018-12-03 17:25:49,302 INFO L78 Accepts]: Start accepts. Automaton has 62979 states and 96799 transitions. Word has length 24 [2018-12-03 17:25:49,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:25:49,303 INFO L480 AbstractCegarLoop]: Abstraction has 62979 states and 96799 transitions. [2018-12-03 17:25:49,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 17:25:49,303 INFO L276 IsEmpty]: Start isEmpty. Operand 62979 states and 96799 transitions. [2018-12-03 17:25:49,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 17:25:49,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:25:49,310 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:25:49,310 INFO L423 AbstractCegarLoop]: === Iteration 63 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:25:49,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:25:49,310 INFO L82 PathProgramCache]: Analyzing trace with hash 61065984, now seen corresponding path program 1 times [2018-12-03 17:25:49,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:25:49,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:25:49,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:25:49,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:25:49,311 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:25:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:25:49,536 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:25:49,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:25:49,536 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:25:49,536 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 17:25:49,536 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [20], [22], [25], [29], [32], [45], [46], [56], [58], [61], [63], [65], [67], [70], [72] [2018-12-03 17:25:49,537 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:25:49,537 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:25:49,567 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:25:49,567 INFO L272 AbstractInterpreter]: Visited 18 different actions 89 times. Merged at 13 different actions 51 times. Widened at 2 different actions 8 times. Found 21 fixpoints after 7 different actions. Largest state had 0 variables. [2018-12-03 17:25:49,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:25:49,571 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:25:49,591 INFO L227 lantSequenceWeakener]: Weakened 20 states. On average, predicates are now at 31.67% of their original sizes. [2018-12-03 17:25:49,592 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:25:50,516 INFO L418 sIntCurrentIteration]: We unified 23 AI predicates to 23 [2018-12-03 17:25:50,516 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:25:50,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:25:50,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [10] total 28 [2018-12-03 17:25:50,517 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:25:50,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 17:25:50,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 17:25:50,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:25:50,517 INFO L87 Difference]: Start difference. First operand 62979 states and 96799 transitions. Second operand 20 states. [2018-12-03 17:26:45,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:45,224 INFO L93 Difference]: Finished difference Result 65886 states and 101306 transitions. [2018-12-03 17:26:45,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 17:26:45,224 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2018-12-03 17:26:45,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:45,300 INFO L225 Difference]: With dead ends: 65886 [2018-12-03 17:26:45,300 INFO L226 Difference]: Without dead ends: 65884 [2018-12-03 17:26:45,313 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 75 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1614 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=735, Invalid=4377, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 17:26:45,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65884 states. [2018-12-03 17:27:32,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65884 to 62989. [2018-12-03 17:27:32,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62989 states. [2018-12-03 17:27:33,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62989 states to 62989 states and 96806 transitions. [2018-12-03 17:27:33,057 INFO L78 Accepts]: Start accepts. Automaton has 62989 states and 96806 transitions. Word has length 24 [2018-12-03 17:27:33,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:33,057 INFO L480 AbstractCegarLoop]: Abstraction has 62989 states and 96806 transitions. [2018-12-03 17:27:33,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 17:27:33,057 INFO L276 IsEmpty]: Start isEmpty. Operand 62989 states and 96806 transitions. [2018-12-03 17:27:33,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 17:27:33,065 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:33,065 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:27:33,065 INFO L423 AbstractCegarLoop]: === Iteration 64 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:33,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:33,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1794382508, now seen corresponding path program 1 times [2018-12-03 17:27:33,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:33,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:33,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:33,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:33,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:33,180 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:27:33,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:33,180 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:33,180 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 17:27:33,181 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [20], [22], [25], [29], [32], [38], [41], [56], [57], [58], [61], [63], [65], [67], [70] [2018-12-03 17:27:33,181 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:27:33,182 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:27:33,207 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:27:33,207 INFO L272 AbstractInterpreter]: Visited 18 different actions 85 times. Merged at 13 different actions 49 times. Widened at 4 different actions 8 times. Found 21 fixpoints after 8 different actions. Largest state had 0 variables. [2018-12-03 17:27:33,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:33,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:27:33,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:33,214 INFO L192 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 [2018-12-03 17:27:33,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:33,222 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:27:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:33,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:33,325 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:27:33,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:33,427 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:27:33,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:33,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 20 [2018-12-03 17:27:33,447 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:33,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 17:27:33,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 17:27:33,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:27:33,448 INFO L87 Difference]: Start difference. First operand 62989 states and 96806 transitions. Second operand 16 states.