java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/real-life/threadpooling_product.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 18:34:39,493 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 18:34:39,496 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 18:34:39,513 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 18:34:39,513 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 18:34:39,514 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 18:34:39,516 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 18:34:39,518 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 18:34:39,520 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 18:34:39,520 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 18:34:39,522 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 18:34:39,523 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 18:34:39,523 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 18:34:39,525 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 18:34:39,528 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 18:34:39,531 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 18:34:39,532 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 18:34:39,536 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 18:34:39,542 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 18:34:39,547 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 18:34:39,549 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 18:34:39,550 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 18:34:39,553 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 18:34:39,553 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 18:34:39,554 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 18:34:39,555 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 18:34:39,556 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 18:34:39,556 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 18:34:39,557 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 18:34:39,558 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 18:34:39,558 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 18:34:39,559 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 18:34:39,559 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 18:34:39,559 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 18:34:39,560 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 18:34:39,561 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 18:34:39,561 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-03 18:34:39,573 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 18:34:39,574 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 18:34:39,574 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 18:34:39,575 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 18:34:39,575 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 18:34:39,575 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 18:34:39,575 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 18:34:39,575 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 18:34:39,576 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 18:34:39,576 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-03 18:34:39,576 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 18:34:39,576 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 18:34:39,576 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 18:34:39,577 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 18:34:39,577 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 18:34:39,577 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 18:34:39,578 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 18:34:39,578 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 18:34:39,578 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 18:34:39,578 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 18:34:39,578 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 18:34:39,579 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 18:34:39,579 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 18:34:39,579 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 18:34:39,579 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 18:34:39,579 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 18:34:39,580 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 18:34:39,580 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 18:34:39,580 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 18:34:39,580 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 18:34:39,580 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 18:34:39,581 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:34:39,581 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 18:34:39,581 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 18:34:39,581 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 18:34:39,582 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 18:34:39,582 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 18:34:39,582 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 18:34:39,582 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 18:34:39,582 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 18:34:39,623 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 18:34:39,639 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 18:34:39,645 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 18:34:39,646 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 18:34:39,647 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 18:34:39,648 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 18:34:39,648 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product.bpl' [2018-12-03 18:34:39,702 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 18:34:39,704 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 18:34:39,704 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 18:34:39,705 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 18:34:39,705 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 18:34:39,722 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 06:34:39" (1/1) ... [2018-12-03 18:34:39,731 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 06:34:39" (1/1) ... [2018-12-03 18:34:39,738 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 18:34:39,738 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 18:34:39,739 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 18:34:39,741 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 18:34:39,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 18:34:39,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 18:34:39,742 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 18:34:39,753 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 06:34:39" (1/1) ... [2018-12-03 18:34:39,754 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 06:34:39" (1/1) ... [2018-12-03 18:34:39,755 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 06:34:39" (1/1) ... [2018-12-03 18:34:39,755 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 06:34:39" (1/1) ... [2018-12-03 18:34:39,759 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 06:34:39" (1/1) ... [2018-12-03 18:34:39,762 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 06:34:39" (1/1) ... [2018-12-03 18:34:39,763 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 06:34:39" (1/1) ... [2018-12-03 18:34:39,765 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 18:34:39,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 18:34:39,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 18:34:39,766 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 18:34:39,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:34:39" (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 18:34:39,841 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-12-03 18:34:39,841 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-12-03 18:34:39,842 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-12-03 18:34:40,239 INFO L272 CfgBuilder]: Using library mode [2018-12-03 18:34:40,240 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 18:34:40,240 INFO L202 PluginConnector]: Adding new model threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:34:40 BoogieIcfgContainer [2018-12-03 18:34:40,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 18:34:40,241 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 18:34:40,241 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 18:34:40,245 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 18:34:40,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:34:39" (1/2) ... [2018-12-03 18:34:40,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c39b9da and model type threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:34:40, skipping insertion in model container [2018-12-03 18:34:40,247 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 06:34:40" (2/2) ... [2018-12-03 18:34:40,249 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product.bpl [2018-12-03 18:34:40,265 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 18:34:40,281 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-12-03 18:34:40,311 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-12-03 18:34:40,355 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 18:34:40,355 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 18:34:40,355 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 18:34:40,356 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 18:34:40,356 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 18:34:40,356 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 18:34:40,357 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 18:34:40,357 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 18:34:40,376 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-12-03 18:34:40,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 18:34:40,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:40,384 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 18:34:40,387 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:40,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:40,393 INFO L82 PathProgramCache]: Analyzing trace with hash 28755683, now seen corresponding path program 1 times [2018-12-03 18:34:40,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:40,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:40,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:40,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:40,446 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:40,584 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 18:34:40,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:40,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:34:40,586 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:40,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 18:34:40,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 18:34:40,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 18:34:40,607 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2018-12-03 18:34:41,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:41,223 INFO L93 Difference]: Finished difference Result 49 states and 85 transitions. [2018-12-03 18:34:41,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 18:34:41,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 18:34:41,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:41,240 INFO L225 Difference]: With dead ends: 49 [2018-12-03 18:34:41,240 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 18:34:41,244 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 18:34:41,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 18:34:41,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2018-12-03 18:34:41,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 18:34:41,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2018-12-03 18:34:41,284 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 5 [2018-12-03 18:34:41,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:41,285 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2018-12-03 18:34:41,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 18:34:41,285 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2018-12-03 18:34:41,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 18:34:41,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:41,286 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 18:34:41,287 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:41,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:41,287 INFO L82 PathProgramCache]: Analyzing trace with hash 28971747, now seen corresponding path program 1 times [2018-12-03 18:34:41,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:41,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:41,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:41,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:41,289 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:41,538 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 18:34:41,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:41,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:34:41,539 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:41,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 18:34:41,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 18:34:41,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 18:34:41,542 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 5 states. [2018-12-03 18:34:41,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:41,870 INFO L93 Difference]: Finished difference Result 57 states and 99 transitions. [2018-12-03 18:34:41,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 18:34:41,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 18:34:41,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:41,872 INFO L225 Difference]: With dead ends: 57 [2018-12-03 18:34:41,872 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 18:34:41,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 18:34:41,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 18:34:41,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2018-12-03 18:34:41,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 18:34:41,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 63 transitions. [2018-12-03 18:34:41,888 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 63 transitions. Word has length 5 [2018-12-03 18:34:41,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:41,888 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 63 transitions. [2018-12-03 18:34:41,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 18:34:41,889 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 63 transitions. [2018-12-03 18:34:41,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 18:34:41,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:41,890 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:34:41,890 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:41,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:41,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1864688358, now seen corresponding path program 1 times [2018-12-03 18:34:41,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:41,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:41,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:41,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:41,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:42,102 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 18:34:42,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:42,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 18:34:42,104 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:42,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:34:42,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:34:42,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 18:34:42,105 INFO L87 Difference]: Start difference. First operand 38 states and 63 transitions. Second operand 7 states. [2018-12-03 18:34:43,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:43,295 INFO L93 Difference]: Finished difference Result 84 states and 147 transitions. [2018-12-03 18:34:43,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 18:34:43,295 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 18:34:43,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:43,298 INFO L225 Difference]: With dead ends: 84 [2018-12-03 18:34:43,299 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 18:34:43,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-03 18:34:43,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 18:34:43,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 51. [2018-12-03 18:34:43,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 18:34:43,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 86 transitions. [2018-12-03 18:34:43,316 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 86 transitions. Word has length 7 [2018-12-03 18:34:43,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:43,317 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 86 transitions. [2018-12-03 18:34:43,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:34:43,317 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 86 transitions. [2018-12-03 18:34:43,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 18:34:43,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:43,318 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-12-03 18:34:43,319 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:43,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:43,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1865765160, now seen corresponding path program 1 times [2018-12-03 18:34:43,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:43,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:43,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:43,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:43,321 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:43,462 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 18:34:43,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:43,463 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:34:43,465 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-03 18:34:43,467 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [9], [20], [21] [2018-12-03 18:34:43,519 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:34:43,519 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:34:43,584 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:34:43,585 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 18:34:43,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:43,598 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:34:43,646 INFO L227 lantSequenceWeakener]: Weakened 6 states. On average, predicates are now at 41.67% of their original sizes. [2018-12-03 18:34:43,647 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:34:43,715 INFO L418 sIntCurrentIteration]: We unified 6 AI predicates to 6 [2018-12-03 18:34:43,716 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:34:43,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:34:43,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 10 [2018-12-03 18:34:43,718 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:43,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:34:43,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:34:43,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-03 18:34:43,719 INFO L87 Difference]: Start difference. First operand 51 states and 86 transitions. Second operand 7 states. [2018-12-03 18:34:45,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:45,419 INFO L93 Difference]: Finished difference Result 107 states and 193 transitions. [2018-12-03 18:34:45,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 18:34:45,419 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 18:34:45,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:45,422 INFO L225 Difference]: With dead ends: 107 [2018-12-03 18:34:45,422 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 18:34:45,422 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:34:45,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 18:34:45,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 64. [2018-12-03 18:34:45,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 18:34:45,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 112 transitions. [2018-12-03 18:34:45,444 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 112 transitions. Word has length 7 [2018-12-03 18:34:45,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:45,445 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 112 transitions. [2018-12-03 18:34:45,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:34:45,445 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 112 transitions. [2018-12-03 18:34:45,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 18:34:45,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:45,448 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:34:45,449 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:45,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:45,449 INFO L82 PathProgramCache]: Analyzing trace with hash 964893579, now seen corresponding path program 1 times [2018-12-03 18:34:45,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:45,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:45,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:45,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:45,451 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:45,598 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 18:34:45,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:45,599 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:34:45,599 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2018-12-03 18:34:45,600 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [29], [32], [34], [65], [66] [2018-12-03 18:34:45,601 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:34:45,601 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:34:45,630 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:34:45,630 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 18:34:45,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:45,643 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:34:45,663 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 52.08% of their original sizes. [2018-12-03 18:34:45,664 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:34:45,785 INFO L418 sIntCurrentIteration]: We unified 8 AI predicates to 8 [2018-12-03 18:34:45,785 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:34:45,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:34:45,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 14 [2018-12-03 18:34:45,786 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:45,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 18:34:45,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 18:34:45,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-03 18:34:45,788 INFO L87 Difference]: Start difference. First operand 64 states and 112 transitions. Second operand 9 states. [2018-12-03 18:34:47,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:47,710 INFO L93 Difference]: Finished difference Result 122 states and 222 transitions. [2018-12-03 18:34:47,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 18:34:47,711 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 18:34:47,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:47,712 INFO L225 Difference]: With dead ends: 122 [2018-12-03 18:34:47,712 INFO L226 Difference]: Without dead ends: 120 [2018-12-03 18:34:47,713 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 18:34:47,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-03 18:34:47,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 53. [2018-12-03 18:34:47,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 18:34:47,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 93 transitions. [2018-12-03 18:34:47,730 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 93 transitions. Word has length 9 [2018-12-03 18:34:47,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:47,731 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 93 transitions. [2018-12-03 18:34:47,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 18:34:47,731 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 93 transitions. [2018-12-03 18:34:47,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 18:34:47,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:47,732 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:34:47,732 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:47,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:47,733 INFO L82 PathProgramCache]: Analyzing trace with hash 101966393, now seen corresponding path program 1 times [2018-12-03 18:34:47,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:47,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:47,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:47,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:47,734 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:47,860 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 18:34:47,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:47,860 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:34:47,860 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2018-12-03 18:34:47,860 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [20], [22], [25], [29], [32], [65], [66] [2018-12-03 18:34:47,862 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:34:47,862 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:34:47,867 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:34:47,868 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 18:34:47,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:47,871 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:34:47,884 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 42.19% of their original sizes. [2018-12-03 18:34:47,884 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:34:48,386 INFO L418 sIntCurrentIteration]: We unified 9 AI predicates to 9 [2018-12-03 18:34:48,387 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:34:48,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:34:48,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 16 [2018-12-03 18:34:48,387 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:48,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 18:34:48,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 18:34:48,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-12-03 18:34:48,388 INFO L87 Difference]: Start difference. First operand 53 states and 93 transitions. Second operand 11 states. [2018-12-03 18:34:51,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:51,307 INFO L93 Difference]: Finished difference Result 177 states and 319 transitions. [2018-12-03 18:34:51,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 18:34:51,307 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-12-03 18:34:51,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:51,309 INFO L225 Difference]: With dead ends: 177 [2018-12-03 18:34:51,309 INFO L226 Difference]: Without dead ends: 125 [2018-12-03 18:34:51,314 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 18:34:51,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-03 18:34:51,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 79. [2018-12-03 18:34:51,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 18:34:51,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 138 transitions. [2018-12-03 18:34:51,354 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 138 transitions. Word has length 10 [2018-12-03 18:34:51,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:51,357 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 138 transitions. [2018-12-03 18:34:51,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 18:34:51,357 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 138 transitions. [2018-12-03 18:34:51,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 18:34:51,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:51,358 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:34:51,359 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:51,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:51,359 INFO L82 PathProgramCache]: Analyzing trace with hash 103259259, now seen corresponding path program 1 times [2018-12-03 18:34:51,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:51,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:51,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:51,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:51,362 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:51,577 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 18:34:51,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:51,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 18:34:51,578 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:51,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 18:34:51,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 18:34:51,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 18:34:51,579 INFO L87 Difference]: Start difference. First operand 79 states and 138 transitions. Second operand 8 states. [2018-12-03 18:34:52,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:52,677 INFO L93 Difference]: Finished difference Result 183 states and 319 transitions. [2018-12-03 18:34:52,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 18:34:52,677 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-12-03 18:34:52,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:52,679 INFO L225 Difference]: With dead ends: 183 [2018-12-03 18:34:52,679 INFO L226 Difference]: Without dead ends: 181 [2018-12-03 18:34:52,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:34:52,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-03 18:34:52,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 115. [2018-12-03 18:34:52,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 18:34:52,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 203 transitions. [2018-12-03 18:34:52,718 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 203 transitions. Word has length 10 [2018-12-03 18:34:52,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:52,718 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 203 transitions. [2018-12-03 18:34:52,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 18:34:52,719 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 203 transitions. [2018-12-03 18:34:52,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 18:34:52,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:52,720 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:34:52,720 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:52,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:52,721 INFO L82 PathProgramCache]: Analyzing trace with hash -176034432, now seen corresponding path program 1 times [2018-12-03 18:34:52,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:52,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:52,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:52,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:52,723 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:52,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:52,805 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 18:34:52,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:52,805 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:34:52,806 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2018-12-03 18:34:52,806 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [29], [32], [56], [57], [65], [67], [70] [2018-12-03 18:34:52,808 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:34:52,808 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:34:52,829 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:34:52,829 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 18:34:52,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:52,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:34:52,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:52,867 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 18:34:52,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:52,884 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:34:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:52,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:34:53,581 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 18:34:53,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:34:53,786 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 18:34:53,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:34:53,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 17 [2018-12-03 18:34:53,819 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:34:53,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:34:53,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:34:53,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:34:53,820 INFO L87 Difference]: Start difference. First operand 115 states and 203 transitions. Second operand 13 states. [2018-12-03 18:34:57,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:57,459 INFO L93 Difference]: Finished difference Result 306 states and 516 transitions. [2018-12-03 18:34:57,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 18:34:57,459 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2018-12-03 18:34:57,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:57,462 INFO L225 Difference]: With dead ends: 306 [2018-12-03 18:34:57,462 INFO L226 Difference]: Without dead ends: 304 [2018-12-03 18:34:57,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=495, Invalid=2157, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:34:57,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-12-03 18:34:57,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 182. [2018-12-03 18:34:57,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-03 18:34:57,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 331 transitions. [2018-12-03 18:34:57,526 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 331 transitions. Word has length 10 [2018-12-03 18:34:57,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:57,526 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 331 transitions. [2018-12-03 18:34:57,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:34:57,527 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 331 transitions. [2018-12-03 18:34:57,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 18:34:57,528 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:57,528 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:34:57,528 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:57,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:57,529 INFO L82 PathProgramCache]: Analyzing trace with hash -184622601, now seen corresponding path program 1 times [2018-12-03 18:34:57,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:57,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:57,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:57,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:57,531 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:57,680 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 18:34:57,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:57,681 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:34:57,681 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2018-12-03 18:34:57,681 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [29], [32], [56], [58], [61], [65], [66] [2018-12-03 18:34:57,682 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:34:57,683 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:34:57,686 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:34:57,687 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 18:34:57,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:57,690 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:34:57,702 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 42.59% of their original sizes. [2018-12-03 18:34:57,703 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:34:57,854 INFO L418 sIntCurrentIteration]: We unified 9 AI predicates to 9 [2018-12-03 18:34:57,854 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:34:57,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:34:57,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 16 [2018-12-03 18:34:57,855 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:57,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 18:34:57,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 18:34:57,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-12-03 18:34:57,856 INFO L87 Difference]: Start difference. First operand 182 states and 331 transitions. Second operand 11 states. [2018-12-03 18:35:03,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:03,522 INFO L93 Difference]: Finished difference Result 233 states and 423 transitions. [2018-12-03 18:35:03,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 18:35:03,522 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-12-03 18:35:03,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:03,523 INFO L225 Difference]: With dead ends: 233 [2018-12-03 18:35:03,523 INFO L226 Difference]: Without dead ends: 231 [2018-12-03 18:35:03,524 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:35:03,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-12-03 18:35:03,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 197. [2018-12-03 18:35:03,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-03 18:35:03,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 357 transitions. [2018-12-03 18:35:03,584 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 357 transitions. Word has length 10 [2018-12-03 18:35:03,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:03,584 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 357 transitions. [2018-12-03 18:35:03,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 18:35:03,585 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 357 transitions. [2018-12-03 18:35:03,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 18:35:03,586 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:03,586 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:03,586 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:03,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:03,586 INFO L82 PathProgramCache]: Analyzing trace with hash -184621319, now seen corresponding path program 1 times [2018-12-03 18:35:03,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:03,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:03,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:03,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:03,588 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:03,692 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 18:35:03,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:35:03,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 18:35:03,693 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:03,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 18:35:03,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 18:35:03,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 18:35:03,694 INFO L87 Difference]: Start difference. First operand 197 states and 357 transitions. Second operand 8 states. [2018-12-03 18:35:04,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:04,423 INFO L93 Difference]: Finished difference Result 269 states and 471 transitions. [2018-12-03 18:35:04,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 18:35:04,424 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-12-03 18:35:04,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:04,425 INFO L225 Difference]: With dead ends: 269 [2018-12-03 18:35:04,426 INFO L226 Difference]: Without dead ends: 267 [2018-12-03 18:35:04,426 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 18:35:04,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-12-03 18:35:04,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 202. [2018-12-03 18:35:04,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-03 18:35:04,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 365 transitions. [2018-12-03 18:35:04,483 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 365 transitions. Word has length 10 [2018-12-03 18:35:04,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:04,483 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 365 transitions. [2018-12-03 18:35:04,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 18:35:04,483 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 365 transitions. [2018-12-03 18:35:04,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 18:35:04,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:04,484 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:04,485 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:04,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:04,485 INFO L82 PathProgramCache]: Analyzing trace with hash -973282432, now seen corresponding path program 1 times [2018-12-03 18:35:04,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:04,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:04,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:04,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:04,486 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:04,611 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 18:35:04,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:04,612 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:04,612 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2018-12-03 18:35:04,612 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [38], [41], [56], [57], [65], [67], [70] [2018-12-03 18:35:04,613 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:04,614 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:04,617 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:35:04,618 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 18:35:04,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:04,620 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:35:04,634 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 42.59% of their original sizes. [2018-12-03 18:35:04,634 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:35:04,766 INFO L418 sIntCurrentIteration]: We unified 9 AI predicates to 9 [2018-12-03 18:35:04,766 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:35:04,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:35:04,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 16 [2018-12-03 18:35:04,767 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:04,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 18:35:04,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 18:35:04,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-12-03 18:35:04,768 INFO L87 Difference]: Start difference. First operand 202 states and 365 transitions. Second operand 11 states. [2018-12-03 18:35:07,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:07,738 INFO L93 Difference]: Finished difference Result 524 states and 957 transitions. [2018-12-03 18:35:07,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 18:35:07,738 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-12-03 18:35:07,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:07,740 INFO L225 Difference]: With dead ends: 524 [2018-12-03 18:35:07,741 INFO L226 Difference]: Without dead ends: 323 [2018-12-03 18:35:07,742 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 18:35:07,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-12-03 18:35:07,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 272. [2018-12-03 18:35:07,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-12-03 18:35:07,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 484 transitions. [2018-12-03 18:35:07,817 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 484 transitions. Word has length 10 [2018-12-03 18:35:07,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:07,817 INFO L480 AbstractCegarLoop]: Abstraction has 272 states and 484 transitions. [2018-12-03 18:35:07,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 18:35:07,817 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 484 transitions. [2018-12-03 18:35:07,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 18:35:07,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:07,818 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:07,818 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:07,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:07,819 INFO L82 PathProgramCache]: Analyzing trace with hash -973281662, now seen corresponding path program 1 times [2018-12-03 18:35:07,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:07,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:07,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:07,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:07,820 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:07,916 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 18:35:07,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:35:07,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 18:35:07,917 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:07,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 18:35:07,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 18:35:07,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 18:35:07,919 INFO L87 Difference]: Start difference. First operand 272 states and 484 transitions. Second operand 8 states. [2018-12-03 18:35:08,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:08,451 INFO L93 Difference]: Finished difference Result 389 states and 683 transitions. [2018-12-03 18:35:08,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 18:35:08,452 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-12-03 18:35:08,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:08,454 INFO L225 Difference]: With dead ends: 389 [2018-12-03 18:35:08,454 INFO L226 Difference]: Without dead ends: 387 [2018-12-03 18:35:08,455 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 18:35:08,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-12-03 18:35:08,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 324. [2018-12-03 18:35:08,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-12-03 18:35:08,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 576 transitions. [2018-12-03 18:35:08,529 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 576 transitions. Word has length 10 [2018-12-03 18:35:08,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:08,529 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 576 transitions. [2018-12-03 18:35:08,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 18:35:08,529 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 576 transitions. [2018-12-03 18:35:08,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 18:35:08,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:08,530 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:08,530 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:08,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:08,531 INFO L82 PathProgramCache]: Analyzing trace with hash -981870601, now seen corresponding path program 1 times [2018-12-03 18:35:08,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:08,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:08,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:08,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:08,532 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:08,631 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 18:35:08,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:08,632 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:08,632 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2018-12-03 18:35:08,632 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [38], [41], [56], [58], [61], [65], [66] [2018-12-03 18:35:08,633 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:08,633 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:08,645 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:08,645 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 18:35:08,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:08,655 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:08,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:08,655 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 18:35:08,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:08,664 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:08,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:08,746 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 18:35:08,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:08,826 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 18:35:08,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:08,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 17 [2018-12-03 18:35:08,846 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:08,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:35:08,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:35:08,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:35:08,847 INFO L87 Difference]: Start difference. First operand 324 states and 576 transitions. Second operand 13 states. [2018-12-03 18:35:10,241 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 18:35:11,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:11,271 INFO L93 Difference]: Finished difference Result 562 states and 959 transitions. [2018-12-03 18:35:11,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 18:35:11,272 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2018-12-03 18:35:11,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:11,275 INFO L225 Difference]: With dead ends: 562 [2018-12-03 18:35:11,275 INFO L226 Difference]: Without dead ends: 560 [2018-12-03 18:35:11,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=495, Invalid=2157, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:35:11,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2018-12-03 18:35:11,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 395. [2018-12-03 18:35:11,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-12-03 18:35:11,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 707 transitions. [2018-12-03 18:35:11,446 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 707 transitions. Word has length 10 [2018-12-03 18:35:11,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:11,447 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 707 transitions. [2018-12-03 18:35:11,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:35:11,447 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 707 transitions. [2018-12-03 18:35:11,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 18:35:11,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:11,448 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:11,448 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:11,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:11,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1101306322, now seen corresponding path program 1 times [2018-12-03 18:35:11,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:11,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:11,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:11,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:11,450 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:11,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:11,656 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 18:35:11,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:11,657 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:11,657 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2018-12-03 18:35:11,658 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [38], [41], [45], [47], [50], [56], [57] [2018-12-03 18:35:11,659 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:11,659 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:11,663 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:35:11,664 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 18:35:11,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:11,666 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:35:11,681 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 42.19% of their original sizes. [2018-12-03 18:35:11,681 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:35:11,973 INFO L418 sIntCurrentIteration]: We unified 9 AI predicates to 9 [2018-12-03 18:35:11,973 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:35:11,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:35:11,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 16 [2018-12-03 18:35:11,973 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:11,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 18:35:11,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 18:35:11,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-12-03 18:35:11,974 INFO L87 Difference]: Start difference. First operand 395 states and 707 transitions. Second operand 11 states. [2018-12-03 18:35:14,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:14,145 INFO L93 Difference]: Finished difference Result 556 states and 1009 transitions. [2018-12-03 18:35:14,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 18:35:14,145 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-12-03 18:35:14,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:14,149 INFO L225 Difference]: With dead ends: 556 [2018-12-03 18:35:14,149 INFO L226 Difference]: Without dead ends: 554 [2018-12-03 18:35:14,150 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2018-12-03 18:35:14,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-12-03 18:35:14,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 512. [2018-12-03 18:35:14,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2018-12-03 18:35:14,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 926 transitions. [2018-12-03 18:35:14,352 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 926 transitions. Word has length 10 [2018-12-03 18:35:14,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:14,352 INFO L480 AbstractCegarLoop]: Abstraction has 512 states and 926 transitions. [2018-12-03 18:35:14,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 18:35:14,352 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 926 transitions. [2018-12-03 18:35:14,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 18:35:14,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:14,353 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:14,354 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:14,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:14,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1102106644, now seen corresponding path program 1 times [2018-12-03 18:35:14,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:14,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:14,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:14,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:14,355 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:14,574 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 18:35:14,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:35:14,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 18:35:14,575 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:14,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 18:35:14,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 18:35:14,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 18:35:14,577 INFO L87 Difference]: Start difference. First operand 512 states and 926 transitions. Second operand 8 states. [2018-12-03 18:35:15,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:15,101 INFO L93 Difference]: Finished difference Result 591 states and 1063 transitions. [2018-12-03 18:35:15,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 18:35:15,101 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-12-03 18:35:15,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:15,105 INFO L225 Difference]: With dead ends: 591 [2018-12-03 18:35:15,105 INFO L226 Difference]: Without dead ends: 589 [2018-12-03 18:35:15,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:35:15,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-12-03 18:35:15,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 535. [2018-12-03 18:35:15,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-12-03 18:35:15,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 967 transitions. [2018-12-03 18:35:15,296 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 967 transitions. Word has length 10 [2018-12-03 18:35:15,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:15,296 INFO L480 AbstractCegarLoop]: Abstraction has 535 states and 967 transitions. [2018-12-03 18:35:15,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 18:35:15,296 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 967 transitions. [2018-12-03 18:35:15,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 18:35:15,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:15,297 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:15,298 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:15,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:15,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1000080215, now seen corresponding path program 1 times [2018-12-03 18:35:15,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:15,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:15,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:15,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:15,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:15,499 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 18:35:15,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:15,500 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:15,500 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 18:35:15,500 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [11], [14], [20], [22], [27], [45], [46], [47], [50] [2018-12-03 18:35:15,501 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:15,501 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:15,508 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:35:15,508 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 18:35:15,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:15,516 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:35:15,526 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 43.56% of their original sizes. [2018-12-03 18:35:15,526 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:35:15,686 INFO L418 sIntCurrentIteration]: We unified 12 AI predicates to 12 [2018-12-03 18:35:15,687 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:35:15,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:35:15,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 20 [2018-12-03 18:35:15,687 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:15,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 18:35:15,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 18:35:15,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-12-03 18:35:15,689 INFO L87 Difference]: Start difference. First operand 535 states and 967 transitions. Second operand 14 states. [2018-12-03 18:35:17,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:17,796 INFO L93 Difference]: Finished difference Result 984 states and 1780 transitions. [2018-12-03 18:35:17,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 18:35:17,796 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-12-03 18:35:17,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:17,800 INFO L225 Difference]: With dead ends: 984 [2018-12-03 18:35:17,800 INFO L226 Difference]: Without dead ends: 654 [2018-12-03 18:35:17,802 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 18:35:17,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2018-12-03 18:35:17,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 482. [2018-12-03 18:35:17,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-12-03 18:35:17,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 863 transitions. [2018-12-03 18:35:17,961 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 863 transitions. Word has length 13 [2018-12-03 18:35:17,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:17,961 INFO L480 AbstractCegarLoop]: Abstraction has 482 states and 863 transitions. [2018-12-03 18:35:17,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 18:35:17,961 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 863 transitions. [2018-12-03 18:35:17,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 18:35:17,962 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:17,962 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:17,962 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:17,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:17,963 INFO L82 PathProgramCache]: Analyzing trace with hash -86604803, now seen corresponding path program 1 times [2018-12-03 18:35:17,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:17,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:17,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:17,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:17,964 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:18,051 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 18:35:18,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:18,052 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:18,052 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 18:35:18,052 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [29], [32], [56], [58], [61], [65], [66], [67], [70] [2018-12-03 18:35:18,053 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:18,054 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:18,067 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:35:18,067 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 18:35:18,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:18,069 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:35:18,076 INFO L227 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 40.28% of their original sizes. [2018-12-03 18:35:18,077 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:35:18,246 INFO L418 sIntCurrentIteration]: We unified 12 AI predicates to 12 [2018-12-03 18:35:18,247 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:35:18,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:35:18,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 20 [2018-12-03 18:35:18,247 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:18,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 18:35:18,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 18:35:18,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-12-03 18:35:18,248 INFO L87 Difference]: Start difference. First operand 482 states and 863 transitions. Second operand 14 states. [2018-12-03 18:35:20,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:20,308 INFO L93 Difference]: Finished difference Result 864 states and 1567 transitions. [2018-12-03 18:35:20,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 18:35:20,309 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-12-03 18:35:20,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:20,311 INFO L225 Difference]: With dead ends: 864 [2018-12-03 18:35:20,311 INFO L226 Difference]: Without dead ends: 534 [2018-12-03 18:35:20,312 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2018-12-03 18:35:20,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-12-03 18:35:20,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 469. [2018-12-03 18:35:20,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-12-03 18:35:20,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 836 transitions. [2018-12-03 18:35:20,450 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 836 transitions. Word has length 13 [2018-12-03 18:35:20,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:20,450 INFO L480 AbstractCegarLoop]: Abstraction has 469 states and 836 transitions. [2018-12-03 18:35:20,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 18:35:20,450 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 836 transitions. [2018-12-03 18:35:20,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 18:35:20,451 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:20,451 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:20,451 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:20,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:20,452 INFO L82 PathProgramCache]: Analyzing trace with hash -63701769, now seen corresponding path program 1 times [2018-12-03 18:35:20,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:20,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:20,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:20,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:20,453 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:20,520 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 18:35:20,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:20,520 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:20,520 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 18:35:20,520 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [20], [21], [22], [25], [29], [32], [65], [67], [72] [2018-12-03 18:35:20,522 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:20,522 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:20,539 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:20,540 INFO L272 AbstractInterpreter]: Visited 12 different actions 54 times. Merged at 9 different actions 34 times. Widened at 2 different actions 5 times. Found 9 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 18:35:20,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:20,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:20,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:20,546 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 18:35:20,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:20,555 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:20,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:20,663 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 18:35:20,663 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:20,776 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 18:35:20,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 18:35:20,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 7] total 15 [2018-12-03 18:35:20,801 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:20,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:35:20,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:35:20,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:35:20,801 INFO L87 Difference]: Start difference. First operand 469 states and 836 transitions. Second operand 7 states. [2018-12-03 18:35:21,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:21,244 INFO L93 Difference]: Finished difference Result 833 states and 1481 transitions. [2018-12-03 18:35:21,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 18:35:21,245 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-12-03 18:35:21,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:21,247 INFO L225 Difference]: With dead ends: 833 [2018-12-03 18:35:21,247 INFO L226 Difference]: Without dead ends: 588 [2018-12-03 18:35:21,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-12-03 18:35:21,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2018-12-03 18:35:21,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 537. [2018-12-03 18:35:21,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-12-03 18:35:21,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 947 transitions. [2018-12-03 18:35:21,450 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 947 transitions. Word has length 13 [2018-12-03 18:35:21,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:21,450 INFO L480 AbstractCegarLoop]: Abstraction has 537 states and 947 transitions. [2018-12-03 18:35:21,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:35:21,450 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 947 transitions. [2018-12-03 18:35:21,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 18:35:21,451 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:21,451 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:21,452 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:21,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:21,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1761298639, now seen corresponding path program 1 times [2018-12-03 18:35:21,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:21,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:21,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:21,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:21,453 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:21,724 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 18:35:21,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:21,725 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:21,725 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 18:35:21,725 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [29], [32], [56], [57], [58], [61], [65], [67], [70] [2018-12-03 18:35:21,726 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:21,726 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:21,743 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:21,744 INFO L272 AbstractInterpreter]: Visited 12 different actions 42 times. Merged at 7 different actions 23 times. Widened at 1 different actions 3 times. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 18:35:21,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:21,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:21,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:21,759 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 18:35:21,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:21,768 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:21,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:21,907 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 18:35:21,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:21,963 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 18:35:21,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:21,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2018-12-03 18:35:21,982 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:21,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 18:35:21,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 18:35:21,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:35:21,983 INFO L87 Difference]: Start difference. First operand 537 states and 947 transitions. Second operand 10 states. [2018-12-03 18:35:23,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:23,391 INFO L93 Difference]: Finished difference Result 697 states and 1207 transitions. [2018-12-03 18:35:23,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 18:35:23,392 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-12-03 18:35:23,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:23,394 INFO L225 Difference]: With dead ends: 697 [2018-12-03 18:35:23,395 INFO L226 Difference]: Without dead ends: 695 [2018-12-03 18:35:23,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2018-12-03 18:35:23,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2018-12-03 18:35:23,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 553. [2018-12-03 18:35:23,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2018-12-03 18:35:23,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 977 transitions. [2018-12-03 18:35:23,555 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 977 transitions. Word has length 13 [2018-12-03 18:35:23,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:23,556 INFO L480 AbstractCegarLoop]: Abstraction has 553 states and 977 transitions. [2018-12-03 18:35:23,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 18:35:23,556 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 977 transitions. [2018-12-03 18:35:23,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 18:35:23,556 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:23,557 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:23,557 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:23,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:23,557 INFO L82 PathProgramCache]: Analyzing trace with hash 267374077, now seen corresponding path program 1 times [2018-12-03 18:35:23,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:23,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:23,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:23,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:23,558 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:23,652 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 18:35:23,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:23,653 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:23,653 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 18:35:23,653 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [38], [41], [56], [58], [61], [65], [66], [67], [70] [2018-12-03 18:35:23,654 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:23,654 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:23,669 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:23,670 INFO L272 AbstractInterpreter]: Visited 12 different actions 42 times. Merged at 7 different actions 23 times. Widened at 1 different actions 3 times. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 18:35:23,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:23,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:23,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:23,675 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 18:35:23,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:23,684 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:23,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:23,748 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 18:35:23,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:23,779 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 18:35:23,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:23,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2018-12-03 18:35:23,797 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:23,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 18:35:23,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 18:35:23,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:35:23,799 INFO L87 Difference]: Start difference. First operand 553 states and 977 transitions. Second operand 10 states. [2018-12-03 18:35:24,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:24,667 INFO L93 Difference]: Finished difference Result 711 states and 1233 transitions. [2018-12-03 18:35:24,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 18:35:24,668 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-12-03 18:35:24,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:24,670 INFO L225 Difference]: With dead ends: 711 [2018-12-03 18:35:24,670 INFO L226 Difference]: Without dead ends: 709 [2018-12-03 18:35:24,671 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 18:35:24,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-12-03 18:35:24,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 573. [2018-12-03 18:35:24,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-12-03 18:35:24,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1013 transitions. [2018-12-03 18:35:24,865 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1013 transitions. Word has length 13 [2018-12-03 18:35:24,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:24,865 INFO L480 AbstractCegarLoop]: Abstraction has 573 states and 1013 transitions. [2018-12-03 18:35:24,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 18:35:24,865 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1013 transitions. [2018-12-03 18:35:24,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 18:35:24,866 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:24,866 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:24,866 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:24,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:24,867 INFO L82 PathProgramCache]: Analyzing trace with hash 2115277519, now seen corresponding path program 1 times [2018-12-03 18:35:24,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:24,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:24,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:24,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:24,868 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:24,953 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 18:35:24,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:24,954 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:24,954 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 18:35:24,954 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [38], [41], [56], [57], [58], [61], [65], [67], [70] [2018-12-03 18:35:24,955 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:24,955 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:24,970 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:35:24,970 INFO L272 AbstractInterpreter]: Visited 12 different actions 46 times. Merged at 6 different actions 24 times. Widened at 1 different actions 4 times. Found 8 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 18:35:24,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:24,975 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:35:24,983 INFO L227 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 40.28% of their original sizes. [2018-12-03 18:35:24,983 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:35:25,171 INFO L418 sIntCurrentIteration]: We unified 12 AI predicates to 12 [2018-12-03 18:35:25,172 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:35:25,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:35:25,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 20 [2018-12-03 18:35:25,172 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:25,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 18:35:25,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 18:35:25,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-12-03 18:35:25,174 INFO L87 Difference]: Start difference. First operand 573 states and 1013 transitions. Second operand 14 states. [2018-12-03 18:35:27,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:27,241 INFO L93 Difference]: Finished difference Result 642 states and 1141 transitions. [2018-12-03 18:35:27,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 18:35:27,241 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-12-03 18:35:27,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:27,245 INFO L225 Difference]: With dead ends: 642 [2018-12-03 18:35:27,245 INFO L226 Difference]: Without dead ends: 640 [2018-12-03 18:35:27,246 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 18:35:27,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-12-03 18:35:27,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 579. [2018-12-03 18:35:27,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-12-03 18:35:27,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1023 transitions. [2018-12-03 18:35:27,453 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1023 transitions. Word has length 13 [2018-12-03 18:35:27,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:27,453 INFO L480 AbstractCegarLoop]: Abstraction has 579 states and 1023 transitions. [2018-12-03 18:35:27,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 18:35:27,453 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1023 transitions. [2018-12-03 18:35:27,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 18:35:27,454 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:27,454 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:27,454 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:27,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:27,455 INFO L82 PathProgramCache]: Analyzing trace with hash -2141517287, now seen corresponding path program 1 times [2018-12-03 18:35:27,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:27,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:27,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:27,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:27,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:27,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:27,636 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 18:35:27,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:27,637 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:27,637 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 18:35:27,637 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [38], [41], [45], [46], [47], [50], [56], [58], [63] [2018-12-03 18:35:27,638 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:27,638 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:27,655 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:27,656 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 18:35:27,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:27,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:27,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:27,657 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 18:35:27,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:27,668 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:27,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:27,828 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 18:35:27,828 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:27,884 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 18:35:27,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 18:35:27,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 8] total 16 [2018-12-03 18:35:27,903 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:27,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:35:27,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:35:27,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-12-03 18:35:27,903 INFO L87 Difference]: Start difference. First operand 579 states and 1023 transitions. Second operand 7 states. [2018-12-03 18:35:28,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:28,198 INFO L93 Difference]: Finished difference Result 1002 states and 1771 transitions. [2018-12-03 18:35:28,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 18:35:28,200 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-12-03 18:35:28,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:28,203 INFO L225 Difference]: With dead ends: 1002 [2018-12-03 18:35:28,203 INFO L226 Difference]: Without dead ends: 700 [2018-12-03 18:35:28,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:35:28,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2018-12-03 18:35:28,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 653. [2018-12-03 18:35:28,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2018-12-03 18:35:28,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 1143 transitions. [2018-12-03 18:35:28,372 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 1143 transitions. Word has length 13 [2018-12-03 18:35:28,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:28,373 INFO L480 AbstractCegarLoop]: Abstraction has 653 states and 1143 transitions. [2018-12-03 18:35:28,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:35:28,373 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 1143 transitions. [2018-12-03 18:35:28,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 18:35:28,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:28,373 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:28,374 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:28,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:28,374 INFO L82 PathProgramCache]: Analyzing trace with hash 2129075237, now seen corresponding path program 1 times [2018-12-03 18:35:28,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:28,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:28,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:28,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:28,375 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:28,477 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 18:35:28,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:28,478 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:28,478 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 18:35:28,478 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [11], [14], [20], [21], [22], [25], [45], [47], [52] [2018-12-03 18:35:28,479 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:28,479 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:28,483 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:35:28,483 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 18:35:28,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:28,486 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:35:28,494 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 42.42% of their original sizes. [2018-12-03 18:35:28,494 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:35:28,671 INFO L418 sIntCurrentIteration]: We unified 12 AI predicates to 12 [2018-12-03 18:35:28,672 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:35:28,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:35:28,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 20 [2018-12-03 18:35:28,672 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:28,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 18:35:28,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 18:35:28,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-12-03 18:35:28,673 INFO L87 Difference]: Start difference. First operand 653 states and 1143 transitions. Second operand 14 states. [2018-12-03 18:35:30,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:30,045 INFO L93 Difference]: Finished difference Result 1070 states and 1888 transitions. [2018-12-03 18:35:30,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 18:35:30,045 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-12-03 18:35:30,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:30,048 INFO L225 Difference]: With dead ends: 1070 [2018-12-03 18:35:30,048 INFO L226 Difference]: Without dead ends: 768 [2018-12-03 18:35:30,049 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 18:35:30,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2018-12-03 18:35:30,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 641. [2018-12-03 18:35:30,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2018-12-03 18:35:30,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1115 transitions. [2018-12-03 18:35:30,209 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1115 transitions. Word has length 13 [2018-12-03 18:35:30,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:30,209 INFO L480 AbstractCegarLoop]: Abstraction has 641 states and 1115 transitions. [2018-12-03 18:35:30,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 18:35:30,210 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1115 transitions. [2018-12-03 18:35:30,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 18:35:30,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:30,211 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:30,211 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:30,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:30,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1086284228, now seen corresponding path program 1 times [2018-12-03 18:35:30,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:30,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:30,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:30,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:30,212 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:30,325 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 18:35:30,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:30,326 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:30,326 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 18:35:30,326 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [11], [14], [20], [22], [27], [29], [32], [45], [46], [65], [67], [72] [2018-12-03 18:35:30,327 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:30,327 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:30,350 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:35:30,350 INFO L272 AbstractInterpreter]: Visited 15 different actions 69 times. Merged at 13 different actions 45 times. Widened at 3 different actions 5 times. Found 10 fixpoints after 7 different actions. Largest state had 0 variables. [2018-12-03 18:35:30,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:30,355 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:35:30,365 INFO L227 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 28.12% of their original sizes. [2018-12-03 18:35:30,366 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:35:30,599 INFO L418 sIntCurrentIteration]: We unified 14 AI predicates to 14 [2018-12-03 18:35:30,599 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:35:30,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:35:30,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [10] total 23 [2018-12-03 18:35:30,600 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:30,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:35:30,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:35:30,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:35:30,600 INFO L87 Difference]: Start difference. First operand 641 states and 1115 transitions. Second operand 15 states. [2018-12-03 18:35:34,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:34,194 INFO L93 Difference]: Finished difference Result 1884 states and 3366 transitions. [2018-12-03 18:35:34,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 18:35:34,194 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-12-03 18:35:34,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:34,199 INFO L225 Difference]: With dead ends: 1884 [2018-12-03 18:35:34,199 INFO L226 Difference]: Without dead ends: 1488 [2018-12-03 18:35:34,201 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=316, Invalid=1016, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 18:35:34,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2018-12-03 18:35:34,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1158. [2018-12-03 18:35:34,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1158 states. [2018-12-03 18:35:34,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1997 transitions. [2018-12-03 18:35:34,534 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1997 transitions. Word has length 15 [2018-12-03 18:35:34,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:34,535 INFO L480 AbstractCegarLoop]: Abstraction has 1158 states and 1997 transitions. [2018-12-03 18:35:34,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:35:34,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1997 transitions. [2018-12-03 18:35:34,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 18:35:34,536 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:34,536 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:34,536 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:34,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:34,537 INFO L82 PathProgramCache]: Analyzing trace with hash -750529310, now seen corresponding path program 1 times [2018-12-03 18:35:34,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:34,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:34,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:34,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:34,538 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:34,629 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 18:35:34,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:34,629 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:34,629 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 18:35:34,630 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [38], [41], [56], [57], [58], [63], [65], [67], [70] [2018-12-03 18:35:34,631 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:34,631 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:34,647 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:35:34,647 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 18:35:34,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:34,652 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:35:34,661 INFO L227 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 35.26% of their original sizes. [2018-12-03 18:35:34,661 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:35:34,914 INFO L418 sIntCurrentIteration]: We unified 14 AI predicates to 14 [2018-12-03 18:35:34,915 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:35:34,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:35:34,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [9] total 23 [2018-12-03 18:35:34,915 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:34,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 18:35:34,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 18:35:34,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-12-03 18:35:34,916 INFO L87 Difference]: Start difference. First operand 1158 states and 1997 transitions. Second operand 16 states. [2018-12-03 18:35:38,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:38,410 INFO L93 Difference]: Finished difference Result 1808 states and 3178 transitions. [2018-12-03 18:35:38,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 18:35:38,410 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-12-03 18:35:38,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:38,415 INFO L225 Difference]: With dead ends: 1808 [2018-12-03 18:35:38,415 INFO L226 Difference]: Without dead ends: 1583 [2018-12-03 18:35:38,417 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 18:35:38,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2018-12-03 18:35:38,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1430. [2018-12-03 18:35:38,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1430 states. [2018-12-03 18:35:38,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 2471 transitions. [2018-12-03 18:35:38,803 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 2471 transitions. Word has length 15 [2018-12-03 18:35:38,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:38,803 INFO L480 AbstractCegarLoop]: Abstraction has 1430 states and 2471 transitions. [2018-12-03 18:35:38,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 18:35:38,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 2471 transitions. [2018-12-03 18:35:38,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 18:35:38,805 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:38,805 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:38,805 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:38,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:38,805 INFO L82 PathProgramCache]: Analyzing trace with hash -502879080, now seen corresponding path program 1 times [2018-12-03 18:35:38,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:38,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:38,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:38,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:38,806 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:38,888 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 18:35:38,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:38,888 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:38,889 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 18:35:38,889 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [29], [32], [38], [41], [56], [57], [58], [61], [65], [67], [72] [2018-12-03 18:35:38,890 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:38,890 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:38,910 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:38,910 INFO L272 AbstractInterpreter]: Visited 14 different actions 66 times. Merged at 9 different actions 40 times. Widened at 3 different actions 6 times. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 18:35:38,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:38,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:38,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:38,921 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 18:35:38,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:38,929 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:38,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:39,025 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 18:35:39,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:39,097 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 18:35:39,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 18:35:39,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 17 [2018-12-03 18:35:39,117 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:39,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:35:39,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:35:39,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-12-03 18:35:39,118 INFO L87 Difference]: Start difference. First operand 1430 states and 2471 transitions. Second operand 7 states. [2018-12-03 18:35:40,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:40,438 INFO L93 Difference]: Finished difference Result 3059 states and 5263 transitions. [2018-12-03 18:35:40,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 18:35:40,439 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-03 18:35:40,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:40,448 INFO L225 Difference]: With dead ends: 3059 [2018-12-03 18:35:40,448 INFO L226 Difference]: Without dead ends: 2116 [2018-12-03 18:35:40,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2018-12-03 18:35:40,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2018-12-03 18:35:40,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 1705. [2018-12-03 18:35:40,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1705 states. [2018-12-03 18:35:40,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2945 transitions. [2018-12-03 18:35:40,942 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2945 transitions. Word has length 15 [2018-12-03 18:35:40,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:40,942 INFO L480 AbstractCegarLoop]: Abstraction has 1705 states and 2945 transitions. [2018-12-03 18:35:40,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:35:40,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2945 transitions. [2018-12-03 18:35:40,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 18:35:40,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:40,944 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:40,944 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:40,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:40,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1511389740, now seen corresponding path program 1 times [2018-12-03 18:35:40,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:40,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:40,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:40,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:40,945 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:41,064 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 18:35:41,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:41,065 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:41,065 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 18:35:41,065 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [20], [21], [38], [41], [56], [58], [63], [65], [67], [72] [2018-12-03 18:35:41,066 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:41,067 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:41,079 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:35:41,079 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 18:35:41,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:41,080 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:35:41,090 INFO L227 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 36.86% of their original sizes. [2018-12-03 18:35:41,090 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:35:41,382 INFO L418 sIntCurrentIteration]: We unified 14 AI predicates to 14 [2018-12-03 18:35:41,382 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:35:41,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:35:41,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [9] total 23 [2018-12-03 18:35:41,383 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:41,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 18:35:41,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 18:35:41,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-12-03 18:35:41,383 INFO L87 Difference]: Start difference. First operand 1705 states and 2945 transitions. Second operand 16 states. [2018-12-03 18:35:43,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:43,876 INFO L93 Difference]: Finished difference Result 2020 states and 3499 transitions. [2018-12-03 18:35:43,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 18:35:43,876 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-12-03 18:35:43,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:43,883 INFO L225 Difference]: With dead ends: 2020 [2018-12-03 18:35:43,883 INFO L226 Difference]: Without dead ends: 2016 [2018-12-03 18:35:43,883 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2018-12-03 18:35:43,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2016 states. [2018-12-03 18:35:44,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2016 to 1759. [2018-12-03 18:35:44,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1759 states. [2018-12-03 18:35:44,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 3032 transitions. [2018-12-03 18:35:44,380 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 3032 transitions. Word has length 15 [2018-12-03 18:35:44,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:44,380 INFO L480 AbstractCegarLoop]: Abstraction has 1759 states and 3032 transitions. [2018-12-03 18:35:44,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 18:35:44,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 3032 transitions. [2018-12-03 18:35:44,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 18:35:44,382 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:44,382 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:44,382 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:44,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:44,382 INFO L82 PathProgramCache]: Analyzing trace with hash -708189250, now seen corresponding path program 1 times [2018-12-03 18:35:44,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:44,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:44,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:44,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:44,383 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:44,476 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 18:35:44,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:44,476 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:44,476 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 18:35:44,477 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [11], [14], [20], [21], [38], [41], [45], [47], [52], [56], [58], [63] [2018-12-03 18:35:44,477 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:44,477 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:44,496 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:35:44,496 INFO L272 AbstractInterpreter]: Visited 15 different actions 73 times. Merged at 13 different actions 49 times. Widened at 3 different actions 6 times. Found 10 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 18:35:44,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:44,499 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:35:44,508 INFO L227 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 28.12% of their original sizes. [2018-12-03 18:35:44,508 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:35:44,750 INFO L418 sIntCurrentIteration]: We unified 14 AI predicates to 14 [2018-12-03 18:35:44,750 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:35:44,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:35:44,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [9] total 22 [2018-12-03 18:35:44,750 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:44,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:35:44,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:35:44,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:35:44,751 INFO L87 Difference]: Start difference. First operand 1759 states and 3032 transitions. Second operand 15 states. [2018-12-03 18:35:48,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:48,946 INFO L93 Difference]: Finished difference Result 4168 states and 7243 transitions. [2018-12-03 18:35:48,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 18:35:48,946 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-12-03 18:35:48,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:48,958 INFO L225 Difference]: With dead ends: 4168 [2018-12-03 18:35:48,958 INFO L226 Difference]: Without dead ends: 3094 [2018-12-03 18:35:48,961 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 18:35:48,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2018-12-03 18:35:49,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 2375. [2018-12-03 18:35:49,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2375 states. [2018-12-03 18:35:49,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 4060 transitions. [2018-12-03 18:35:49,743 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 4060 transitions. Word has length 15 [2018-12-03 18:35:49,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:49,743 INFO L480 AbstractCegarLoop]: Abstraction has 2375 states and 4060 transitions. [2018-12-03 18:35:49,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:35:49,743 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 4060 transitions. [2018-12-03 18:35:49,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:35:49,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:49,745 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:49,745 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:49,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:49,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1561364208, now seen corresponding path program 1 times [2018-12-03 18:35:49,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:49,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:49,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:49,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:49,746 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:49,859 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 18:35:49,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:49,859 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:49,860 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 18:35:49,860 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [20], [22], [25], [29], [32], [56], [58], [61], [65], [66], [67], [70] [2018-12-03 18:35:49,861 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:49,861 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:49,872 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:35:49,872 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 18:35:49,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:49,874 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:35:49,883 INFO L227 lantSequenceWeakener]: Weakened 14 states. On average, predicates are now at 36.9% of their original sizes. [2018-12-03 18:35:49,883 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:35:50,186 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 18:35:50,187 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:35:50,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:35:50,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 23 [2018-12-03 18:35:50,187 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:50,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 18:35:50,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 18:35:50,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-12-03 18:35:50,189 INFO L87 Difference]: Start difference. First operand 2375 states and 4060 transitions. Second operand 17 states. [2018-12-03 18:35:53,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:53,863 INFO L93 Difference]: Finished difference Result 2673 states and 4592 transitions. [2018-12-03 18:35:53,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 18:35:53,863 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 18:35:53,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:53,874 INFO L225 Difference]: With dead ends: 2673 [2018-12-03 18:35:53,874 INFO L226 Difference]: Without dead ends: 2671 [2018-12-03 18:35:53,875 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=950, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 18:35:53,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2671 states. [2018-12-03 18:35:54,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2671 to 2415. [2018-12-03 18:35:54,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2415 states. [2018-12-03 18:35:54,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2415 states to 2415 states and 4122 transitions. [2018-12-03 18:35:54,671 INFO L78 Accepts]: Start accepts. Automaton has 2415 states and 4122 transitions. Word has length 16 [2018-12-03 18:35:54,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:54,671 INFO L480 AbstractCegarLoop]: Abstraction has 2415 states and 4122 transitions. [2018-12-03 18:35:54,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 18:35:54,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2415 states and 4122 transitions. [2018-12-03 18:35:54,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:35:54,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:54,672 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:54,673 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:54,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:54,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1561364496, now seen corresponding path program 1 times [2018-12-03 18:35:54,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:54,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:54,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:54,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:54,674 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:54,960 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 18:35:54,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:54,960 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:54,960 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 18:35:54,960 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [20], [22], [25], [29], [32], [56], [57], [58], [61], [65], [67], [70] [2018-12-03 18:35:54,961 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:54,961 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:54,975 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:54,976 INFO L272 AbstractInterpreter]: Visited 15 different actions 53 times. Merged at 9 different actions 28 times. Widened at 1 different actions 4 times. Found 11 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 18:35:54,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:54,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:54,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:54,989 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 18:35:54,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:54,997 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:55,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:55,102 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 18:35:55,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:55,167 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 18:35:55,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:55,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-12-03 18:35:55,186 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:55,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 18:35:55,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 18:35:55,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-03 18:35:55,187 INFO L87 Difference]: Start difference. First operand 2415 states and 4122 transitions. Second operand 11 states. [2018-12-03 18:35:57,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:57,296 INFO L93 Difference]: Finished difference Result 3047 states and 5206 transitions. [2018-12-03 18:35:57,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 18:35:57,296 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-12-03 18:35:57,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:57,306 INFO L225 Difference]: With dead ends: 3047 [2018-12-03 18:35:57,307 INFO L226 Difference]: Without dead ends: 3043 [2018-12-03 18:35:57,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=211, Invalid=781, Unknown=0, NotChecked=0, Total=992 [2018-12-03 18:35:57,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3043 states. [2018-12-03 18:35:58,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3043 to 2443. [2018-12-03 18:35:58,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2443 states. [2018-12-03 18:35:58,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 4162 transitions. [2018-12-03 18:35:58,198 INFO L78 Accepts]: Start accepts. Automaton has 2443 states and 4162 transitions. Word has length 16 [2018-12-03 18:35:58,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:58,198 INFO L480 AbstractCegarLoop]: Abstraction has 2443 states and 4162 transitions. [2018-12-03 18:35:58,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 18:35:58,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 4162 transitions. [2018-12-03 18:35:58,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:35:58,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:58,199 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:58,200 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:58,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:58,200 INFO L82 PathProgramCache]: Analyzing trace with hash -767610290, now seen corresponding path program 2 times [2018-12-03 18:35:58,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:58,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:58,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:58,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:58,201 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:58,444 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 18:35:58,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:58,444 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:58,444 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:35:58,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:35:58,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:58,445 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 18:35:58,454 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:35:58,454 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:35:58,462 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 18:35:58,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:35:58,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:58,501 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 18:35:58,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:58,579 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 18:35:58,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:58,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2018-12-03 18:35:58,598 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:58,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:35:58,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:35:58,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2018-12-03 18:35:58,599 INFO L87 Difference]: Start difference. First operand 2443 states and 4162 transitions. Second operand 13 states. [2018-12-03 18:36:00,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:36:00,294 INFO L93 Difference]: Finished difference Result 2629 states and 4459 transitions. [2018-12-03 18:36:00,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 18:36:00,294 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-12-03 18:36:00,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:36:00,301 INFO L225 Difference]: With dead ends: 2629 [2018-12-03 18:36:00,301 INFO L226 Difference]: Without dead ends: 2628 [2018-12-03 18:36:00,302 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 18:36:00,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2628 states. [2018-12-03 18:36:01,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2628 to 2434. [2018-12-03 18:36:01,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2434 states. [2018-12-03 18:36:01,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 4146 transitions. [2018-12-03 18:36:01,087 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 4146 transitions. Word has length 16 [2018-12-03 18:36:01,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:01,087 INFO L480 AbstractCegarLoop]: Abstraction has 2434 states and 4146 transitions. [2018-12-03 18:36:01,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:36:01,087 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 4146 transitions. [2018-12-03 18:36:01,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:36:01,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:01,088 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:36:01,088 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:01,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:01,089 INFO L82 PathProgramCache]: Analyzing trace with hash -767609008, now seen corresponding path program 1 times [2018-12-03 18:36:01,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:01,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:01,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:36:01,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:01,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:01,158 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 18:36:01,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:01,158 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:36:01,159 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 18:36:01,159 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [29], [32], [45], [46], [56], [58], [61], [63], [65], [67], [70] [2018-12-03 18:36:01,160 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:36:01,160 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:36:01,172 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:36:01,173 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 18:36:01,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:01,174 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:36:01,185 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 38.89% of their original sizes. [2018-12-03 18:36:01,185 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:36:01,479 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 18:36:01,480 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:36:01,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:36:01,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [7] total 22 [2018-12-03 18:36:01,480 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:36:01,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 18:36:01,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 18:36:01,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-12-03 18:36:01,481 INFO L87 Difference]: Start difference. First operand 2434 states and 4146 transitions. Second operand 17 states. [2018-12-03 18:36:04,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:36:04,553 INFO L93 Difference]: Finished difference Result 2653 states and 4537 transitions. [2018-12-03 18:36:04,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 18:36:04,553 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 18:36:04,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:36:04,559 INFO L225 Difference]: With dead ends: 2653 [2018-12-03 18:36:04,559 INFO L226 Difference]: Without dead ends: 2651 [2018-12-03 18:36:04,562 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 18:36:04,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2651 states. [2018-12-03 18:36:05,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2651 to 2452. [2018-12-03 18:36:05,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2452 states. [2018-12-03 18:36:05,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2452 states and 4176 transitions. [2018-12-03 18:36:05,444 INFO L78 Accepts]: Start accepts. Automaton has 2452 states and 4176 transitions. Word has length 16 [2018-12-03 18:36:05,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:05,444 INFO L480 AbstractCegarLoop]: Abstraction has 2452 states and 4176 transitions. [2018-12-03 18:36:05,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 18:36:05,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 4176 transitions. [2018-12-03 18:36:05,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:36:05,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:05,446 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:36:05,446 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:05,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:05,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1823107031, now seen corresponding path program 2 times [2018-12-03 18:36:05,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:05,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:05,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:05,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:05,448 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:05,909 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 18:36:05,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:05,909 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:36:05,910 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:36:05,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:36:05,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:05,910 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 18:36:05,927 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:36:05,927 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:36:05,983 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 18:36:05,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:36:05,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:36:06,169 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 18:36:06,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:36:06,198 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 18:36:06,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:36:06,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-12-03 18:36:06,221 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:36:06,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 18:36:06,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 18:36:06,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-03 18:36:06,222 INFO L87 Difference]: Start difference. First operand 2452 states and 4176 transitions. Second operand 11 states. [2018-12-03 18:36:08,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:36:08,479 INFO L93 Difference]: Finished difference Result 3180 states and 5440 transitions. [2018-12-03 18:36:08,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 18:36:08,480 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-12-03 18:36:08,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:36:08,487 INFO L225 Difference]: With dead ends: 3180 [2018-12-03 18:36:08,487 INFO L226 Difference]: Without dead ends: 3176 [2018-12-03 18:36:08,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=211, Invalid=781, Unknown=0, NotChecked=0, Total=992 [2018-12-03 18:36:08,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3176 states. [2018-12-03 18:36:09,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3176 to 2549. [2018-12-03 18:36:09,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2549 states. [2018-12-03 18:36:09,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2549 states to 2549 states and 4329 transitions. [2018-12-03 18:36:09,411 INFO L78 Accepts]: Start accepts. Automaton has 2549 states and 4329 transitions. Word has length 16 [2018-12-03 18:36:09,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:09,411 INFO L480 AbstractCegarLoop]: Abstraction has 2549 states and 4329 transitions. [2018-12-03 18:36:09,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 18:36:09,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2549 states and 4329 transitions. [2018-12-03 18:36:09,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:36:09,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:09,413 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:36:09,413 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:09,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:09,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1823106549, now seen corresponding path program 1 times [2018-12-03 18:36:09,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:09,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:09,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:36:09,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:09,414 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:09,483 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 18:36:09,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:09,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:36:09,483 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 18:36:09,483 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [20], [21], [38], [41], [56], [58], [61], [65], [67], [70], [72] [2018-12-03 18:36:09,484 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:36:09,484 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:36:09,496 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:36:09,497 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 18:36:09,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:09,498 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:36:09,507 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 38.89% of their original sizes. [2018-12-03 18:36:09,507 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:36:09,799 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 18:36:09,799 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:36:09,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:36:09,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [7] total 22 [2018-12-03 18:36:09,799 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:36:09,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 18:36:09,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 18:36:09,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-12-03 18:36:09,800 INFO L87 Difference]: Start difference. First operand 2549 states and 4329 transitions. Second operand 17 states. [2018-12-03 18:36:12,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:36:12,463 INFO L93 Difference]: Finished difference Result 2795 states and 4779 transitions. [2018-12-03 18:36:12,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 18:36:12,463 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 18:36:12,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:36:12,469 INFO L225 Difference]: With dead ends: 2795 [2018-12-03 18:36:12,469 INFO L226 Difference]: Without dead ends: 2793 [2018-12-03 18:36:12,471 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 18:36:12,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2793 states. [2018-12-03 18:36:13,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2793 to 2575. [2018-12-03 18:36:13,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2575 states. [2018-12-03 18:36:13,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2575 states to 2575 states and 4372 transitions. [2018-12-03 18:36:13,429 INFO L78 Accepts]: Start accepts. Automaton has 2575 states and 4372 transitions. Word has length 16 [2018-12-03 18:36:13,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:13,429 INFO L480 AbstractCegarLoop]: Abstraction has 2575 states and 4372 transitions. [2018-12-03 18:36:13,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 18:36:13,430 INFO L276 IsEmpty]: Start isEmpty. Operand 2575 states and 4372 transitions. [2018-12-03 18:36:13,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:36:13,431 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:13,431 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:36:13,431 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:13,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:13,431 INFO L82 PathProgramCache]: Analyzing trace with hash 362530779, now seen corresponding path program 1 times [2018-12-03 18:36:13,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:13,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:13,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:13,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:13,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:13,878 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 18:36:13,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:13,878 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:36:13,878 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 18:36:13,879 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [38], [41], [45], [47], [50], [56], [57], [58], [61], [65], [67], [70] [2018-12-03 18:36:13,880 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:36:13,880 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:36:13,891 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:36:13,891 INFO L272 AbstractInterpreter]: Visited 15 different actions 52 times. Merged at 9 different actions 25 times. Widened at 1 different actions 4 times. Found 11 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 18:36:13,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:13,893 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:36:13,905 INFO L227 lantSequenceWeakener]: Weakened 14 states. On average, predicates are now at 36.9% of their original sizes. [2018-12-03 18:36:13,906 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:36:14,223 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 18:36:14,223 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:36:14,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:36:14,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 23 [2018-12-03 18:36:14,223 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:36:14,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 18:36:14,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 18:36:14,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-12-03 18:36:14,224 INFO L87 Difference]: Start difference. First operand 2575 states and 4372 transitions. Second operand 17 states. [2018-12-03 18:36:18,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:36:18,433 INFO L93 Difference]: Finished difference Result 3015 states and 5160 transitions. [2018-12-03 18:36:18,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 18:36:18,433 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 18:36:18,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:36:18,436 INFO L225 Difference]: With dead ends: 3015 [2018-12-03 18:36:18,436 INFO L226 Difference]: Without dead ends: 3013 [2018-12-03 18:36:18,437 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 18:36:18,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3013 states. [2018-12-03 18:36:19,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3013 to 2619. [2018-12-03 18:36:19,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2619 states. [2018-12-03 18:36:19,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2619 states to 2619 states and 4444 transitions. [2018-12-03 18:36:19,329 INFO L78 Accepts]: Start accepts. Automaton has 2619 states and 4444 transitions. Word has length 16 [2018-12-03 18:36:19,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:19,329 INFO L480 AbstractCegarLoop]: Abstraction has 2619 states and 4444 transitions. [2018-12-03 18:36:19,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 18:36:19,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2619 states and 4444 transitions. [2018-12-03 18:36:19,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:36:19,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:19,330 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:36:19,331 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:19,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:19,331 INFO L82 PathProgramCache]: Analyzing trace with hash -990864753, now seen corresponding path program 1 times [2018-12-03 18:36:19,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:19,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:19,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:19,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:19,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:19,435 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 18:36:19,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:19,436 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:36:19,436 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 18:36:19,436 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [11], [14], [20], [22], [25], [27], [29], [32], [45], [46], [65], [67], [72] [2018-12-03 18:36:19,437 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:36:19,437 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:36:19,455 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:36:19,455 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 18:36:19,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:19,458 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:36:19,469 INFO L227 lantSequenceWeakener]: Weakened 14 states. On average, predicates are now at 26.49% of their original sizes. [2018-12-03 18:36:19,469 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:36:19,742 INFO L418 sIntCurrentIteration]: We unified 17 AI predicates to 17 [2018-12-03 18:36:19,742 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:36:19,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:36:19,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [10] total 24 [2018-12-03 18:36:19,742 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:36:19,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 18:36:19,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 18:36:19,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-12-03 18:36:19,743 INFO L87 Difference]: Start difference. First operand 2619 states and 4444 transitions. Second operand 16 states. [2018-12-03 18:36:25,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:36:25,487 INFO L93 Difference]: Finished difference Result 5906 states and 10177 transitions. [2018-12-03 18:36:25,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 18:36:25,487 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-12-03 18:36:25,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:36:25,492 INFO L225 Difference]: With dead ends: 5906 [2018-12-03 18:36:25,492 INFO L226 Difference]: Without dead ends: 4919 [2018-12-03 18:36:25,495 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=571, Invalid=1879, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 18:36:25,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4919 states. [2018-12-03 18:36:26,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4919 to 2495. [2018-12-03 18:36:26,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2495 states. [2018-12-03 18:36:26,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 4223 transitions. [2018-12-03 18:36:26,573 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 4223 transitions. Word has length 18 [2018-12-03 18:36:26,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:26,573 INFO L480 AbstractCegarLoop]: Abstraction has 2495 states and 4223 transitions. [2018-12-03 18:36:26,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 18:36:26,573 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 4223 transitions. [2018-12-03 18:36:26,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:36:26,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:26,574 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:36:26,574 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:26,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:26,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1354217275, now seen corresponding path program 1 times [2018-12-03 18:36:26,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:26,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:26,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:26,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:26,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:26,641 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 18:36:26,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:26,642 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:36:26,642 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 18:36:26,642 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [29], [32], [38], [41], [56], [58], [61], [63], [65], [66], [67], [70] [2018-12-03 18:36:26,643 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:36:26,643 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:36:26,666 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:36:26,666 INFO L272 AbstractInterpreter]: Visited 15 different actions 77 times. Merged at 10 different actions 43 times. Widened at 4 different actions 7 times. Found 17 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 18:36:26,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:26,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:36:26,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:26,697 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 18:36:26,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:26,706 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:36:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:26,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:36:26,833 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 18:36:26,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:36:26,971 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 18:36:26,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:36:26,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 17 [2018-12-03 18:36:26,990 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:36:26,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 18:36:26,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 18:36:26,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:36:26,991 INFO L87 Difference]: Start difference. First operand 2495 states and 4223 transitions. Second operand 12 states. [2018-12-03 18:36:30,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:36:30,437 INFO L93 Difference]: Finished difference Result 3222 states and 5385 transitions. [2018-12-03 18:36:30,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 18:36:30,437 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-12-03 18:36:30,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:36:30,440 INFO L225 Difference]: With dead ends: 3222 [2018-12-03 18:36:30,441 INFO L226 Difference]: Without dead ends: 3220 [2018-12-03 18:36:30,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=292, Invalid=1190, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 18:36:30,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3220 states. [2018-12-03 18:36:31,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3220 to 2454. [2018-12-03 18:36:31,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2454 states. [2018-12-03 18:36:31,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2454 states to 2454 states and 4151 transitions. [2018-12-03 18:36:31,530 INFO L78 Accepts]: Start accepts. Automaton has 2454 states and 4151 transitions. Word has length 18 [2018-12-03 18:36:31,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:31,530 INFO L480 AbstractCegarLoop]: Abstraction has 2454 states and 4151 transitions. [2018-12-03 18:36:31,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 18:36:31,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2454 states and 4151 transitions. [2018-12-03 18:36:31,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:36:31,532 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:31,532 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:36:31,532 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:31,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:31,532 INFO L82 PathProgramCache]: Analyzing trace with hash 589748198, now seen corresponding path program 1 times [2018-12-03 18:36:31,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:31,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:31,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:31,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:31,533 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:31,632 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 18:36:31,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:31,632 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:36:31,632 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 18:36:31,632 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [20], [21], [38], [41], [56], [58], [63], [65], [67], [70], [72] [2018-12-03 18:36:31,633 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:36:31,633 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:36:31,649 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:36:31,650 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 18:36:31,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:31,656 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:36:31,667 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 30.83% of their original sizes. [2018-12-03 18:36:31,668 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:36:32,063 INFO L418 sIntCurrentIteration]: We unified 17 AI predicates to 17 [2018-12-03 18:36:32,064 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:36:32,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:36:32,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [9] total 25 [2018-12-03 18:36:32,064 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:36:32,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 18:36:32,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 18:36:32,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:36:32,065 INFO L87 Difference]: Start difference. First operand 2454 states and 4151 transitions. Second operand 18 states. [2018-12-03 18:36:35,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:36:35,724 INFO L93 Difference]: Finished difference Result 3321 states and 5693 transitions. [2018-12-03 18:36:35,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 18:36:35,724 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-12-03 18:36:35,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:36:35,728 INFO L225 Difference]: With dead ends: 3321 [2018-12-03 18:36:35,728 INFO L226 Difference]: Without dead ends: 2989 [2018-12-03 18:36:35,729 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=235, Invalid=955, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 18:36:35,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2018-12-03 18:36:36,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 2502. [2018-12-03 18:36:36,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2502 states. [2018-12-03 18:36:36,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2502 states to 2502 states and 4220 transitions. [2018-12-03 18:36:36,829 INFO L78 Accepts]: Start accepts. Automaton has 2502 states and 4220 transitions. Word has length 18 [2018-12-03 18:36:36,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:36,830 INFO L480 AbstractCegarLoop]: Abstraction has 2502 states and 4220 transitions. [2018-12-03 18:36:36,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 18:36:36,830 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 4220 transitions. [2018-12-03 18:36:36,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:36:36,831 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:36,831 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 18:36:36,831 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:36,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:36,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1629830792, now seen corresponding path program 1 times [2018-12-03 18:36:36,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:36,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:36,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:36,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:36,833 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:36,924 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 18:36:36,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:36,925 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:36:36,925 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 18:36:36,925 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [11], [14], [20], [21], [38], [41], [45], [47], [52], [56], [58], [63], [65], [67], [70] [2018-12-03 18:36:36,926 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:36:36,926 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:36:36,958 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:36:36,958 INFO L272 AbstractInterpreter]: Visited 18 different actions 90 times. Merged at 16 different actions 58 times. Widened at 3 different actions 8 times. Found 16 fixpoints after 8 different actions. Largest state had 0 variables. [2018-12-03 18:36:36,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:36,968 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:36:36,981 INFO L227 lantSequenceWeakener]: Weakened 14 states. On average, predicates are now at 25.89% of their original sizes. [2018-12-03 18:36:36,981 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:36:37,487 INFO L418 sIntCurrentIteration]: We unified 17 AI predicates to 17 [2018-12-03 18:36:37,487 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:36:37,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:36:37,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [9] total 25 [2018-12-03 18:36:37,488 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:36:37,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 18:36:37,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 18:36:37,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:36:37,488 INFO L87 Difference]: Start difference. First operand 2502 states and 4220 transitions. Second operand 18 states. [2018-12-03 18:36:45,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:36:45,306 INFO L93 Difference]: Finished difference Result 7939 states and 13602 transitions. [2018-12-03 18:36:45,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 18:36:45,306 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-12-03 18:36:45,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:36:45,311 INFO L225 Difference]: With dead ends: 7939 [2018-12-03 18:36:45,312 INFO L226 Difference]: Without dead ends: 6466 [2018-12-03 18:36:45,315 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=642, Invalid=2328, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 18:36:45,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6466 states. [2018-12-03 18:36:47,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6466 to 4612. [2018-12-03 18:36:47,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4612 states. [2018-12-03 18:36:47,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4612 states to 4612 states and 7710 transitions. [2018-12-03 18:36:47,533 INFO L78 Accepts]: Start accepts. Automaton has 4612 states and 7710 transitions. Word has length 18 [2018-12-03 18:36:47,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:47,533 INFO L480 AbstractCegarLoop]: Abstraction has 4612 states and 7710 transitions. [2018-12-03 18:36:47,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 18:36:47,534 INFO L276 IsEmpty]: Start isEmpty. Operand 4612 states and 7710 transitions. [2018-12-03 18:36:47,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:36:47,536 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:47,536 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:36:47,536 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:47,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:47,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1537299396, now seen corresponding path program 1 times [2018-12-03 18:36:47,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:47,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:47,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:47,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:47,538 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:48,009 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 18:36:48,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:48,010 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:36:48,010 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 18:36:48,010 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [29], [32], [38], [41], [56], [57], [58], [61], [65], [67], [70], [72] [2018-12-03 18:36:48,011 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:36:48,012 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:36:48,047 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:36:48,047 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 18:36:48,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:48,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:36:48,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:48,049 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 18:36:48,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:48,059 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:36:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:48,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:36:48,155 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 18:36:48,155 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:36:48,247 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 18:36:48,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:36:48,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 17 [2018-12-03 18:36:48,267 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:36:48,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 18:36:48,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 18:36:48,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:36:48,268 INFO L87 Difference]: Start difference. First operand 4612 states and 7710 transitions. Second operand 12 states. [2018-12-03 18:36:53,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:36:53,810 INFO L93 Difference]: Finished difference Result 5883 states and 9847 transitions. [2018-12-03 18:36:53,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 18:36:53,810 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-12-03 18:36:53,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:36:53,816 INFO L225 Difference]: With dead ends: 5883 [2018-12-03 18:36:53,816 INFO L226 Difference]: Without dead ends: 5881 [2018-12-03 18:36:53,818 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 18:36:53,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5881 states. [2018-12-03 18:36:56,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5881 to 4485. [2018-12-03 18:36:56,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4485 states. [2018-12-03 18:36:56,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4485 states to 4485 states and 7495 transitions. [2018-12-03 18:36:56,079 INFO L78 Accepts]: Start accepts. Automaton has 4485 states and 7495 transitions. Word has length 18 [2018-12-03 18:36:56,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:56,079 INFO L480 AbstractCegarLoop]: Abstraction has 4485 states and 7495 transitions. [2018-12-03 18:36:56,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 18:36:56,079 INFO L276 IsEmpty]: Start isEmpty. Operand 4485 states and 7495 transitions. [2018-12-03 18:36:56,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 18:36:56,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:56,081 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:36:56,081 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:56,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:56,081 INFO L82 PathProgramCache]: Analyzing trace with hash -398538747, now seen corresponding path program 1 times [2018-12-03 18:36:56,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:56,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:56,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:56,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:56,082 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:56,337 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 18:36:56,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:56,338 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:36:56,338 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 18:36:56,338 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [11], [14], [16], [20], [21], [22], [27], [45], [47], [50], [52] [2018-12-03 18:36:56,339 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:36:56,339 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:36:56,349 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:36:56,349 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 18:36:56,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:56,350 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:36:56,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:56,350 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 18:36:56,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:56,360 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:36:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:56,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:36:56,459 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 18:36:56,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:36:56,530 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 18:36:56,558 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:36:56,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [9] total 18 [2018-12-03 18:36:56,559 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:36:56,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:36:56,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:36:56,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:36:56,559 INFO L87 Difference]: Start difference. First operand 4485 states and 7495 transitions. Second operand 7 states. [2018-12-03 18:37:00,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:37:00,952 INFO L93 Difference]: Finished difference Result 10817 states and 17973 transitions. [2018-12-03 18:37:00,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 18:37:00,952 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-12-03 18:37:00,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:37:00,960 INFO L225 Difference]: With dead ends: 10817 [2018-12-03 18:37:00,960 INFO L226 Difference]: Without dead ends: 7115 [2018-12-03 18:37:00,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2018-12-03 18:37:00,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7115 states. [2018-12-03 18:37:03,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7115 to 5343. [2018-12-03 18:37:03,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5343 states. [2018-12-03 18:37:04,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5343 states to 5343 states and 8874 transitions. [2018-12-03 18:37:04,002 INFO L78 Accepts]: Start accepts. Automaton has 5343 states and 8874 transitions. Word has length 20 [2018-12-03 18:37:04,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:37:04,002 INFO L480 AbstractCegarLoop]: Abstraction has 5343 states and 8874 transitions. [2018-12-03 18:37:04,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:37:04,002 INFO L276 IsEmpty]: Start isEmpty. Operand 5343 states and 8874 transitions. [2018-12-03 18:37:04,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 18:37:04,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:37:04,004 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 18:37:04,004 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:37:04,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:04,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1680206499, now seen corresponding path program 1 times [2018-12-03 18:37:04,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:37:04,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:04,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:37:04,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:04,005 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:37:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:37:04,194 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 18:37:04,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:04,194 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:37:04,194 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 18:37:04,195 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [11], [16], [20], [21], [29], [32], [45], [47], [52], [56], [58], [63], [65], [67], [70] [2018-12-03 18:37:04,196 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:37:04,196 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:37:04,218 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:37:04,218 INFO L272 AbstractInterpreter]: Visited 18 different actions 93 times. Merged at 16 different actions 60 times. Widened at 4 different actions 7 times. Found 16 fixpoints after 8 different actions. Largest state had 0 variables. [2018-12-03 18:37:04,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:04,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:37:04,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:04,221 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 18:37:04,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:37:04,230 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:37:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:37:04,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:37:04,414 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 18:37:04,415 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:37:04,490 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 18:37:04,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 18:37:04,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 8] total 20 [2018-12-03 18:37:04,510 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:37:04,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:37:04,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:37:04,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-12-03 18:37:04,511 INFO L87 Difference]: Start difference. First operand 5343 states and 8874 transitions. Second operand 7 states. [2018-12-03 18:37:08,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:37:08,938 INFO L93 Difference]: Finished difference Result 8918 states and 14818 transitions. [2018-12-03 18:37:08,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 18:37:08,939 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-12-03 18:37:08,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:37:08,944 INFO L225 Difference]: With dead ends: 8918 [2018-12-03 18:37:08,945 INFO L226 Difference]: Without dead ends: 6334 [2018-12-03 18:37:08,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2018-12-03 18:37:08,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6334 states. [2018-12-03 18:37:12,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6334 to 5653. [2018-12-03 18:37:12,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5653 states. [2018-12-03 18:37:12,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5653 states to 5653 states and 9351 transitions. [2018-12-03 18:37:12,202 INFO L78 Accepts]: Start accepts. Automaton has 5653 states and 9351 transitions. Word has length 20 [2018-12-03 18:37:12,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:37:12,202 INFO L480 AbstractCegarLoop]: Abstraction has 5653 states and 9351 transitions. [2018-12-03 18:37:12,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:37:12,202 INFO L276 IsEmpty]: Start isEmpty. Operand 5653 states and 9351 transitions. [2018-12-03 18:37:12,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 18:37:12,204 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:37:12,204 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 18:37:12,204 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:37:12,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:12,204 INFO L82 PathProgramCache]: Analyzing trace with hash -276638985, now seen corresponding path program 1 times [2018-12-03 18:37:12,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:37:12,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:12,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:37:12,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:12,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:37:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:37:12,305 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 18:37:12,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:12,305 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:37:12,305 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 18:37:12,305 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [29], [32], [56], [57], [58], [61], [65], [67], [72] [2018-12-03 18:37:12,306 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:37:12,306 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:37:12,320 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:37:12,320 INFO L272 AbstractInterpreter]: Visited 12 different actions 52 times. Merged at 9 different actions 33 times. Widened at 2 different actions 4 times. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 18:37:12,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:12,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:37:12,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:12,326 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 18:37:12,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:37:12,335 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:37:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:37:12,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:37:12,430 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 18:37:12,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:37:12,508 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 18:37:12,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 18:37:12,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 7] total 18 [2018-12-03 18:37:12,527 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:37:12,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:37:12,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:37:12,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:37:12,528 INFO L87 Difference]: Start difference. First operand 5653 states and 9351 transitions. Second operand 7 states. [2018-12-03 18:37:16,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:37:16,948 INFO L93 Difference]: Finished difference Result 8764 states and 14551 transitions. [2018-12-03 18:37:16,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 18:37:16,948 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-12-03 18:37:16,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:37:16,955 INFO L225 Difference]: With dead ends: 8764 [2018-12-03 18:37:16,955 INFO L226 Difference]: Without dead ends: 6340 [2018-12-03 18:37:16,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2018-12-03 18:37:16,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6340 states. [2018-12-03 18:37:20,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6340 to 6093. [2018-12-03 18:37:20,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6093 states. [2018-12-03 18:37:20,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6093 states to 6093 states and 10017 transitions. [2018-12-03 18:37:20,501 INFO L78 Accepts]: Start accepts. Automaton has 6093 states and 10017 transitions. Word has length 20 [2018-12-03 18:37:20,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:37:20,501 INFO L480 AbstractCegarLoop]: Abstraction has 6093 states and 10017 transitions. [2018-12-03 18:37:20,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:37:20,501 INFO L276 IsEmpty]: Start isEmpty. Operand 6093 states and 10017 transitions. [2018-12-03 18:37:20,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 18:37:20,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:37:20,503 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:37:20,503 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:37:20,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:20,503 INFO L82 PathProgramCache]: Analyzing trace with hash -627995389, now seen corresponding path program 1 times [2018-12-03 18:37:20,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:37:20,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:20,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:37:20,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:20,504 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:37:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:37:20,655 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 18:37:20,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:20,655 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:37:20,655 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 18:37:20,656 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [11], [16], [20], [21], [29], [32], [45], [47], [50], [52], [56], [58], [63] [2018-12-03 18:37:20,656 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:37:20,657 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:37:20,679 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:37:20,680 INFO L272 AbstractInterpreter]: Visited 16 different actions 77 times. Merged at 14 different actions 47 times. Widened at 4 different actions 4 times. Found 15 fixpoints after 9 different actions. Largest state had 0 variables. [2018-12-03 18:37:20,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:20,684 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:37:20,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:20,684 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 18:37:20,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:37:20,693 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:37:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:37:20,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:37:20,808 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 18:37:20,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:37:20,895 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 18:37:20,917 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:37:20,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [9] total 19 [2018-12-03 18:37:20,917 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:37:20,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:37:20,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:37:20,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2018-12-03 18:37:20,918 INFO L87 Difference]: Start difference. First operand 6093 states and 10017 transitions. Second operand 7 states. [2018-12-03 18:37:25,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:37:25,890 INFO L93 Difference]: Finished difference Result 10001 states and 16335 transitions. [2018-12-03 18:37:25,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 18:37:25,890 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-12-03 18:37:25,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:37:25,897 INFO L225 Difference]: With dead ends: 10001 [2018-12-03 18:37:25,897 INFO L226 Difference]: Without dead ends: 7350 [2018-12-03 18:37:25,902 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 18:37:25,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7350 states. [2018-12-03 18:37:29,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7350 to 6413. [2018-12-03 18:37:29,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6413 states. [2018-12-03 18:37:29,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6413 states to 6413 states and 10527 transitions. [2018-12-03 18:37:29,929 INFO L78 Accepts]: Start accepts. Automaton has 6413 states and 10527 transitions. Word has length 20 [2018-12-03 18:37:29,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:37:29,929 INFO L480 AbstractCegarLoop]: Abstraction has 6413 states and 10527 transitions. [2018-12-03 18:37:29,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:37:29,929 INFO L276 IsEmpty]: Start isEmpty. Operand 6413 states and 10527 transitions. [2018-12-03 18:37:29,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 18:37:29,931 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:37:29,931 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 18:37:29,931 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:37:29,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:29,931 INFO L82 PathProgramCache]: Analyzing trace with hash 149320160, now seen corresponding path program 1 times [2018-12-03 18:37:29,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:37:29,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:29,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:37:29,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:29,932 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:37:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:37:30,023 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 18:37:30,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:30,023 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:37:30,023 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 18:37:30,023 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [38], [41], [56], [58], [63], [65], [66], [67], [70] [2018-12-03 18:37:30,024 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:37:30,024 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:37:30,043 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:37:30,043 INFO L272 AbstractInterpreter]: Visited 12 different actions 52 times. Merged at 9 different actions 33 times. Widened at 2 different actions 4 times. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 18:37:30,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:30,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:37:30,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:30,051 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 18:37:30,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:37:30,059 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:37:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:37:30,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:37:30,152 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 18:37:30,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:37:30,230 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 18:37:30,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 18:37:30,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 17 [2018-12-03 18:37:30,249 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:37:30,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:37:30,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:37:30,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-12-03 18:37:30,250 INFO L87 Difference]: Start difference. First operand 6413 states and 10527 transitions. Second operand 7 states. [2018-12-03 18:37:34,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:37:34,967 INFO L93 Difference]: Finished difference Result 11616 states and 19036 transitions. [2018-12-03 18:37:34,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 18:37:34,967 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-12-03 18:37:34,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:37:34,973 INFO L225 Difference]: With dead ends: 11616 [2018-12-03 18:37:34,973 INFO L226 Difference]: Without dead ends: 7130 [2018-12-03 18:37:34,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2018-12-03 18:37:34,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7130 states. [2018-12-03 18:37:38,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7130 to 6546. [2018-12-03 18:37:38,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6546 states. [2018-12-03 18:37:38,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6546 states to 6546 states and 10682 transitions. [2018-12-03 18:37:38,804 INFO L78 Accepts]: Start accepts. Automaton has 6546 states and 10682 transitions. Word has length 20 [2018-12-03 18:37:38,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:37:38,805 INFO L480 AbstractCegarLoop]: Abstraction has 6546 states and 10682 transitions. [2018-12-03 18:37:38,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:37:38,805 INFO L276 IsEmpty]: Start isEmpty. Operand 6546 states and 10682 transitions. [2018-12-03 18:37:38,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 18:37:38,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:37:38,807 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:37:38,807 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:37:38,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:38,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1958649716, now seen corresponding path program 1 times [2018-12-03 18:37:38,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:37:38,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:38,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:37:38,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:38,808 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:37:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:37:38,911 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 18:37:38,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:38,911 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:37:38,911 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-03 18:37:38,912 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [29], [32], [56], [57], [58], [61], [65], [67], [70], [72] [2018-12-03 18:37:38,912 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:37:38,912 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:37:38,930 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:37:38,930 INFO L272 AbstractInterpreter]: Visited 13 different actions 59 times. Merged at 10 different actions 34 times. Widened at 3 different actions 5 times. Found 14 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 18:37:38,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:38,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:37:38,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:38,932 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 18:37:38,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:37:38,942 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:37:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:37:38,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:37:39,100 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 18:37:39,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:37:39,238 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 18:37:39,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:37:39,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 25 [2018-12-03 18:37:39,259 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:37:39,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 18:37:39,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 18:37:39,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2018-12-03 18:37:39,260 INFO L87 Difference]: Start difference. First operand 6546 states and 10682 transitions. Second operand 18 states. [2018-12-03 18:37:52,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:37:52,340 INFO L93 Difference]: Finished difference Result 8576 states and 13936 transitions. [2018-12-03 18:37:52,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 18:37:52,340 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-12-03 18:37:52,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:37:52,349 INFO L225 Difference]: With dead ends: 8576 [2018-12-03 18:37:52,349 INFO L226 Difference]: Without dead ends: 8522 [2018-12-03 18:37:52,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 4700 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2347, Invalid=11695, Unknown=0, NotChecked=0, Total=14042 [2018-12-03 18:37:52,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8522 states. [2018-12-03 18:37:56,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8522 to 6734. [2018-12-03 18:37:56,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6734 states. [2018-12-03 18:37:56,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6734 states to 6734 states and 10997 transitions. [2018-12-03 18:37:56,704 INFO L78 Accepts]: Start accepts. Automaton has 6734 states and 10997 transitions. Word has length 21 [2018-12-03 18:37:56,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:37:56,705 INFO L480 AbstractCegarLoop]: Abstraction has 6734 states and 10997 transitions. [2018-12-03 18:37:56,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 18:37:56,705 INFO L276 IsEmpty]: Start isEmpty. Operand 6734 states and 10997 transitions. [2018-12-03 18:37:56,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 18:37:56,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:37:56,707 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 18:37:56,707 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:37:56,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:56,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1950061547, now seen corresponding path program 1 times [2018-12-03 18:37:56,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:37:56,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:56,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:37:56,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:56,708 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:37:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:37:56,835 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 18:37:56,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:56,836 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:37:56,836 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-03 18:37:56,836 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [29], [32], [56], [58], [61], [65], [66], [67], [70], [72] [2018-12-03 18:37:56,837 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:37:56,837 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:37:56,854 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:37:56,855 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 18:37:56,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:56,869 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:37:56,880 INFO L227 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 33.33% of their original sizes. [2018-12-03 18:37:56,880 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:37:57,221 INFO L418 sIntCurrentIteration]: We unified 20 AI predicates to 20 [2018-12-03 18:37:57,221 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:37:57,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:37:57,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [11] total 27 [2018-12-03 18:37:57,222 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:37:57,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 18:37:57,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 18:37:57,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:37:57,223 INFO L87 Difference]: Start difference. First operand 6734 states and 10997 transitions. Second operand 18 states. [2018-12-03 18:38:03,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:38:03,458 INFO L93 Difference]: Finished difference Result 6980 states and 11378 transitions. [2018-12-03 18:38:03,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 18:38:03,458 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-12-03 18:38:03,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:38:03,465 INFO L225 Difference]: With dead ends: 6980 [2018-12-03 18:38:03,465 INFO L226 Difference]: Without dead ends: 6978 [2018-12-03 18:38:03,467 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 18:38:03,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6978 states. [2018-12-03 18:38:07,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6978 to 6757. [2018-12-03 18:38:07,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6757 states. [2018-12-03 18:38:07,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6757 states to 6757 states and 11033 transitions. [2018-12-03 18:38:07,539 INFO L78 Accepts]: Start accepts. Automaton has 6757 states and 11033 transitions. Word has length 21 [2018-12-03 18:38:07,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:38:07,539 INFO L480 AbstractCegarLoop]: Abstraction has 6757 states and 11033 transitions. [2018-12-03 18:38:07,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 18:38:07,540 INFO L276 IsEmpty]: Start isEmpty. Operand 6757 states and 11033 transitions. [2018-12-03 18:38:07,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 18:38:07,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:38:07,542 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:38:07,542 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:38:07,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:38:07,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1950062829, now seen corresponding path program 1 times [2018-12-03 18:38:07,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:38:07,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:07,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:38:07,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:07,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:38:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:38:07,643 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 18:38:07,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:38:07,643 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:38:07,643 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-03 18:38:07,644 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [29], [32], [45], [46], [56], [58], [61], [63], [65], [67], [70], [72] [2018-12-03 18:38:07,644 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:38:07,645 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:38:07,663 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:38:07,663 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 18:38:07,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:38:07,669 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:38:07,679 INFO L227 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 33.33% of their original sizes. [2018-12-03 18:38:07,679 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:38:08,032 INFO L418 sIntCurrentIteration]: We unified 20 AI predicates to 20 [2018-12-03 18:38:08,032 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:38:08,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:38:08,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [10] total 26 [2018-12-03 18:38:08,032 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:38:08,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 18:38:08,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 18:38:08,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:38:08,033 INFO L87 Difference]: Start difference. First operand 6757 states and 11033 transitions. Second operand 18 states. [2018-12-03 18:38:15,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:38:15,248 INFO L93 Difference]: Finished difference Result 7037 states and 11459 transitions. [2018-12-03 18:38:15,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 18:38:15,248 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-12-03 18:38:15,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:38:15,255 INFO L225 Difference]: With dead ends: 7037 [2018-12-03 18:38:15,255 INFO L226 Difference]: Without dead ends: 7035 [2018-12-03 18:38:15,256 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=182, Invalid=940, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 18:38:15,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7035 states. [2018-12-03 18:38:19,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7035 to 6757. [2018-12-03 18:38:19,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6757 states. [2018-12-03 18:38:19,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6757 states to 6757 states and 11030 transitions. [2018-12-03 18:38:19,263 INFO L78 Accepts]: Start accepts. Automaton has 6757 states and 11030 transitions. Word has length 21 [2018-12-03 18:38:19,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:38:19,263 INFO L480 AbstractCegarLoop]: Abstraction has 6757 states and 11030 transitions. [2018-12-03 18:38:19,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 18:38:19,263 INFO L276 IsEmpty]: Start isEmpty. Operand 6757 states and 11030 transitions. [2018-12-03 18:38:19,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 18:38:19,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:38:19,265 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 18:38:19,265 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:38:19,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:38:19,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1665065493, now seen corresponding path program 1 times [2018-12-03 18:38:19,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:38:19,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:19,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:38:19,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:19,266 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:38:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:38:19,612 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 18:38:19,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:38:19,613 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:38:19,613 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-03 18:38:19,613 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [38], [41], [56], [57], [58], [61], [63], [65], [67], [70] [2018-12-03 18:38:19,614 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:38:19,614 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:38:19,630 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:38:19,630 INFO L272 AbstractInterpreter]: Visited 13 different actions 59 times. Merged at 8 different actions 32 times. Widened at 2 different actions 5 times. Found 13 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 18:38:19,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:38:19,631 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:38:19,644 INFO L227 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 33.33% of their original sizes. [2018-12-03 18:38:19,644 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:38:19,982 INFO L418 sIntCurrentIteration]: We unified 20 AI predicates to 20 [2018-12-03 18:38:19,983 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:38:19,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:38:19,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [10] total 26 [2018-12-03 18:38:19,983 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:38:19,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 18:38:19,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 18:38:19,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:38:19,984 INFO L87 Difference]: Start difference. First operand 6757 states and 11030 transitions. Second operand 18 states. [2018-12-03 18:38:27,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:38:27,948 INFO L93 Difference]: Finished difference Result 7512 states and 12291 transitions. [2018-12-03 18:38:27,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 18:38:27,948 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-12-03 18:38:27,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:38:27,953 INFO L225 Difference]: With dead ends: 7512 [2018-12-03 18:38:27,954 INFO L226 Difference]: Without dead ends: 7510 [2018-12-03 18:38:27,955 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=191, Invalid=931, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 18:38:27,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7510 states. [2018-12-03 18:38:32,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7510 to 6818. [2018-12-03 18:38:32,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6818 states. [2018-12-03 18:38:32,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6818 states to 6818 states and 11131 transitions. [2018-12-03 18:38:32,075 INFO L78 Accepts]: Start accepts. Automaton has 6818 states and 11131 transitions. Word has length 21 [2018-12-03 18:38:32,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:38:32,075 INFO L480 AbstractCegarLoop]: Abstraction has 6818 states and 11131 transitions. [2018-12-03 18:38:32,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 18:38:32,076 INFO L276 IsEmpty]: Start isEmpty. Operand 6818 states and 11131 transitions. [2018-12-03 18:38:32,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 18:38:32,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:38:32,078 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:38:32,078 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:38:32,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:38:32,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1665064723, now seen corresponding path program 1 times [2018-12-03 18:38:32,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:38:32,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:32,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:38:32,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:32,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:38:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:38:32,189 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 18:38:32,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:38:32,190 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:38:32,190 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-03 18:38:32,190 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [20], [21], [38], [41], [56], [58], [61], [63], [65], [67], [70], [72] [2018-12-03 18:38:32,191 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:38:32,191 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:38:32,209 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:38:32,210 INFO L272 AbstractInterpreter]: Visited 15 different actions 72 times. Merged at 11 different actions 42 times. Widened at 3 different actions 5 times. Found 15 fixpoints after 8 different actions. Largest state had 0 variables. [2018-12-03 18:38:32,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:38:32,211 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:38:32,224 INFO L227 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 33.33% of their original sizes. [2018-12-03 18:38:32,224 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:38:32,564 INFO L418 sIntCurrentIteration]: We unified 20 AI predicates to 20 [2018-12-03 18:38:32,564 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:38:32,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:38:32,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [9] total 25 [2018-12-03 18:38:32,564 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:38:32,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 18:38:32,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 18:38:32,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:38:32,565 INFO L87 Difference]: Start difference. First operand 6818 states and 11131 transitions. Second operand 18 states. [2018-12-03 18:38:40,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:38:40,172 INFO L93 Difference]: Finished difference Result 7597 states and 12400 transitions. [2018-12-03 18:38:40,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 18:38:40,172 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-12-03 18:38:40,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:38:40,179 INFO L225 Difference]: With dead ends: 7597 [2018-12-03 18:38:40,179 INFO L226 Difference]: Without dead ends: 7595 [2018-12-03 18:38:40,181 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=940, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 18:38:40,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7595 states. [2018-12-03 18:38:44,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7595 to 6816. [2018-12-03 18:38:44,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6816 states. [2018-12-03 18:38:44,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6816 states to 6816 states and 11123 transitions. [2018-12-03 18:38:44,322 INFO L78 Accepts]: Start accepts. Automaton has 6816 states and 11123 transitions. Word has length 21 [2018-12-03 18:38:44,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:38:44,322 INFO L480 AbstractCegarLoop]: Abstraction has 6816 states and 11123 transitions. [2018-12-03 18:38:44,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 18:38:44,322 INFO L276 IsEmpty]: Start isEmpty. Operand 6816 states and 11123 transitions. [2018-12-03 18:38:44,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 18:38:44,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:38:44,324 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:38:44,325 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:38:44,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:38:44,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1673653662, now seen corresponding path program 1 times [2018-12-03 18:38:44,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:38:44,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:44,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:38:44,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:44,326 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:38:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:38:44,409 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 18:38:44,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:38:44,410 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:38:44,410 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-03 18:38:44,410 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [38], [41], [56], [58], [61], [63], [65], [66], [67], [70] [2018-12-03 18:38:44,411 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:38:44,411 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:38:44,428 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:38:44,428 INFO L272 AbstractInterpreter]: Visited 13 different actions 59 times. Merged at 9 different actions 34 times. Widened at 2 different actions 5 times. Found 14 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 18:38:44,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:38:44,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:38:44,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:38:44,430 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 18:38:44,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:38:44,438 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:38:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:38:44,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:38:44,568 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 18:38:44,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:38:44,698 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 18:38:44,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:38:44,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 23 [2018-12-03 18:38:44,718 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:38:44,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 18:38:44,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 18:38:44,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2018-12-03 18:38:44,719 INFO L87 Difference]: Start difference. First operand 6816 states and 11123 transitions. Second operand 16 states. [2018-12-03 18:38:58,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:38:58,729 INFO L93 Difference]: Finished difference Result 11465 states and 18753 transitions. [2018-12-03 18:38:58,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 18:38:58,729 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2018-12-03 18:38:58,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:38:58,738 INFO L225 Difference]: With dead ends: 11465 [2018-12-03 18:38:58,738 INFO L226 Difference]: Without dead ends: 11448 [2018-12-03 18:38:58,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2387 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1402, Invalid=6970, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 18:38:58,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11448 states. [2018-12-03 18:39:03,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11448 to 7570. [2018-12-03 18:39:03,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7570 states. [2018-12-03 18:39:03,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7570 states to 7570 states and 12374 transitions. [2018-12-03 18:39:03,393 INFO L78 Accepts]: Start accepts. Automaton has 7570 states and 12374 transitions. Word has length 21 [2018-12-03 18:39:03,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:39:03,394 INFO L480 AbstractCegarLoop]: Abstraction has 7570 states and 12374 transitions. [2018-12-03 18:39:03,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 18:39:03,394 INFO L276 IsEmpty]: Start isEmpty. Operand 7570 states and 12374 transitions. [2018-12-03 18:39:03,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 18:39:03,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:39:03,396 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 18:39:03,397 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:39:03,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:39:03,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1775646079, now seen corresponding path program 1 times [2018-12-03 18:39:03,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:39:03,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:39:03,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:39:03,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:39:03,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:39:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:39:03,508 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 18:39:03,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:39:03,508 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:39:03,508 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-03 18:39:03,509 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [11], [14], [29], [32], [45], [46], [47], [52], [56], [58], [61], [63], [65], [67], [70] [2018-12-03 18:39:03,510 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:39:03,510 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:39:03,526 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:39:03,527 INFO L272 AbstractInterpreter]: Visited 18 different actions 69 times. Merged at 16 different actions 38 times. Widened at 2 different actions 4 times. Found 16 fixpoints after 7 different actions. Largest state had 0 variables. [2018-12-03 18:39:03,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:39:03,532 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:39:03,544 INFO L227 lantSequenceWeakener]: Weakened 19 states. On average, predicates are now at 33.77% of their original sizes. [2018-12-03 18:39:03,545 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:39:04,260 INFO L418 sIntCurrentIteration]: We unified 20 AI predicates to 20 [2018-12-03 18:39:04,261 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:39:04,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:39:04,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [7] total 27 [2018-12-03 18:39:04,261 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:39:04,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 18:39:04,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 18:39:04,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2018-12-03 18:39:04,262 INFO L87 Difference]: Start difference. First operand 7570 states and 12374 transitions. Second operand 22 states. [2018-12-03 18:39:19,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:39:19,895 INFO L93 Difference]: Finished difference Result 14551 states and 23991 transitions. [2018-12-03 18:39:19,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 18:39:19,895 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-12-03 18:39:19,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:39:19,908 INFO L225 Difference]: With dead ends: 14551 [2018-12-03 18:39:19,908 INFO L226 Difference]: Without dead ends: 12256 [2018-12-03 18:39:19,913 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 73 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1685 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=932, Invalid=4618, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 18:39:19,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12256 states. [2018-12-03 18:39:27,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12256 to 10950. [2018-12-03 18:39:27,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10950 states. [2018-12-03 18:39:27,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10950 states to 10950 states and 17813 transitions. [2018-12-03 18:39:27,311 INFO L78 Accepts]: Start accepts. Automaton has 10950 states and 17813 transitions. Word has length 21 [2018-12-03 18:39:27,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:39:27,312 INFO L480 AbstractCegarLoop]: Abstraction has 10950 states and 17813 transitions. [2018-12-03 18:39:27,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 18:39:27,312 INFO L276 IsEmpty]: Start isEmpty. Operand 10950 states and 17813 transitions. [2018-12-03 18:39:27,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 18:39:27,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:39:27,315 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 18:39:27,315 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:39:27,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:39:27,315 INFO L82 PathProgramCache]: Analyzing trace with hash 778201157, now seen corresponding path program 1 times [2018-12-03 18:39:27,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:39:27,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:39:27,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:39:27,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:39:27,316 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:39:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:39:27,583 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 18:39:27,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:39:27,584 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:39:27,584 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-12-03 18:39:27,584 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [29], [32], [56], [57], [65], [67], [72] [2018-12-03 18:39:27,585 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:39:27,585 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:39:27,594 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:39:27,594 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 18:39:27,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:39:27,596 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:39:27,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:39:27,596 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 18:39:27,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:39:27,606 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:39:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:39:27,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:39:27,673 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 18:39:27,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:39:27,740 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 18:39:27,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:39:27,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 21 [2018-12-03 18:39:27,761 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:39:27,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 18:39:27,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 18:39:27,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-12-03 18:39:27,762 INFO L87 Difference]: Start difference. First operand 10950 states and 17813 transitions. Second operand 17 states. [2018-12-03 18:39:46,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:39:46,364 INFO L93 Difference]: Finished difference Result 19391 states and 31676 transitions. [2018-12-03 18:39:46,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 18:39:46,365 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 22 [2018-12-03 18:39:46,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:39:46,384 INFO L225 Difference]: With dead ends: 19391 [2018-12-03 18:39:46,384 INFO L226 Difference]: Without dead ends: 18455 [2018-12-03 18:39:46,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2305 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1800, Invalid=5340, Unknown=0, NotChecked=0, Total=7140 [2018-12-03 18:39:46,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18455 states. [2018-12-03 18:39:54,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18455 to 11384. [2018-12-03 18:39:54,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11384 states. [2018-12-03 18:39:54,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11384 states to 11384 states and 18563 transitions. [2018-12-03 18:39:54,599 INFO L78 Accepts]: Start accepts. Automaton has 11384 states and 18563 transitions. Word has length 22 [2018-12-03 18:39:54,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:39:54,599 INFO L480 AbstractCegarLoop]: Abstraction has 11384 states and 18563 transitions. [2018-12-03 18:39:54,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 18:39:54,599 INFO L276 IsEmpty]: Start isEmpty. Operand 11384 states and 18563 transitions. [2018-12-03 18:39:54,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 18:39:54,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:39:54,603 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 18:39:54,603 INFO L423 AbstractCegarLoop]: === Iteration 54 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:39:54,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:39:54,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1077507004, now seen corresponding path program 1 times [2018-12-03 18:39:54,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:39:54,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:39:54,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:39:54,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:39:54,604 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:39:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:39:54,690 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 18:39:54,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:39:54,690 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:39:54,690 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-12-03 18:39:54,690 INFO L205 CegarAbsIntRunner]: [0], [11], [14], [38], [41], [56], [58], [63], [65], [66] [2018-12-03 18:39:54,691 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:39:54,691 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:39:54,700 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:39:54,700 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 18:39:54,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:39:54,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:39:54,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:39:54,701 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 18:39:54,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:39:54,709 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:39:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:39:54,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:39:54,813 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 18:39:54,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:39:54,874 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 18:39:54,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:39:54,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2018-12-03 18:39:54,893 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:39:54,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:39:54,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:39:54,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-12-03 18:39:54,894 INFO L87 Difference]: Start difference. First operand 11384 states and 18563 transitions. Second operand 13 states. [2018-12-03 18:40:10,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:40:10,766 INFO L93 Difference]: Finished difference Result 22988 states and 37699 transitions. [2018-12-03 18:40:10,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 18:40:10,766 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2018-12-03 18:40:10,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:40:10,781 INFO L225 Difference]: With dead ends: 22988 [2018-12-03 18:40:10,782 INFO L226 Difference]: Without dead ends: 16913 [2018-12-03 18:40:10,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=505, Invalid=1475, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 18:40:10,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16913 states. [2018-12-03 18:40:18,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16913 to 11248. [2018-12-03 18:40:18,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11248 states. [2018-12-03 18:40:18,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11248 states to 11248 states and 18140 transitions. [2018-12-03 18:40:18,589 INFO L78 Accepts]: Start accepts. Automaton has 11248 states and 18140 transitions. Word has length 22 [2018-12-03 18:40:18,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:40:18,589 INFO L480 AbstractCegarLoop]: Abstraction has 11248 states and 18140 transitions. [2018-12-03 18:40:18,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:40:18,589 INFO L276 IsEmpty]: Start isEmpty. Operand 11248 states and 18140 transitions. [2018-12-03 18:40:18,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 18:40:18,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:40:18,592 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 18:40:18,593 INFO L423 AbstractCegarLoop]: === Iteration 55 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:40:18,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:40:18,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1430105776, now seen corresponding path program 1 times [2018-12-03 18:40:18,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:40:18,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:40:18,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:40:18,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:40:18,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:40:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:40:18,773 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 18:40:18,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:40:18,774 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:40:18,774 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-12-03 18:40:18,774 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [11], [14], [20], [22], [25], [27], [38], [41], [45], [47], [50], [52], [56], [57] [2018-12-03 18:40:18,775 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:40:18,775 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:40:18,782 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:40:18,782 INFO L272 AbstractInterpreter]: Visited 17 different actions 43 times. Merged at 15 different actions 20 times. Never widened. Found 9 fixpoints after 8 different actions. Largest state had 0 variables. [2018-12-03 18:40:18,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:40:18,783 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:40:18,794 INFO L227 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 28.94% of their original sizes. [2018-12-03 18:40:18,794 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:40:19,136 INFO L418 sIntCurrentIteration]: We unified 22 AI predicates to 22 [2018-12-03 18:40:19,136 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:40:19,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:40:19,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [9] total 26 [2018-12-03 18:40:19,136 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:40:19,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 18:40:19,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 18:40:19,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-12-03 18:40:19,137 INFO L87 Difference]: Start difference. First operand 11248 states and 18140 transitions. Second operand 19 states. [2018-12-03 18:40:33,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:40:33,932 INFO L93 Difference]: Finished difference Result 15613 states and 25183 transitions. [2018-12-03 18:40:33,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 18:40:33,932 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-12-03 18:40:33,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:40:33,948 INFO L225 Difference]: With dead ends: 15613 [2018-12-03 18:40:33,948 INFO L226 Difference]: Without dead ends: 15588 [2018-12-03 18:40:33,952 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 50 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=414, Invalid=1748, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 18:40:33,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15588 states. [2018-12-03 18:40:44,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15588 to 14642. [2018-12-03 18:40:44,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14642 states. [2018-12-03 18:40:44,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14642 states to 14642 states and 23519 transitions. [2018-12-03 18:40:44,514 INFO L78 Accepts]: Start accepts. Automaton has 14642 states and 23519 transitions. Word has length 23 [2018-12-03 18:40:44,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:40:44,514 INFO L480 AbstractCegarLoop]: Abstraction has 14642 states and 23519 transitions. [2018-12-03 18:40:44,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 18:40:44,514 INFO L276 IsEmpty]: Start isEmpty. Operand 14642 states and 23519 transitions. [2018-12-03 18:40:44,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 18:40:44,518 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:40:44,518 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 18:40:44,518 INFO L423 AbstractCegarLoop]: === Iteration 56 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:40:44,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:40:44,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1659562418, now seen corresponding path program 1 times [2018-12-03 18:40:44,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:40:44,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:40:44,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:40:44,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:40:44,520 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:40:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:40:44,645 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 18:40:44,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:40:44,645 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:40:44,646 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-12-03 18:40:44,646 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 18:40:44,647 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:40:44,647 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:40:44,664 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:40:44,664 INFO L272 AbstractInterpreter]: Visited 20 different actions 83 times. Merged at 17 different actions 46 times. Widened at 3 different actions 3 times. Found 18 fixpoints after 9 different actions. Largest state had 0 variables. [2018-12-03 18:40:44,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:40:44,667 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:40:44,678 INFO L227 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 27.78% of their original sizes. [2018-12-03 18:40:44,678 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:40:45,085 INFO L418 sIntCurrentIteration]: We unified 22 AI predicates to 22 [2018-12-03 18:40:45,085 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:40:45,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:40:45,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [9] total 27 [2018-12-03 18:40:45,085 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:40:45,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 18:40:45,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 18:40:45,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2018-12-03 18:40:45,086 INFO L87 Difference]: Start difference. First operand 14642 states and 23519 transitions. Second operand 20 states. [2018-12-03 18:41:15,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:41:15,526 INFO L93 Difference]: Finished difference Result 30113 states and 48630 transitions. [2018-12-03 18:41:15,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 18:41:15,526 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2018-12-03 18:41:15,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:41:15,558 INFO L225 Difference]: With dead ends: 30113 [2018-12-03 18:41:15,559 INFO L226 Difference]: Without dead ends: 30090 [2018-12-03 18:41:15,564 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 81 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1887 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1062, Invalid=5100, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 18:41:15,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30090 states. [2018-12-03 18:41:33,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30090 to 24670. [2018-12-03 18:41:33,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24670 states. [2018-12-03 18:41:33,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24670 states to 24670 states and 39444 transitions. [2018-12-03 18:41:33,448 INFO L78 Accepts]: Start accepts. Automaton has 24670 states and 39444 transitions. Word has length 23 [2018-12-03 18:41:33,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:41:33,448 INFO L480 AbstractCegarLoop]: Abstraction has 24670 states and 39444 transitions. [2018-12-03 18:41:33,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 18:41:33,449 INFO L276 IsEmpty]: Start isEmpty. Operand 24670 states and 39444 transitions. [2018-12-03 18:41:33,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 18:41:33,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:41:33,453 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:41:33,453 INFO L423 AbstractCegarLoop]: === Iteration 57 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:41:33,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:41:33,453 INFO L82 PathProgramCache]: Analyzing trace with hash 72285591, now seen corresponding path program 1 times [2018-12-03 18:41:33,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:41:33,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:41:33,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:41:33,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:41:33,455 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:41:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:41:33,546 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 18:41:33,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:41:33,547 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:41:33,547 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-12-03 18:41:33,547 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [20], [22], [25], [29], [32], [56], [57], [65], [67], [70], [72] [2018-12-03 18:41:33,548 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:41:33,548 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:41:33,562 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:41:33,562 INFO L272 AbstractInterpreter]: Visited 14 different actions 63 times. Merged at 11 different actions 37 times. Widened at 2 different actions 6 times. Found 14 fixpoints after 8 different actions. Largest state had 0 variables. [2018-12-03 18:41:33,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:41:33,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:41:33,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:41:33,565 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 18:41:33,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:41:33,575 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:41:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:41:33,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:41:33,667 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 18:41:33,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:41:33,736 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 18:41:33,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:41:33,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 18 [2018-12-03 18:41:33,755 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:41:33,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 18:41:33,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 18:41:33,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:41:33,756 INFO L87 Difference]: Start difference. First operand 24670 states and 39444 transitions. Second operand 16 states. [2018-12-03 18:41:41,401 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2018-12-03 18:42:01,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:42:01,102 INFO L93 Difference]: Finished difference Result 52873 states and 84720 transitions. [2018-12-03 18:42:01,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 18:42:01,102 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-12-03 18:42:01,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:42:01,139 INFO L225 Difference]: With dead ends: 52873 [2018-12-03 18:42:01,139 INFO L226 Difference]: Without dead ends: 30311 [2018-12-03 18:42:01,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=781, Invalid=3775, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 18:42:01,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30311 states. [2018-12-03 18:42:18,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30311 to 23116. [2018-12-03 18:42:18,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23116 states. [2018-12-03 18:42:18,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23116 states to 23116 states and 36738 transitions. [2018-12-03 18:42:18,580 INFO L78 Accepts]: Start accepts. Automaton has 23116 states and 36738 transitions. Word has length 23 [2018-12-03 18:42:18,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:42:18,580 INFO L480 AbstractCegarLoop]: Abstraction has 23116 states and 36738 transitions. [2018-12-03 18:42:18,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 18:42:18,580 INFO L276 IsEmpty]: Start isEmpty. Operand 23116 states and 36738 transitions. [2018-12-03 18:42:18,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 18:42:18,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:42:18,584 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:42:18,585 INFO L423 AbstractCegarLoop]: === Iteration 58 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:42:18,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:42:18,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1243548413, now seen corresponding path program 2 times [2018-12-03 18:42:18,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:42:18,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:42:18,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:42:18,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:42:18,586 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:42:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:42:18,767 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:42:18,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:42:18,767 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:42:18,768 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:42:18,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:42:18,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:42:18,768 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 18:42:18,776 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:42:18,776 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:42:18,785 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 18:42:18,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:42:18,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:42:18,899 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 18:42:18,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:42:19,014 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 18:42:19,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:42:19,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2018-12-03 18:42:19,034 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:42:19,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 18:42:19,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 18:42:19,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2018-12-03 18:42:19,035 INFO L87 Difference]: Start difference. First operand 23116 states and 36738 transitions. Second operand 17 states. [2018-12-03 18:42:21,339 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-12-03 18:42:22,563 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-12-03 18:42:26,052 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-12-03 18:42:27,889 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-12-03 18:42:55,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:42:55,066 INFO L93 Difference]: Finished difference Result 35225 states and 56394 transitions. [2018-12-03 18:42:55,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 18:42:55,066 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-12-03 18:42:55,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:42:55,105 INFO L225 Difference]: With dead ends: 35225 [2018-12-03 18:42:55,105 INFO L226 Difference]: Without dead ends: 35223 [2018-12-03 18:42:55,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 3103 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1785, Invalid=8315, Unknown=0, NotChecked=0, Total=10100 [2018-12-03 18:42:55,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35223 states. [2018-12-03 18:43:13,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35223 to 26376. [2018-12-03 18:43:13,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26376 states. [2018-12-03 18:43:13,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26376 states to 26376 states and 42111 transitions. [2018-12-03 18:43:13,862 INFO L78 Accepts]: Start accepts. Automaton has 26376 states and 42111 transitions. Word has length 23 [2018-12-03 18:43:13,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:43:13,862 INFO L480 AbstractCegarLoop]: Abstraction has 26376 states and 42111 transitions. [2018-12-03 18:43:13,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 18:43:13,862 INFO L276 IsEmpty]: Start isEmpty. Operand 26376 states and 42111 transitions. [2018-12-03 18:43:13,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 18:43:13,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:43:13,867 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 18:43:13,868 INFO L423 AbstractCegarLoop]: === Iteration 59 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:43:13,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:43:13,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1023806098, now seen corresponding path program 1 times [2018-12-03 18:43:13,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:43:13,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:43:13,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:43:13,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:43:13,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:43:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:43:13,966 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 18:43:13,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:43:13,966 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:43:13,966 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 18:43:13,966 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [11], [14], [20], [22], [25], [27], [38], [41], [56], [57], [58], [61], [65], [67], [70] [2018-12-03 18:43:13,968 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:43:13,968 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:43:13,982 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:43:13,983 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 18:43:13,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:43:13,984 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:43:13,998 INFO L227 lantSequenceWeakener]: Weakened 21 states. On average, predicates are now at 37.1% of their original sizes. [2018-12-03 18:43:13,998 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:43:14,908 INFO L418 sIntCurrentIteration]: We unified 23 AI predicates to 23 [2018-12-03 18:43:14,908 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:43:14,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:43:14,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [8] total 27 [2018-12-03 18:43:14,909 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:43:14,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 18:43:14,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 18:43:14,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-12-03 18:43:14,909 INFO L87 Difference]: Start difference. First operand 26376 states and 42111 transitions. Second operand 21 states. [2018-12-03 18:43:39,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:43:39,443 INFO L93 Difference]: Finished difference Result 27247 states and 43501 transitions. [2018-12-03 18:43:39,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 18:43:39,443 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 24 [2018-12-03 18:43:39,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:43:39,469 INFO L225 Difference]: With dead ends: 27247 [2018-12-03 18:43:39,470 INFO L226 Difference]: Without dead ends: 27245 [2018-12-03 18:43:39,474 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=362, Invalid=2394, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 18:43:39,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27245 states. [2018-12-03 18:43:58,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27245 to 26568. [2018-12-03 18:43:58,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26568 states. [2018-12-03 18:43:58,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26568 states to 26568 states and 42414 transitions. [2018-12-03 18:43:58,201 INFO L78 Accepts]: Start accepts. Automaton has 26568 states and 42414 transitions. Word has length 24 [2018-12-03 18:43:58,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:43:58,201 INFO L480 AbstractCegarLoop]: Abstraction has 26568 states and 42414 transitions. [2018-12-03 18:43:58,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 18:43:58,201 INFO L276 IsEmpty]: Start isEmpty. Operand 26568 states and 42414 transitions. [2018-12-03 18:43:58,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 18:43:58,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:43:58,206 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 18:43:58,207 INFO L423 AbstractCegarLoop]: === Iteration 60 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:43:58,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:43:58,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1423257468, now seen corresponding path program 2 times [2018-12-03 18:43:58,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:43:58,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:43:58,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:43:58,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:43:58,208 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:43:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:43:58,287 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 18:43:58,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:43:58,287 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:43:58,287 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:43:58,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:43:58,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:43:58,288 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 18:43:58,296 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:43:58,297 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:43:58,305 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 18:43:58,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:43:58,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:43:58,392 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 18:43:58,392 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:43:58,473 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 18:43:58,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:43:58,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2018-12-03 18:43:58,494 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:43:58,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 18:43:58,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 18:43:58,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-12-03 18:43:58,494 INFO L87 Difference]: Start difference. First operand 26568 states and 42414 transitions. Second operand 16 states. [2018-12-03 18:45:00,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:45:00,974 INFO L93 Difference]: Finished difference Result 109853 states and 176637 transitions. [2018-12-03 18:45:00,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 18:45:00,974 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2018-12-03 18:45:00,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:45:01,108 INFO L225 Difference]: With dead ends: 109853 [2018-12-03 18:45:01,108 INFO L226 Difference]: Without dead ends: 86300 [2018-12-03 18:45:01,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3679 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1726, Invalid=8986, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 18:45:01,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86300 states. [2018-12-03 18:45:39,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86300 to 57282. [2018-12-03 18:45:39,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57282 states. [2018-12-03 18:45:39,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57282 states to 57282 states and 91205 transitions. [2018-12-03 18:45:39,962 INFO L78 Accepts]: Start accepts. Automaton has 57282 states and 91205 transitions. Word has length 24 [2018-12-03 18:45:39,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:45:39,962 INFO L480 AbstractCegarLoop]: Abstraction has 57282 states and 91205 transitions. [2018-12-03 18:45:39,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 18:45:39,962 INFO L276 IsEmpty]: Start isEmpty. Operand 57282 states and 91205 transitions. [2018-12-03 18:45:39,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 18:45:39,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:45:39,968 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 18:45:39,969 INFO L423 AbstractCegarLoop]: === Iteration 61 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:45:39,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:45:39,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1423256698, now seen corresponding path program 1 times [2018-12-03 18:45:39,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:45:39,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:45:39,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:45:39,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:45:39,970 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:45:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:45:40,047 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 18:45:40,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:45:40,048 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:45:40,048 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 18:45:40,048 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 18:45:40,049 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:45:40,049 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:45:40,064 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:45:40,064 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 18:45:40,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:45:40,065 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:45:40,076 INFO L227 lantSequenceWeakener]: Weakened 21 states. On average, predicates are now at 32.14% of their original sizes. [2018-12-03 18:45:40,077 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:45:40,602 INFO L418 sIntCurrentIteration]: We unified 23 AI predicates to 23 [2018-12-03 18:45:40,602 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:45:40,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:45:40,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [7] total 28 [2018-12-03 18:45:40,603 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:45:40,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 18:45:40,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 18:45:40,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-12-03 18:45:40,604 INFO L87 Difference]: Start difference. First operand 57282 states and 91205 transitions. Second operand 23 states. [2018-12-03 18:46:50,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:46:50,973 INFO L93 Difference]: Finished difference Result 93377 states and 149511 transitions. [2018-12-03 18:46:50,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 18:46:50,973 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 24 [2018-12-03 18:46:50,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:46:51,110 INFO L225 Difference]: With dead ends: 93377 [2018-12-03 18:46:51,110 INFO L226 Difference]: Without dead ends: 93327 [2018-12-03 18:46:51,128 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1834 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1005, Invalid=5001, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 18:46:51,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93327 states. [2018-12-03 18:47:51,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93327 to 85047. [2018-12-03 18:47:51,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85047 states. [2018-12-03 18:47:51,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85047 states to 85047 states and 134967 transitions. [2018-12-03 18:47:51,499 INFO L78 Accepts]: Start accepts. Automaton has 85047 states and 134967 transitions. Word has length 24 [2018-12-03 18:47:51,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:51,500 INFO L480 AbstractCegarLoop]: Abstraction has 85047 states and 134967 transitions. [2018-12-03 18:47:51,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 18:47:51,500 INFO L276 IsEmpty]: Start isEmpty. Operand 85047 states and 134967 transitions. [2018-12-03 18:47:51,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 18:47:51,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:51,507 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 18:47:51,507 INFO L423 AbstractCegarLoop]: === Iteration 62 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:51,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:51,508 INFO L82 PathProgramCache]: Analyzing trace with hash 762381400, now seen corresponding path program 1 times [2018-12-03 18:47:51,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:51,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:51,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:51,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:51,509 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:51,654 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 18:47:51,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:51,655 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:51,655 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 18:47:51,655 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 18:47:51,656 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:47:51,656 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:47:51,670 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:47:51,670 INFO L272 AbstractInterpreter]: Visited 21 different actions 73 times. Merged at 18 different actions 40 times. Widened at 2 different actions 4 times. Found 16 fixpoints after 10 different actions. Largest state had 0 variables. [2018-12-03 18:47:51,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:51,873 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:47:51,886 INFO L227 lantSequenceWeakener]: Weakened 20 states. On average, predicates are now at 32.92% of their original sizes. [2018-12-03 18:47:51,886 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:47:53,191 INFO L418 sIntCurrentIteration]: We unified 23 AI predicates to 23 [2018-12-03 18:47:53,191 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:47:53,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:47:53,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [7] total 28 [2018-12-03 18:47:53,191 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:47:53,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 18:47:53,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 18:47:53,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2018-12-03 18:47:53,192 INFO L87 Difference]: Start difference. First operand 85047 states and 134967 transitions. Second operand 23 states.